andrejbauer / partial-combinatory-algebrasLinks
A Lean 4 formalization of partial combinatory algebras.
☆14Updated 11 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 11 months ago
- HoTT Book formalisations in Rzk.☆19Updated 2 years ago
- Meta-programming utilities for Agda.☆20Updated 4 months ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆15Updated last year
- Topos theory in Lean 4☆16Updated 10 months ago
- ☆12Updated 9 months ago
- A formalization of the theory behind the mugen library☆19Updated last year
- Experiments with Realizability in Univalent Type Theory☆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 3 years ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated 2 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated this week
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Updated 3 years ago
- A graduate course on formalized mathematics at the Faculty of Mathematics and Physics, University of Ljubljana, Fall semester 2024/25☆27Updated 11 months ago
- Experiment with synthetic domain theory in cubical agda☆14Updated 3 years ago
- Intrinsic Verification of Formal Grammar Theory☆27Updated last month
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19Updated last year
- An implementation of a simple Neural network in Idris using category theory.☆24Updated last year
- Organize mathematical thoughts☆20Updated 2 years ago
- Experiments with higher-order abstract syntax in Agda☆22Updated 3 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- ☆16Updated last year
- H.O.T.T. using rewriting in Agda☆46Updated 3 years ago
- Algebraic proof discovery in Agda☆35Updated 4 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last month
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- ☆36Updated 4 years ago
- Synthetic geometry. Probably mostly algebraic geometry.☆25Updated last year
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Updated 4 years ago