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:
- Dependently typed Algorithm M and friends☆26Updated 7 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Domain theory and denotational semantics in Coq☆10Updated 11 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Base library for HoTT in Agda☆38Updated 6 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Updated 3 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 8 years ago
- ☆12Updated 6 years ago
- ☆12Updated 10 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 8 months ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Updated 5 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Dependently typed elimination functions using singletons☆28Updated last year
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- System F in coq.☆19Updated 10 years ago
- Miller/pattern unification in Agda☆66Updated 2 months ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- Compositional type checking for Haskell☆38Updated 14 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago