mietek / imla2017View external linksLinks
Agda formalisation of NbE for λ□
☆18Dec 5, 2017Updated 8 years ago
Alternatives and similar repositories for imla2017
Users that are interested in imla2017 are comparing it to the libraries listed below
Sorting:
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 years ago
- ☆10May 3, 2017Updated 8 years ago
- Relative Monad Library for Agda☆24May 29, 2019Updated 6 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Nov 27, 2023Updated 2 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Sep 11, 2025Updated 5 months ago
- Algebraic proof discovery in Agda☆35Dec 6, 2021Updated 4 years ago
- My master thesis about generic programming and ornaments☆16Jul 5, 2016Updated 9 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆32Apr 29, 2023Updated 2 years ago
- Constructive definition of real numbers implemented in agda.☆10Jul 31, 2016Updated 9 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 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 2 months ago
- A library for doing generic programming in Agda☆36Jan 27, 2021Updated 5 years ago
- Type-Theory in Sequent Calculus☆14Jul 30, 2015Updated 10 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Jun 18, 2024Updated last year
- Multimode simple type theory as an Agda library.☆23Sep 18, 2024Updated last year
- System F in coq.☆19Jan 27, 2015Updated 11 years ago
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Aug 5, 2016Updated 9 years ago
- Library of the ##dependent distributed research support group☆119Jul 12, 2024Updated last year
- A Specification for Dependent Types in Haskell (Core)☆64Jun 30, 2022Updated 3 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- Agda formalisation of second-order abstract syntax☆55Aug 28, 2022Updated 3 years ago
- The multimode presheaf proof-assistant☆37Jan 23, 2026Updated 3 weeks ago
- Work in progress☆40Jun 7, 2025Updated 8 months ago
- System F-omega normalization by hereditary substitution in Agda☆62Aug 31, 2019Updated 6 years ago
- Agda code for experimenting with internal models of cubical type theory☆15Apr 3, 2018Updated 7 years ago
- ☆18May 10, 2022Updated 3 years ago
- Generation of abstract binding trees☆27Sep 26, 2025Updated 4 months ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- ☆21Jan 24, 2022Updated 4 years ago
- ☆16Dec 28, 2021Updated 4 years ago
- Another experiment in dependently typed languages, this time with some quantitative type theory smooshed in.☆18Oct 12, 2018Updated 7 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Jan 10, 2018Updated 8 years ago
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆45May 14, 2016Updated 9 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30May 10, 2022Updated 3 years ago