AndrasKovacs / ccttLinks
high-performance cubical evaluation
☆75Updated 4 months ago
Alternatives and similar repositories for cctt
Users that are interested in cctt are comparing it to the libraries listed below
Sorting:
- This aims to be the most pretentious implementation of stlc in existence☆64Updated 3 years ago
- Lecture notes on realizability☆74Updated 6 months ago
- ☆25Updated last year
- A work-in-progress core language for Agda, in Agda☆55Updated 2 weeks ago
- ☆48Updated 3 weeks ago
- ♾️ A library for universe levels and universe polymorphism☆34Updated last month
- ☆36Updated 3 years ago
- Eventually a practical 2-level TT-based compiler☆27Updated last month
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆68Updated 10 months ago
- Demo for dependent types + runtime code generation☆71Updated 6 months ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- Latex documentation of our understanding of the synthetic /internal theory of the Zariski-Topos☆63Updated last week
- A tutorial on how Agda infers things☆61Updated 2 months ago
- antifunext☆34Updated last year
- being an operating system for typechecking processes☆128Updated 2 years ago
- Benchmarks for capture-avoiding substitution☆119Updated 3 months ago
- Set up a specific version of Agda for your GitHub Actions workflow.☆28Updated this week
- A toy example of a verified compiler.☆29Updated 4 months ago
- Benchmarking various normalization algorithms for the lambda calculus☆47Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- Extensions to cubical for categorical logic/type theory☆32Updated this week
- Mechanizations of Type Theories☆32Updated last month
- Formal Topology in Univalent Foundations (WIP).☆36Updated 3 years ago
- Setoid type theory implementation☆38Updated 2 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 11 months ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated last year
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆76Updated 2 weeks ago
- A formalized proof of a version of the initiality conjecture☆43Updated 5 years ago
- Ground Zero: Lean 4 HoTT Library☆66Updated 3 weeks ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆46Updated last year