astump / cedille-core-specLinks
Specification of the Cedille Core language
☆35Updated 5 years ago
Alternatives and similar repositories for cedille-core-spec
Users that are interested in cedille-core-spec are comparing it to the libraries listed below
Sorting:
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 3 months ago
- A nano "theorem prover".☆62Updated 6 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated last week
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Updated last year
- A showcase of interesting code and proof developments in Cedille☆36Updated 8 months ago
- Observational Type Theory as an Agda library☆57Updated 8 years ago
- HoTT in Lean 3☆81Updated 5 years ago
- Real number computation software☆129Updated 3 years ago
- A (formalised) general definition of type theories☆59Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- being a particular fragment of Haskell, extended to a proof system☆43Updated 2 months ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- ☆38Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆116Updated 5 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- A verified compiler for a lazy functional language☆39Updated last week
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- A formalization of M-types in Agda☆36Updated 5 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Updated 5 months ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated 2 years ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆57Updated this week