gregr / first-order-miniKanrenLinks
miniKanren with a first-order representation of the search space
☆16Updated 11 months ago
Alternatives and similar repositories for first-order-miniKanren
Users that are interested in first-order-miniKanren are comparing it to the libraries listed below
Sorting:
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year
- Cur dependently-typed language in miniKanren.☆17Updated 7 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- software archaeology of reflective towers of interpreters☆16Updated last month
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!☆22Updated 9 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- Relational interpreter for miniKanren, in miniKanren.☆14Updated 3 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
- A showcase of interesting code and proof developments in Cedille☆36Updated last month
- Arete is an experimental programming language.☆12Updated last year
- A small NuPRL style proof assistant☆31Updated 6 years ago
- A very little language☆16Updated 2 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆22Updated 8 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- Racket bindings for Z3☆24Updated 6 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- A Gradual Dependently-typed Language☆14Updated 6 years ago
- Tree-automata-based run-time type constraints for miniKanren☆14Updated last year
- Miller/pattern unification in Agda☆65Updated 11 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- miniKanren for search, SMT for solving☆13Updated 5 years ago
- A string diagram generator for LaTeX.☆28Updated 2 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- A clean implementation of Parsing with Zippers.☆38Updated 6 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Generic implementation of different CFA families based on monadic decomposition☆21Updated 12 years ago
- Logic for story telling!☆34Updated 7 years ago