namin / blondLinks
the reflective tower Blond by Olivier Danvy & Karoline Malmkjær
☆16Updated 8 months ago
Alternatives and similar repositories for blond
Users that are interested in blond are comparing it to the libraries listed below
Sorting:
- software archaeology of reflective towers of interpreters☆16Updated 8 months ago
- miniKanren with a first-order representation of the search space☆17Updated last year
- Normalization-by-evaluation in miniKanren☆25Updated 2 years ago
- A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!☆24Updated 9 years ago
- a self-hosting lambda calculus compiler☆37Updated 10 months ago
- Cur dependently-typed language in miniKanren.☆17Updated 8 years ago
- Tree-automata-based run-time type constraints for miniKanren☆14Updated 2 years ago
- Pure relational SKI combinator calculus interpreter.☆11Updated 8 years ago
- A dynamically-typed CBPV language embedded in Racket☆40Updated last year
- miniKanren for search, SMT for solving☆13Updated 6 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- Nominal logic programming extensions to miniKanren, based on alphaProlog.☆26Updated 12 years ago
- Code from the paper Reflection for the Masses by Charlotte Herzeel, Pascal Costanza, and Theo D'Hondt.☆14Updated 4 years ago
- A Dependently Typed Esolang☆10Updated 8 years ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- A small NuPRL style proof assistant☆31Updated 7 years ago
- Reason about Term Rewriting Systems☆18Updated 3 years ago
- minikanren mips assembler/disassembler☆34Updated 10 years ago
- A formally verified compiler for a simple language with numbers and sums☆27Updated 5 years ago
- αProlog☆18Updated 2 years ago
- A basic type system on top of Prolog, along with higher-order clauses. Translates to normal Prolog.☆31Updated 8 years ago
- Logic for story telling!☆36Updated 7 years ago
- translations of a lambda abstraction to combinations of operators☆18Updated 6 years ago
- Prove formulas of Presburger Arithmetic☆11Updated last year
- Implementation of local and remote loci for Racket☆12Updated 5 years ago
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Updated 5 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 11 years ago