pigworker / TotalityLinks
being the programs and code for a paper about general recursion
☆26Updated 10 years ago
Alternatives and similar repositories for Totality
Users that are interested in Totality are comparing it to the libraries listed below
Sorting:
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- System F in coq.☆19Updated 10 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Base library for HoTT in Agda☆37Updated 6 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Bidirectional programming in Haskell with monadic profunctors☆47Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 2 months ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 3 months ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 9 months ago
- ☆23Updated 8 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 10 months ago
- Dependently typed elimination functions using singletons☆28Updated 9 months ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- ☆12Updated 6 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 8 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago