being the programs and code for a paper about general recursion
☆26Feb 15, 2015Updated 11 years ago
Alternatives and similar repositories for Totality
Users that are interested in Totality are comparing it to the libraries listed below
Sorting:
- Experiments with effect systems☆12Apr 18, 2016Updated 9 years ago
- Calculus of Constructions☆17Jul 17, 2019Updated 6 years ago
- Functional Programing in Scala (in Idris) [Idris]☆16Mar 23, 2015Updated 10 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Sep 22, 2020Updated 5 years ago
- Typed DSLs for sorting☆20Feb 16, 2018Updated 8 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- being the beginnings of at least zero typecheckers☆34Apr 13, 2017Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Jan 11, 2019Updated 7 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Oct 18, 2025Updated 4 months ago
- Translation of Agda code in A. Löh and J. P. Magalhães *Generic Programming with Indexed Functors* to Idris.☆14Apr 5, 2017Updated 8 years ago
- STLC-related snippets in Agda☆16May 1, 2013Updated 12 years ago
- ☆26Feb 7, 2017Updated 9 years ago
- A small NuPRL style proof assistant☆31Jan 31, 2019Updated 7 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Jul 24, 2019Updated 6 years ago
- Learn the Agda basics in three 2-hour sessions.☆60Sep 26, 2025Updated 5 months ago
- Gtk-based screen capturing utility for XMonad.☆25Apr 9, 2025Updated 10 months ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- ☆12Feb 11, 2019Updated 7 years ago
- ☆12May 9, 2015Updated 10 years ago
- A http client for Idris based on libcurl☆10Mar 18, 2016Updated 9 years ago
- An exploration and implementation of the lambda calculus.☆12Oct 18, 2016Updated 9 years ago
- A type theory based theorem proving library☆25Aug 23, 2011Updated 14 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Oct 9, 2018Updated 7 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Oct 1, 2017Updated 8 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 8 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 3 months ago
- Base library for HoTT in Agda☆39Apr 2, 2019Updated 6 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆49Jul 19, 2025Updated 7 months ago
- A showcase of interesting code and proof developments in Cedille☆36Jun 10, 2025Updated 8 months ago
- being the materials for CS410 Advanced Functional Programming in the 2015/16 session☆40May 24, 2016Updated 9 years ago
- Category Theory in Agda☆13Jan 16, 2018Updated 8 years ago
- Extensible, Type Safe Error Handling in Haskell☆13Dec 22, 2020Updated 5 years ago
- being the materials from my YOW LambdaJam 2016 talk☆11Jun 11, 2016Updated 9 years ago
- Pure relational SKI combinator calculus interpreter.☆11Jul 13, 2017Updated 8 years ago
- being an experiment with potato power☆23Jan 14, 2020Updated 6 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆85Jul 11, 2016Updated 9 years ago