codyroux / name-the-biggest-number
☆63Updated 2 years ago
Alternatives and similar repositories for name-the-biggest-number:
Users that are interested in name-the-biggest-number are comparing it to the libraries listed below
- This aims to be the most pretentious implementation of stlc in existence☆62Updated 3 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆96Updated 5 months ago
- A quick reference for mapping Coq tactics to Lean tactics☆70Updated 3 years ago
- Write C shims from within Lean code.☆53Updated 4 months ago
- sockets for Lean 4☆18Updated 8 months ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆44Updated last year
- A (formalised) general definition of type theories☆57Updated 3 years ago
- A WIP definitional (co)datatype package for Lean4☆35Updated 3 months ago
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆51Updated 8 months ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated 4 months ago
- HoTT in Lean 3☆78Updated 4 years ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆61Updated 5 months ago
- Agda formalisation of second-order abstract syntax☆54Updated 2 years ago
- A Lean 4 library for configuring Command Line Interfaces and parsing command line arguments.☆75Updated 3 weeks ago
- Coq Repository at Nijmegen [maintainers=@spitters,@VincentSe,@Lysxia]☆114Updated 2 months ago
- ☆36Updated 3 years ago
- A formalized proof of a version of the initiality conjecture☆41Updated 4 years ago
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆40Updated 3 years ago
- Lecture notes on realizability☆73Updated last month
- A tutorial on how Agda infers things☆41Updated 4 years ago
- A work-in-progress core language for Agda, in Agda☆46Updated last week
- Datatypes as quotients of polynomial functors☆35Updated 4 years ago
- antifunext☆31Updated 9 months ago
- Formal Topology in Univalent Foundations (WIP).☆35Updated 2 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆100Updated 2 years ago
- A non-interactive proof assistant using the Haskell type system☆36Updated 4 years ago
- Documentation on goals of the coq-community organization, the shared contributing guide and code of conduct.☆68Updated 10 months ago
- Lean 4 kernel / 'external checker' written in Lean 4☆97Updated last month
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆49Updated 6 months ago