namin / lms-blackLinks
purple: compiling a reflective language
☆33Updated 11 months ago
Alternatives and similar repositories for lms-black
Users that are interested in lms-black are comparing it to the libraries listed below
Sorting:
- Collapsing Towers of Interpreters☆91Updated 2 months ago
- A basic type system on top of Prolog, along with higher-order clauses. Translates to normal Prolog.☆30Updated 7 years ago
- software archaeology of reflective towers of interpreters☆17Updated 3 months ago
- CLP(SMT) on top of miniKanren☆38Updated 3 years ago
- the reflective tower Blond by Olivier Danvy & Karoline Malmkjær☆16Updated 3 months ago
- Nominal logic programming extensions to miniKanren, based on alphaProlog.☆25Updated 11 years ago
- Datalog implemented in minikanren☆24Updated 8 years ago
- ICFP 2017 Artifact for Functional Pearl: A Unified Approach to Solving Seven Programming Problems☆29Updated 7 years ago
- Prolog implementation of microKanren☆43Updated 10 years ago
- source code for the bondi programming language☆41Updated 6 years ago
- Metacircular evaluator for a tiny fexpr language☆44Updated 13 years ago
- Dependently-typed language with Iverson-style implicit lifting☆126Updated 5 years ago
- Normalization-by-evaluation in miniKanren☆24Updated 2 years ago
- Cur dependently-typed language in miniKanren.☆17Updated 7 years ago
- A small language to demo turning an interpreter into a compiler☆11Updated 8 years ago
- ☆71Updated 5 years ago
- multi-stage relational programming for staged relational interpreters: running with holes, faster☆137Updated 3 months ago
- Logic for story telling!☆34Updated 7 years ago
- Type Inference Prototyping Engine from Relational specifications of type systems☆11Updated 5 years ago
- Interpreter for the reversible functional language rFun☆36Updated 7 years ago
- a minimal implementation of incremental computation in Scheme☆36Updated 8 years ago
- A Declarative Theorem Prover for First-Order Classical Logic☆28Updated last year
- Relational Hindley-Milner type inferencer in miniKanren. Supports polymorphic 'let'. Performs type habitation.☆21Updated 10 years ago
- Racket implementation of Cook and Lämmel's partial evaluation tutorial.☆31Updated 13 years ago
- (Somewhat) Algebraic Data Types for Racket☆34Updated 2 years ago
- ☆138Updated 3 years ago
- An Introduction to Redex with Abstracting Abstract Machines☆103Updated last year
- A SuperCompiler for Martin-Löf's Type Theory☆122Updated 3 years ago
- Editor for language composition☆58Updated 2 years ago
- An idris backend compiling to chez scheme☆48Updated 7 years ago