These are talks I have given to the FORTH2020 user group, listed here in reverse chronological order (most recent first).
SKI Calculus, Minimal Formal Computation in AlexForth 6502
Combinators were first introduced by Moses Schönfinkel in 1920. He invented and presented for the very first time a formalism for a turing-complete universal computation, 16 years before Alonso Church’s Lambda Calculus and Alan Turing’s Turing Machines.
In this talk I quickly introduce the concepts of Combinators and Application, and I define the three S, K and I combinators that form the basis of the SKI Combinator Calculus. Then I dive into how to implement them in AlexForth. In this first part we implement SKI and booleans.
- Recording of the presentation during Forth2020 #42 meeting, February, 10th 2024
- SKI Calculus: Minimal Formal Computation in AlexForth 6502 - Slides
- SKI words in AlexForth 6502
Emu6502, a 65C02 emulator in Forth
This is the recording of the presentation I gave to the FORTH2020 users meeting on Jan 21st, 2023 about how I implemented Emu6502, a 65C02 emulator written in Forth.
AlexFORTH for 6502 - 2022.05 updates
This is the recording of the presentation I gave at the FORTH2020 group meeting of May 14th, 2022 about development updates of AlexForth for 6502.
Implementing AlexFORTH for a 6502 computer
This is the recording of the presentation I gave at the FORTH2020 group meeting of Dec 11th, 2021 about how I implemented AlexFORTH for my 6502 breadboard computer.
Demo of AlexFORTH on my 6502 computer. Writing on the LCD using FORTH.