Back to Front and Beyond
summary
A new Lisp-like language compiles to C/LLVM, implements reference counting GC with tail-call optimization, immutable collections with transient-style in-place updates, and deterministic destructors that let a TCP server free sockets immediately. WebAssembly backend runs single-threaded with manual marshalling. An interpreter/scripting mode interoperates with compiled modules and higher-order callbacks. Performance tuning brings a naive 10× slower prototype down to beat Haskell on memory and nearly match OCaml on speed. The type system uses gradual typing via runtime assertions and optional type inference.
AI-written summary · about
chapters (12)
- 0:00Intro
- 3:23Programming Languages
- 8:51Category Theory
- 11:30Reference Counting
- 18:26Libraries
- 21:06Types
- 22:52Type Inference
- 31:41Compiler Infrastructure
- 34:59Interpreter Infrastructure
- 39:18Dependency Tree
- 41:19Conclusion
- 42:35Outro
