andrejbauer / faux-type-theoryLinks
☆43Updated last month
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 6 months ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 5 months ago
- ♾️ A library for universe levels and universe polymorphism☆35Updated 2 months ago
- A toy example of a verified compiler.☆29Updated 6 months ago
- A work-in-progress core language for Agda, in Agda☆55Updated 2 weeks ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- high-performance cubical evaluation☆75Updated 5 months ago
- A mechanisation of Wasm in Isabelle.☆27Updated last month
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆63Updated last year
- Lecture notes on realizability☆74Updated 8 months ago
- Coq development for the course "Mechanized semantics", Collège de France, 2019-2020☆68Updated last year
- A tutorial on how Agda infers things☆62Updated 3 months ago
- Mechanizations of Type Theories☆32Updated 2 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated last month
- Building A Correct-By-Construction Proof Checkers For Type Theories☆26Updated 2 weeks ago
- Algebraic proof discovery in Agda☆35Updated 3 years ago
- A cost-aware logical framework, embedded in Agda.☆67Updated 2 weeks ago
- ☆25Updated last year
- Deadlock freedom by type checking☆20Updated 2 years ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆28Updated 3 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 2 months ago
- Benchmarks for capture-avoiding substitution☆120Updated 4 months ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated 2 months ago
- Demo for dependent types + runtime code generation☆72Updated 8 months ago
- A prototype for a monadic program logic in Lean that has since been upstreamed into the Lean 4 repo☆37Updated 3 months ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated 2 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆46Updated last year
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated 2 months ago
- antifunext☆34Updated last year
- A deterministic parser with fused lexing☆74Updated 2 years ago