jmchapman / TT-in-TT
Type theory in type theory
☆16Updated 12 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
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- ☆17Updated 6 years ago
- ☆20Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 3 months ago
- Experiments in Synthetic Differential Geometry☆15Updated 3 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- A dependently typed type checker for a TT with intervals☆22Updated 4 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 4 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- ☆18Updated 2 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆49Updated 4 months ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆16Updated 10 years ago
- Constructive definition of real numbers implemented in agda.☆10Updated 8 years ago
- Implementation of Nuprl's type theory in Coq☆44Updated last month
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Experiments with higher-order abstract syntax in Agda☆19Updated 2 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- ☆12Updated 5 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- Higher Algebra with Opetopic Types☆14Updated last year
- A library for doing generic programming in Agda☆31Updated 4 years ago