nikivazou / theorem-proving-templateLinks
Template repo for theorem proving in Liquid Haskell
☆32Updated 6 years ago
Alternatives and similar repositories for theorem-proving-template
Users that are interested in theorem-proving-template are comparing it to the libraries listed below
Sorting:
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- This a type-checker plugin to rule all type checker plugins involving type-equality reasoning using smt solvers.☆21Updated 3 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- ☆23Updated 7 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated 2 months ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Session types in Idris2!☆27Updated 4 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 7 months ago
- Session Types with Priority in Linear Haskell☆27Updated last year
- A tiny implementation of dependent types.☆11Updated 7 years ago
- van Laarhoven lenses for Idris☆20Updated 7 years ago
- Base library for HoTT in Agda☆37Updated 6 years ago
- being an experiment with potato power☆23Updated 5 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- Yet another concurrent playground☆33Updated 9 years ago
- Derivation of Optimized Definitions Based on Specs☆15Updated 5 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Dependently typed elimination functions using singletons☆28Updated 6 months ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- Deciding Presburger arithmetic in agda☆32Updated 2 years ago
- ☆12Updated 6 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆26Updated last week