namin / blond
the reflective tower Blond by Olivier Danvy & Karoline Malmkjær
☆15Updated 11 months ago
Related projects ⓘ
Alternatives and complementary repositories for blond
- software archaeology of reflective towers of interpreters☆15Updated last month
- Relational interpreter for miniKanren, in miniKanren.☆14Updated 3 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- Cur dependently-typed language in miniKanren.☆17Updated 6 years ago
- miniKanren with a first-order representation of the search space☆16Updated 3 months ago
- A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!☆22Updated 8 years ago
- Code from the paper Reflection for the Masses by Charlotte Herzeel, Pascal Costanza, and Theo D'Hondt.☆13Updated 3 years ago
- Pure relational SKI combinator calculus interpreter.☆10Updated 7 years ago
- Nominal logic programming extensions to miniKanren, based on alphaProlog.☆24Updated 10 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 9 years ago
- A certified semantics for relational programming workout.☆25Updated 4 years ago
- A Self-Interpreter for F-omega☆16Updated 8 years ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆34Updated 2 weeks ago
- A Scheme-like CBPV language with Racket Interoperability☆39Updated 8 months ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- Racket implementation of Cook and Lämmel's partial evaluation tutorial.☆32Updated 12 years ago
- A small NuPRL style proof assistant☆32Updated 5 years ago
- translations of a lambda abstraction to combinations of operators☆17Updated 5 years ago
- A type system for ML-style modules, solving the avoidance problem by focusing [Crary 2020]☆10Updated 4 years ago
- miniKanren for search, SMT for solving☆13Updated 5 years ago
- A library for non-deterministically parsing natural language expressions into a structured form.☆17Updated last year
- A playground for type theory implementations in Racket☆20Updated 8 years ago
- A very little language☆16Updated last year
- Implementation of dependent type theory in SWI-Prolog☆8Updated 4 years ago
- A categorical semantics library in Agda.☆17Updated 4 years ago
- Educational implementation of dependent types☆19Updated 6 years ago
- A proof that Idris is pacman complete☆8Updated 6 years ago
- Tree-automata-based run-time type constraints for miniKanren☆14Updated last year
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 10 years ago