Concatenative programming and stack-based languages
summary
Shows that concatenative stack languages give a precise stack transformer semantics and that syntactic concatenation equals semantic composition so pieces compose without surprises, proves Turing-complete via SKI reduction starting from C and Lambda calculus, demonstrates compilation to x86 by concatenating instruction snippets, counts six operation categories and reduces them to a two‑primitive basis, and runs a real Uxn VM and ROMs on tiny hardware so the demos actually work like snake pong and a clock on a Pi badge.
AI-written summary · about
chapters (7)
- 0:00Stack-based languages intro
- 2:12Name-based vs stack-based
- 5:41Pythagorean theorem stack
- 13:05Stack programs meaning
- 21:58Stack languages Turing complete
- 32:08Associativity and parallelism
- 36:46Uxn stack example
related talks
41mConcatenative programming and stack-based languages
44mImplementing Software Machines in Go and C
13mDemo: RISC-V as an Enabler of Heterogeneous Compute
25mCo-operative JIT Compilation for Resource-Constrained Low-Power Coprocessors
28mReactive Programming on the Bare Metal:A Formal Model for a Low-Level Reactive Virtual Machin
57mAssembly crash course
36mExploiting Buffer Overflows on RISC-V
15mA Small Scheme VM, Compiler and REPL in 4K