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:
- A (formalised) general definition of type theories☆58Updated 4 years ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆71Updated 4 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆47Updated last year
- Lecture notes on realizability☆75Updated 9 months ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 4 months ago
- A work-in-progress core language for Agda, in Agda☆61Updated 2 weeks ago
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆52Updated last year
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆67Updated last year
- Agda bindings to SMT-LIB2 compatible solvers.☆103Updated 4 months ago
- Differential cohesion in Homotopy Type Theory by an axiomatized infinitesimal shape modality☆56Updated 3 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆79Updated 3 months ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- HoTT in Lean 3☆82Updated 5 years ago
- ☆45Updated 8 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 3 months ago
- antifunext☆34Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆84Updated 4 years ago
- Benchmarks for capture-avoiding substitution☆121Updated 6 months ago
- A formalized proof of a version of the initiality conjecture☆44Updated 5 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 3 months ago
- Mechanizations of Type Theories☆32Updated this week
- A Coq library for parametric coinduction☆51Updated 10 months ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated last week
- A TACtic library for Agda☆50Updated last year
- A slow-paced introduction to reflection in Agda. ---Tactics!☆104Updated 3 years ago
- ☆30Updated 2 years ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆71Updated last year
- A tutorial on how Agda infers things☆63Updated 5 months ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago