codyroux / name-the-biggest-numberLinks
☆64Updated 3 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
Sorting:
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- A (formalised) general definition of type theories☆59Updated 4 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆71Updated 4 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆103Updated 5 months ago
- Lecture notes on realizability☆75Updated 11 months ago
- A work-in-progress core language for Agda, in Agda☆61Updated last week
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Updated 4 months ago
- Differential cohesion in Homotopy Type Theory by an axiomatized infinitesimal shape modality☆57Updated 3 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 4 months ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆48Updated last month
- A formalized proof of a version of the initiality conjecture☆45Updated 5 years ago
- ☆45Updated 9 months ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- # A simple variable binding library based on well-scoped indices and environments☆28Updated 3 months ago
- antifunext☆38Updated last year
- Formal Topology in Univalent Foundations (WIP).☆36Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆40Updated 3 years ago
- HoTT in Lean 3☆81Updated 5 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆68Updated last year
- A slow-paced introduction to reflection in Agda. ---Tactics!☆104Updated 3 years ago
- A Coq library for parametric coinduction☆51Updated 11 months ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆73Updated last year
- ☆31Updated 2 years ago
- being a particular fragment of Haskell, extended to a proof system☆43Updated last month
- A tutorial on how Agda infers things☆63Updated 6 months ago
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆52Updated last year
- A formalization of category theory in cubical Agda☆59Updated 5 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Updated 4 years ago
- Mechanizations of Type Theories☆33Updated last week