Contents

• Bytecode
  • Warren abstract machine
• General logic programming
  • Prolog
  • MiniKanren
  • Unification
  • Higher order logic programming
• Type inference
  • Cartesian product
• General algorithms
  • Graph/AST rewriting
• Implementations
  • FFI

---

Bytecode

Warren abstract machine

• Warren Abstract Machine on Wikipedia
• Warren’s Abstract Machine: A TUTORIAL RECONSTRUCTION

General logic programming

• Lucid Meets Prolog
• Backtracking, Interleaving, and Terminating Monad Transformers
• μKanren: a minimal functional core for logic programming

Prolog

• The Art of Prolog
• Constraint Handling Rules

MiniKanren

• Canonical miniKanren implementation
• Pythological
• miniKanren: an interactive Tutorial

Unification

• DPLL algorithm
• Unification

Higher order logic programming

• Higher-Order Unification and Matching
• HOPES - Higher-Order Prolog with Extensional Semantics
• Extensional Higher-Order Logic Programming

Type inference

Cartesian product

• The Cartesian Product Algorithm
• Type Inference Using the Cartesian Product Algorithm on a Dynamically Typed Language

General algorithms

Graph/AST rewriting

• Jeff Erickson algorithms classes notes

Implementations

FFI

• Lever:

  • https://github.com/cheery/lever/tree/master/runtime/stdlib/ffi
  • https://github.com/cheery/lever/blob/master/runtime/stdlib/api.py