Chaaaos / formalttLinks
Formalization of type theory
☆22Updated 4 years ago
Alternatives and similar repositories for formaltt
Users that are interested in formaltt are comparing it to the libraries listed below
Sorting:
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- An Agda library for programming with ternary relations☆17Updated 5 months ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- Experiments in Synthetic Differential Geometry☆16Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Updated 3 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated last year
- Category theory formalized in cubical agda☆21Updated 5 years ago
- Anders: Cubical Type Checker☆23Updated last year
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 6 months ago
- Setoid type theory implementation☆38Updated 2 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- quotient types in cubical Agda☆24Updated 6 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Revised Omega-categorical Typechecker☆27Updated 11 months ago
- A formalization of the theory behind the mugen library☆19Updated last year
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last month
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years 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
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- ☆21Updated 3 years ago
- ☆23Updated 4 years ago