A Vision for Relational Programming in miniKanren
summary
Implementation details dominate: miniKanren code runs in a web-based veneer REPL, defines a lambda-calculus syntax checker that also generates every syntactic term, implements ML-style type inference and backtracks to do type inhabitation, and runs a relational evaluator that actually discovers a quine. Examples are checked in to a git repo during the demo, the veneer instance sometimes needs a refresh, and the relational interpreter and type-generator both produce concrete, enumerable answers rather than just abstract examples.
AI-written summary · about
chapters (6)
- 0:00Start
- 2:55Venire Editor Refresh
- 3:25Relational Schema Interpreter
- 18:55Parts of Lambda Calculus
- 32:48Type Inference
- 36:46Lambda Expression
related talks
23mmediKanren: A System for Bio-medical Reasoning
23mImproving stableKanren’s Backward Compatibility
43mPost Functional
50mA Relational Exploration of the Chomsky Hierarchy
45mRaku for Prediction
38mProgram Synthesis: A Dream Realized?
25mInductive Synthesis of Structurally Recursive Functional Programs from Non-recur...
49mSemantic Foundations for Probabilistic Programming