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
- Lecture notes on realizability☆74Updated 9 months ago
- A (formalised) general definition of type theories☆58Updated 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
- Agda bindings to SMT-LIB2 compatible solvers.☆103Updated 3 months ago
- A quick reference for mapping Coq tactics to Lean tactics☆71Updated 4 years ago
- A work-in-progress core language for Agda, in Agda☆59Updated 2 weeks ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated 2 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 2 months ago
- A tutorial on how Agda infers things☆63Updated 4 months ago
- A formalized proof of a version of the initiality conjecture☆44Updated 5 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆104Updated 3 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 3 months ago
- Differential cohesion in Homotopy Type Theory by an axiomatized infinitesimal shape modality☆56Updated 3 years ago
- ☆45Updated 7 months ago
- HoTT in Lean 3☆82Updated 5 years ago
- high-performance cubical evaluation☆76Updated 6 months ago
- ☆23Updated last year
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆67Updated last year
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆40Updated 3 years ago
- Benchmarks for capture-avoiding substitution☆120Updated 5 months ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated 3 months ago
- Formal Topology in Univalent Foundations (WIP).☆36Updated 3 years ago
- An interactive theorem prover based on lambda-tree syntax☆99Updated last month
- Library of the ##dependent distributed research support group☆117Updated last year
- # A simple variable binding library based on well-scoped indices and environments☆27Updated last month
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 3 months ago
- Datatypes as quotients of polynomial functors☆36Updated 5 years ago
- A TACtic library for Agda☆50Updated last year