gregr / first-order-miniKanren
miniKanren with a first-order representation of the search space
☆16Updated 8 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
- Cur dependently-typed language in miniKanren.☆17Updated 7 years ago
- software archaeology of reflective towers of interpreters☆15Updated 5 months ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year
- A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!☆22Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- An automated theorem prover for intuitionistic propostional logic☆12Updated 4 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Racket bindings for Z3☆24Updated 5 years ago
- Relational interpreter for miniKanren, in miniKanren.☆14Updated 3 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 2 years ago
- Offline partial evaluation system for Prolog written using the cogen approach☆19Updated 8 years ago
- A very little language☆16Updated last year
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Tree-automata-based run-time type constraints for miniKanren☆14Updated last year
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- ☆18Updated 2 years ago
- ☆12Updated 9 months ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 5 months ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 10 years ago
- A Gradual Dependently-typed Language☆14Updated 5 years ago
- Racket bindings for Z3☆19Updated 12 years ago
- A prototype of soft contract verification for an untyped functional language☆34Updated 3 years ago
- Generic implementation of different CFA families based on monadic decomposition☆21Updated 12 years ago
- miniKanren for search, SMT for solving☆13Updated 5 years ago