An interactive theorem prover based on lambda-tree syntax
☆99Jan 25, 2026Updated last month
Alternatives and similar repositories for abella
Users that are interested in abella are comparing it to the libraries listed below
Sorting:
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- Implementation of Nuprl's type theory in Coq☆47Feb 25, 2026Updated last week
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- Simplified Observational Type Theory☆87Feb 17, 2026Updated 2 weeks ago
- ☆12Jul 8, 2019Updated 6 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Jan 10, 2018Updated 8 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- An efficient implementation of the higher-order logic programming language Lambda Prolog☆173Apr 21, 2024Updated last year
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Dec 5, 2024Updated last year
- Interactive and object-oriented programming in Agda using coinductive types☆25Nov 29, 2025Updated 3 months ago
- Coq plugin embedding elpi☆184Updated this week
- Experimenting on ornamentation in Agda via reflection.☆12Jul 1, 2023Updated 2 years ago
- Observational Type Theory as an Agda library☆57May 27, 2017Updated 8 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆28Jul 3, 2025Updated 8 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆68Sep 17, 2024Updated last year
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- A polynomial model of a Martin-Löf type theory + a bit of game semantics☆31Dec 3, 2021Updated 4 years ago
- being the beginnings of at least zero typecheckers☆34Apr 13, 2017Updated 8 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- ☆21Jan 24, 2022Updated 4 years ago
- ☆13Dec 9, 2022Updated 3 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- Constructive definition of real numbers implemented in agda.☆10Jul 31, 2016Updated 9 years ago
- IO using sized types and copatterns☆36Apr 14, 2021Updated 4 years ago
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆215Mar 25, 2022Updated 3 years ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Apr 22, 2022Updated 3 years ago
- Miller/pattern unification in Agda☆68Oct 29, 2025Updated 4 months ago
- being a particular fragment of Haskell, extended to a proof system☆44Mar 2, 2026Updated last week
- Dependently typed Algorithm M and friends☆26Jun 2, 2018Updated 7 years ago
- Linearizability Hoare Logic☆17Feb 9, 2026Updated last month
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Dec 21, 2019Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Nov 28, 2024Updated last year
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Sep 11, 2025Updated 5 months ago
- Simply typed lambda calculus in cubical agda☆22Feb 22, 2020Updated 6 years ago
- Compiler backend for generating Scheme code☆28Nov 27, 2025Updated 3 months ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆76Jul 30, 2018Updated 7 years ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 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