namin / blondLinks
the reflective tower Blond by Olivier Danvy & Karoline Malmkjær
☆16Updated last month
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 last month
- Relational interpreter for miniKanren, in miniKanren.☆14Updated 3 years ago
- Pure relational SKI combinator calculus interpreter.☆11Updated 7 years ago
- Cur dependently-typed language in miniKanren.☆17Updated 7 years ago
- A small NuPRL style proof assistant☆31Updated 6 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
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year
- miniKanren with a first-order representation of the search space☆16Updated 11 months ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- miniKanren for search, SMT for solving☆13Updated 5 years ago
- A formally verified compiler for a simple language with numbers and sums☆27Updated 4 years ago
- An implementation of Haskell’s MVars in Racket☆29Updated 9 months ago
- Some rudimentary proofs on subtyping☆11Updated 3 years ago
- a self-hosting lambda calculus compiler☆35Updated 3 months ago
- A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!☆22Updated 9 years ago
- A very little language☆16Updated 2 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- A Dependently Typed Esolang☆10Updated 7 years ago
- A SKI combinators interpreter written in assembly☆20Updated 4 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated last year
- A simple λProlog interpreter☆20Updated 3 years ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated 8 months ago
- For supporting template-based programming☆21Updated 5 years ago
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Updated 4 years ago
- Code from the paper Reflection for the Masses by Charlotte Herzeel, Pascal Costanza, and Theo D'Hondt.☆14Updated 4 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- Idris 2 bindings to various C libraries☆15Updated 4 years ago
- A categorical semantics library in Agda.☆17Updated 5 years ago
- ☆17Updated last year