A Lazy Scheme In Haskell
summary
Claims a lazily evaluated subset of Scheme implemented in Haskell with an embedded interpreter and a plotting app frontend using threepenny‑gui and GitHub sources; prototypes started in F# but ported to Haskell after an FSH bug. The implementation removes macros, enforces no mutation whatsoever, exposes if as a first‑class function, and can run the real Y combinator quickly; garbage collection is left to the host runtime and may be added later in Rust. Performance is plausible and the interpreter is usable as a reference.
AI-written summary · about
chapters (8)
- 0:00Introduction
- 3:56Lisp garbage collection
- 10:12Lazy Scheme case
- 15:53Haskell interpreter
- 18:45Combinators and minimalist programming
- 23:24Bootstrapping Scheme
- 27:46Scheme as language
- 31:15Q&A
related talks
58mSome History of Functional Programming Languages
51mPragmatism, Puritanism and Functional Programming
20mData-oriented Design for Differentiable, Probabilistic Programming
59mIntroduction to FP Using Haskell (Part 1)
01h 02mScheme as a framework for Deep Learning
57mType Theory Behind Glasgow Haskell Compiler Internals (Part 1)
49mType Theory Behind the Glasgow Haskell Compiler Internals (Part 2)
44mDown the Wabbit Hole