AndrasKovacs / ccttLinks
high-performance cubical evaluation
☆74Updated 3 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☆63Updated 3 years ago
- ♾️ A library for universe levels and universe polymorphism☆34Updated 7 months ago
- Lecture notes on realizability☆74Updated 5 months ago
- ☆36Updated 3 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- Eventually a practical 2-level TT-based compiler☆27Updated this week
- antifunext☆34Updated last year
- A work-in-progress core language for Agda, in Agda☆55Updated last month
- ☆25Updated 11 months ago
- ☆48Updated 2 months ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆67Updated 9 months ago
- Demo for dependent types + runtime code generation☆69Updated 5 months ago
- Latex documentation of our understanding of the synthetic /internal theory of the Zariski-Topos☆61Updated last week
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆14Updated last year
- Benchmarking various normalization algorithms for the lambda calculus☆45Updated 2 years ago
- Set up a specific version of Agda for your GitHub Actions workflow.☆28Updated this week
- A tutorial on how Agda infers things☆59Updated 3 weeks ago
- Setoid type theory implementation☆38Updated last year
- An attempt towards univalent classical mathematics in Cubical Agda.☆30Updated last year
- Benchmarks for capture-avoiding substitution☆119Updated 2 months ago
- Formal Topology in Univalent Foundations (WIP).☆36Updated 3 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last year
- being an operating system for typechecking processes☆128Updated 2 years ago
- A toy example of a verified compiler.☆28Updated 3 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 10 months ago
- An interactive theorem prover based on lambda-tree syntax☆96Updated 2 months ago
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- ☆29Updated 2 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated this week