andrejbauer / partial-combinatory-algebrasLinks
A Lean 4 formalization of partial combinatory algebras.
☆14Updated 7 months ago
Alternatives and similar repositories for partial-combinatory-algebras
Users that are interested in partial-combinatory-algebras are comparing it to the libraries listed below
Sorting:
- ☆17Updated last month
- formalization of an equivariant cartesian cubical set model of type theory☆20Updated 7 months ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆14Updated last year
- Topos theory in Lean 4☆15Updated 5 months ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆30Updated last year
- ☆13Updated last week
- ☆12Updated 4 months ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19Updated last year
- Intrinsic Verification of Formal Grammar Theory☆26Updated last week
- ☆36Updated 3 years ago
- Experiments with Realizability in Univalent Type Theory☆18Updated 9 months ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Updated 3 years ago
- Meta-programming utilities for Agda.☆19Updated this week
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- HoTT Book formalisations in Rzk.☆20Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆25Updated 4 years ago
- Organize mathematical thoughts☆20Updated last year
- Synthetic geometry. Probably mostly algebraic geometry.☆24Updated last year
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 10 months ago
- ☆17Updated 3 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last year
- ☆16Updated 3 years ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆51Updated last month
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- A formalization of the theory behind the mugen library☆19Updated last year
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆28Updated 2 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆32Updated 2 years ago