astump / cedille-core-specLinks
Specification of the Cedille Core language
☆33Updated 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:
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- HoTT in Lean 3☆82Updated 5 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆40Updated 4 years ago
- Miller/pattern unification in Agda☆68Updated 11 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated last month
- A showcase of interesting code and proof developments in Cedille☆36Updated 3 months ago
- Toy typechecker for Insanely Dependent Types☆81Updated 12 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Observational Type Theory as an Agda library☆55Updated 8 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Real number computation software☆127Updated 3 years ago
- A (formalised) general definition of type theories☆57Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated this week
- A formalization of M-types in Agda☆34Updated 5 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆84Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆77Updated 8 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- ☆84Updated 8 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- ☆36Updated 3 years ago