namin / blondLinks
the reflective tower Blond by Olivier Danvy & Karoline Malmkjær
☆16Updated 3 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 2 months ago
- miniKanren with a first-order representation of the search space☆17Updated last year
- Pure relational SKI combinator calculus interpreter.☆11Updated 8 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!☆22Updated 9 years ago
- Cur dependently-typed language in miniKanren.☆17Updated 7 years ago
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Updated 4 years ago
- a self-hosting lambda calculus compiler☆36Updated 4 months ago
- Code from the paper Reflection for the Masses by Charlotte Herzeel, Pascal Costanza, and Theo D'Hondt.☆14Updated 4 years ago
- Normalization-by-evaluation in miniKanren☆24Updated 2 years ago
- Slog 1.0☆43Updated last year
- Nominal logic programming extensions to miniKanren, based on alphaProlog.☆25Updated 11 years ago
- Reason about Term Rewriting Systems☆16Updated 3 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- A formally verified compiler for a simple language with numbers and sums☆27Updated 4 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 11 years ago
- TPTP linear logic version☆13Updated 6 months ago
- A simple λProlog interpreter☆20Updated 3 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- A SKI combinators interpreter written in assembly☆20Updated 5 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated last year
- miniKanren for search, SMT for solving☆13Updated 5 years ago
- A very little language☆16Updated 2 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- purple: compiling a reflective language☆33Updated 10 months ago
- Implementation of dependent type theory in SWI-Prolog☆10Updated 4 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- minikanren mips assembler/disassembler☆33Updated 10 years ago