andrejbauer / faux-type-theoryLinks
☆46Updated 4 months ago
Alternatives and similar repositories for faux-type-theory
Users that are interested in faux-type-theory are comparing it to the libraries listed below
Sorting:
- ☆45Updated 9 months ago
- ♾️ A library for universe levels and universe polymorphism☆36Updated last month
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 8 months ago
- high-performance cubical evaluation☆79Updated 8 months ago
- A work-in-progress core language for Agda, in Agda☆61Updated last week
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- A toy example of a verified compiler.☆31Updated 8 months ago
- antifunext☆38Updated last year
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆68Updated last year
- Mechanizations of Type Theories☆32Updated this week
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated this week
- Coq development for the course "Mechanized semantics", Collège de France, 2019-2020☆70Updated last year
- A tutorial on how Agda infers things☆63Updated 6 months ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated 3 weeks ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆48Updated 3 weeks ago
- Demo for dependent types + runtime code generation☆72Updated 10 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 4 months ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated 2 years ago
- ☆25Updated last year
- BibTeX bibliographies for proof engineering-related papers☆30Updated 6 years ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated last week
- ☆38Updated 4 years ago
- Deadlock freedom by type checking☆20Updated 2 years ago
- Algebraic proof discovery in Agda☆35Updated 4 years ago
- being a particular fragment of Haskell, extended to a proof system☆43Updated last month
- A Coq library for parametric coinduction☆51Updated 11 months ago
- # A simple variable binding library based on well-scoped indices and environments☆28Updated 3 months ago
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆15Updated last year
- ☆31Updated 2 years ago