ichistmeinname / free-proving
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
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 4 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
- ☆18Updated 2 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☆34Updated 5 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Session types in Idris2!☆27Updated 4 years ago
- Formalizations of strong normalization proofs☆35Updated 5 years ago
- Dependently typed elimination functions using singletons☆28Updated 3 months ago
- Mtac in Agda☆28Updated 3 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- My attempt to better understand both Coq and Category Theory by formalizing the latter in the former.☆14Updated 5 years ago
- Type Theory with Indexed Equality☆25Updated 8 years ago
- a version of the 2048 game for Coq☆22Updated last year
- IO using sized types and copatterns☆33Updated 4 years ago
- Toy demo of lexing/parsing in Coq☆12Updated 5 years ago
- Linear map categories in Agda☆5Updated last year
- Category theory and algebra☆28Updated 8 years ago
- A dependently typed type checker for a TT with intervals☆22Updated 5 years ago
- Type-Theory in Sequent Calculus☆13Updated 9 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- secret project☆17Updated 7 years ago
- Another experiment in dependently typed languages, this time with some quantitative type theory smooshed in.☆18Updated 6 years ago
- ☆17Updated 6 years ago
- A type system for ML-style modules, solving the avoidance problem by focusing [Crary 2020]☆10Updated 4 years ago
- ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.☆37Updated 2 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆28Updated 3 years ago