TiarkRompf / collapsing-towersLinks
Collapsing Towers of Interpreters
☆91Updated 4 months ago
Alternatives and similar repositories for collapsing-towers
Users that are interested in collapsing-towers are comparing it to the libraries listed below
Sorting:
- multi-stage relational programming for staged relational interpreters: running with holes, faster☆137Updated 4 months ago
- Dependently-typed language with Iverson-style implicit lifting☆126Updated 5 years ago
- CLP(SMT) on top of miniKanren☆38Updated 3 years ago
- ☆137Updated 3 years ago
- The Makam Metalanguage☆200Updated 2 years ago
- An Introduction to Redex with Abstracting Abstract Machines☆104Updated last year
- surgical precision JIT compilers☆122Updated 8 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆81Updated 8 years ago
- A less devious proof assistant☆226Updated 2 years ago
- Logic for story telling!☆34Updated 7 years ago
- An efficient implementation of the higher-order logic programming language Lambda Prolog☆157Updated last year
- A small compiler for PCF☆127Updated 5 years ago
- purple: compiling a reflective language☆33Updated last year
- Slog 1.0☆45Updated last year
- Course on Metaprogramming☆72Updated 4 months ago
- source code for the bondi programming language☆42Updated 6 years ago
- Interpreter for the reversible functional language rFun☆37Updated 7 years ago
- Editor for language composition☆58Updated 2 years ago
- ☆62Updated 6 years ago
- The Mechanization of Standard ML☆74Updated 3 years ago
- Standard ML compiler based on typed intermediate languages.☆49Updated 11 years ago
- Prolog implementation of microKanren☆43Updated 10 years ago
- ☆98Updated this week
- A Pascal to LLVM compiler in Haskell☆124Updated 6 years ago
- higher order dependently typed logic programing☆173Updated 7 years ago
- ☆59Updated 11 years ago
- A compiler for functional programs on serialized data☆172Updated this week
- A fast implementation of miniKanren with disequality and absento, compatible with Racket and Chez.☆162Updated 9 months ago
- Abstract krivine machine implementing call-by-name semantics. In OCaml.☆45Updated 7 years ago
- SPSC: A Small Positive Supercompiler☆38Updated last year