codyroux / name-the-biggest-number
☆63Updated 2 years ago
Related projects ⓘ
Alternatives and complementary repositories for name-the-biggest-number
- A tutorial on how Agda infers things☆36Updated 3 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆44Updated 8 months ago
- A (formalised) general definition of type theories☆56Updated 3 years ago
- Lecture notes on realizability☆65Updated last month
- This aims to be the most pretentious implementation of stlc in existence☆60Updated 2 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆71Updated last week
- Agda bindings to SMT-LIB2 compatible solvers.☆95Updated last month
- Reference sheet for people who know Lean 3 and want to write tactic-based proofs in Lean 4☆25Updated last week
- A Lean 4 library for configuring Command Line Interfaces and parsing command line arguments.☆69Updated 2 weeks ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- A formalized proof of a version of the initiality conjecture☆41Updated 4 years ago
- Agda formalisation of second-order abstract syntax☆52Updated 2 years ago
- An interactive theorem prover based on lambda-tree syntax☆90Updated this week
- A Coq library for parametric coinduction☆43Updated last month
- Latex documentation of our understanding of the synthetic /internal theory of the Zariski-Topos☆52Updated this week
- A WIP definitional (co)datatype package for Lean4☆27Updated 2 weeks ago
- Documentation on goals of the coq-community organization, the shared contributing guide and code of conduct.☆68Updated 6 months ago
- Set up a specific version of Agda for your GitHub Actions workflow.☆26Updated last month
- HoTT in Lean 3☆75Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆60Updated last month
- Book about using Lean with How To Prove It☆15Updated 2 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆52Updated 2 months ago
- antifunext☆28Updated 4 months ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆23Updated 2 years ago
- Formal Topology in Univalent Foundations (WIP).☆35Updated 2 years ago
- Typing the linear pi calculus in Agda☆29Updated 2 years ago
- ☆35Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆56Updated 5 years ago
- A non-interactive proof assistant using the Haskell type system☆35Updated 4 years ago