From Greek to Clojure!
summary
Translates paper inference rules into working Clojure: implements Peano naturals and a three‑place plus as both a function and a relation, a simply‑typed lambda type inferrer over association‑list environments (with disequality for lexical shadowing), and a big‑step interpreter that can run backwards. Uses core.match for pattern cases and core.logic for relational, logic‑variable programming and type inhabitation to generate ten distinct lambda programs. Live examples evaluate and the relational interpreter produces the expected answers.
AI-written summary · about
chapters (11)
- 0:00Intro
- 1:17Core Logic
- 4:50Inference Rules
- 11:52Type Environment
- 16:22CoreLogic
- 19:37Typing Rules
- 24:42Examples
- 26:22Inference
- 27:09Reduction
- 30:46Evaluation
- 31:46lexical scoping
related talks
38mIntroduction to Logic Programming with Clojure
46mExpeditious Code via Inference
44mThe Dawn of Lisp, or How to Write Eval and Apply in Clojure
01h 02mSolving Problems the Clojure Way
20mClojure Tools for Symbolic Artificial Intelligence
31mDon't Stop Now
19mType Inference Logics
35mDesign and Prototype a Language In Clojure