gregr / first-order-miniKanrenLinks
miniKanren with a first-order representation of the search space
☆16Updated 10 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:
- software archaeology of reflective towers of interpreters☆16Updated 2 weeks ago
- A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!☆22Updated 9 years ago
- Cur dependently-typed language in miniKanren.☆17Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Relational interpreter for miniKanren, in miniKanren.☆14Updated 3 years ago
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- A Gradual Dependently-typed Language☆14Updated 5 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- A very little language☆16Updated last year
- a version of the 2048 game for Coq☆22Updated last year
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- Toy demo of lexing/parsing in Coq☆12Updated 5 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- miniKanren for search, SMT for solving☆13Updated 5 years ago
- Because why wouldn't you want to typeset Coq in Scribble?☆10Updated 5 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
- Racket implementation of Cook and Lämmel's partial evaluation tutorial.☆31Updated 12 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 9 years ago
- An automated theorem prover for intuitionistic propostional logic☆12Updated 4 years ago
- Datalog implemented in minikanren☆24Updated 7 years ago
- A prototype of soft contract verification for an untyped functional language☆35Updated 4 years ago
- Generic implementation of different CFA families based on monadic decomposition☆21Updated 12 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- A clean implementation of Parsing with Zippers.☆38Updated 6 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- ☆12Updated last year