dboulytchev / miniKanren-coqLinks
A certified semantics for relational programming workout.
☆26Updated 5 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:
- ☆17Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 7 months ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 4 years ago
- ☆18Updated 3 years ago
- Fintie Sets in Cubical Agda☆12Updated 6 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Intrinsic Verification of Formal Grammar Theory☆27Updated 2 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 7 months ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 7 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated 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 dynamically-typed CBPV language embedded in Racket☆40Updated last year
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Updated 9 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 weeks ago
- An enhanced unification algorithm for Coq☆58Updated this week
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- Experiments in Synthetic Differential Geometry☆16Updated 4 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 3 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- Deciding Presburger arithmetic in agda☆33Updated 2 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Updated 4 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated 2 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 3 months ago