dboulytchev / miniKanren-coqLinks
A certified semantics for relational programming workout.
☆26Updated 4 years ago
Alternatives and similar repositories for miniKanren-coq
Users that are interested in miniKanren-coq are comparing it to the libraries listed below
Sorting:
- A showcase of interesting code and proof developments in Cedille☆36Updated last week
- ☆17Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- ☆26Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- ☆18Updated 3 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Mtac in Agda☆28Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Deciding Presburger arithmetic in agda☆32Updated 2 years ago
- 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 Unifying Cartesian Cubical Set Model☆35Updated 5 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 5 months ago
- Intrinsic Verification of Formal Grammar Theory☆26Updated this week
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆27Updated last year
- Agda formalization of Intuitionistic Propositional Logic☆22Updated this week
- ☆19Updated 3 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- An enhanced unification algorithm for Coq☆56Updated 2 months ago
- Formalization of type theory☆22Updated 3 years ago
- Formalizing nbe in agda☆31Updated 12 years ago