pigworker / Totality
being the programs and code for a paper about general recursion
☆25Updated 10 years ago
Alternatives and similar repositories for Totality:
Users that are interested in Totality are comparing it to the libraries listed below
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- ☆12Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- System F in coq.☆19Updated 10 years ago
- Concurrent IO language with Uniqueness Types☆9Updated 10 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Mtac in Agda☆28Updated 4 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 8 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 6 years ago
- Dependently typed elimination functions using singletons☆28Updated 4 months ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 3 months ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Base library for HoTT in Agda☆37Updated 6 years ago