pigworker / Totality
being the programs and code for a paper about general recursion
☆24Updated 10 years ago
Alternatives and similar repositories for Totality:
Users that are interested in Totality are comparing it to the libraries listed below
- System F implemented in Haskell☆24Updated 12 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- System F in coq.☆19Updated 10 years ago
- ☆12Updated 5 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 8 years ago
- Type-Theory in Sequent Calculus☆13Updated 9 years ago
- Concurrent IO language with Uniqueness Types☆9Updated 9 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 3 months ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- Base library for HoTT in Agda☆37Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 4 months ago
- Desc'n crunch: Descriptions, levitation, and reflecting the elaborator.☆11Updated 6 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Dependently typed elimination functions using singletons☆28Updated 2 months ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 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
- 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
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated last month
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago