astump / cedille-core-spec
Specification of the Cedille Core language
☆29Updated 4 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
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- A tutorial on how Agda infers things☆38Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆56Updated 7 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆81Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆71Updated 2 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆67Updated 7 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated 7 months ago
- ☆22Updated 8 years ago
- A (formalised) general definition of type theories☆57Updated 3 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 2 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆72Updated 2 months ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- HoTT in Lean 3☆76Updated 4 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical types☆26Updated last week
- A library for doing generic programming in Agda☆31Updated 3 years ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- Specification of the Cedilleum language, a dependently typed language with pattern matching that compiles to Cedille Core☆26Updated 5 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 5 years ago
- LL(1) parser generator verified in Coq☆45Updated 4 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated last month
- A nano "theorem prover".☆61Updated 5 years ago