jmchapman / TT-in-TTLinks
Type theory in type theory
☆16Updated 13 years ago
Alternatives and similar repositories for TT-in-TT
Users that are interested in TT-in-TT are comparing it to the libraries listed below
Sorting:
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- ☆18Updated 3 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- ☆21Updated 7 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- ☆17Updated 6 years ago
- Experiments in Synthetic Differential Geometry☆16Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆28Updated 3 weeks ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 5 months ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Constructive definition of real numbers implemented in agda.☆10Updated 8 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- ☆12Updated 5 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 2 months ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- a version of the 2048 game for Coq☆22Updated last year
- 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
- ☆26Updated 8 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 weeks ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago