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:
- ☆17Updated 6 years ago
- ☆18Updated 3 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆28Updated 3 weeks ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 weeks ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 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 tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- ☆26Updated 8 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated 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 formalization of Pure Type Systems (PTS) in Agda☆23Updated 4 months ago
- Experiments in Synthetic Differential Geometry☆16Updated 3 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- ☆21Updated 7 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 6 years ago
- my phd thesis☆26Updated 9 months ago
- Quasi-quoting library for agda☆17Updated 6 months ago
- Agda code for experimenting with internal models of cubical type theory☆14Updated 7 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Intrinsic Verification of Formal Grammar Theory☆22Updated last week
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago