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
- 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
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- Dependently typed elimination functions using singletons☆28Updated 6 months ago
- Mtac in Agda☆28Updated 4 years ago
- Category theory and algebra☆28Updated 8 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Session types in Idris2!☆27Updated 4 years ago
- ☆18Updated 3 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- a version of the 2048 game for Coq☆22Updated last year
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Formalizations of strong normalization proofs☆35Updated 6 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 4 months ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated 2 months ago
- Type Theory with Indexed Equality☆25Updated 8 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 7 months ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- ☆17Updated 6 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆35Updated 8 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago