ichistmeinname / free-provingLinks
Resources for "One Monad to Prove Them All"
☆29Updated 6 years ago
Alternatives and similar repositories for free-proving
Users that are interested in free-proving are comparing it to the libraries listed below
Sorting:
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
 - IO using sized types and copatterns☆36Updated 4 years ago
 - Calculus of Constructions☆17Updated 6 years ago
 - Type Theory with Indexed Equality☆26Updated 8 years ago
 - Formalizations of strong normalization proofs☆35Updated 6 years ago
 - Self-contained repository for the eponymous paper☆30Updated 6 years ago
 - A tiny implementation of dependent types.☆11Updated 8 years ago
 - Toy demo of lexing/parsing in Coq☆12Updated 6 years ago
 - ☆17Updated 7 years ago
 - being the programs and code for a paper about general recursion☆26Updated 10 years ago
 - Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
 - Mtac in Agda☆28Updated 4 years ago
 - Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
 - An abstract machine using indexed containers and their zippers☆13Updated 8 years ago
 - Category theory and algebra☆26Updated 9 years ago
 - A simple implementation of linear type theory☆38Updated 8 years ago
 - A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
 - A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
 - ☆18Updated 3 years ago
 - Agda formalization of Intuitionistic Propositional Logic☆22Updated 4 months ago
 - System F in coq.☆19Updated 10 years ago
 - A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
 - SML implementation of System T from PFPL.☆11Updated 8 years ago
 - Domain theory and denotational semantics in Coq☆10Updated 10 years ago
 - Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
 - Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
 - A clean implementation of Parsing with Zippers.☆38Updated 7 years ago
 - Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
 - A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 7 years ago
 - Session types in Idris2!☆27Updated 4 years ago