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☆35Updated 4 years ago
- Hakyll support for Agda literate files☆19Updated 4 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Calculus of Constructions☆17Updated 6 years ago
- ☆23Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 8 months ago
- Linear map categories in Agda☆5Updated 2 years ago
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 7 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- Mtac in Agda☆28Updated 4 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Formalizations of strong normalization proofs☆35Updated 6 years ago
- ☆17Updated 6 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Category theory and algebra☆28Updated 9 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Dependently typed elimination functions using singletons☆28Updated 7 months ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- being the emperor of Mongo, but also a verb☆15Updated 6 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
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 7 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago