andrejbauer / partial-combinatory-algebrasLinks
A Lean 4 formalization of partial combinatory algebras.
☆14Updated 9 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:
- formalization of an equivariant cartesian cubical set model of type theory☆20Updated 9 months ago
- ☆17Updated 3 months ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆14Updated last year
- ☆13Updated 2 months ago
- Experiments with Realizability in Univalent Type Theory☆19Updated 11 months ago
- ☆12Updated 7 months ago
- Topos theory in Lean 4☆16Updated 8 months ago
- A graduate course on formalized mathematics at the Faculty of Mathematics and Physics, University of Ljubljana, Fall semester 2024/25☆27Updated 9 months ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- Organize mathematical thoughts☆20Updated 2 years ago
- Intrinsic Verification of Formal Grammar Theory☆26Updated 2 months ago
- 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
- Building A Correct-By-Construction Proof Checkers For Type Theories☆26Updated this week
- Meta-programming utilities for Agda.☆20Updated 2 months ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated 2 years ago
- Experiments with higher-order abstract syntax in Agda☆22Updated 3 years ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Updated 3 years ago
- A formalization of the theory behind the mugen library☆19Updated last year
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- ☆17Updated 3 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆51Updated 2 weeks 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
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- HoTT Book formalisations in Rzk.☆19Updated last year
- ☆36Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- ☆17Updated last year
- An implementation of a simple Neural network in Idris using category theory.☆23Updated last year