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:
- Lecture notes on realizability☆74Updated 7 months ago
- A (formalised) general definition of type theories☆57Updated 4 years ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated last month
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 2 months ago
- Agda bindings to SMT-LIB2 compatible solvers.☆102Updated 2 months ago
- A work-in-progress core language for Agda, in Agda☆55Updated this week
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆46Updated last year
- A tutorial on how Agda infers things☆61Updated 3 months ago
- Benchmarks for capture-avoiding substitution☆120Updated 4 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated 2 months ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- Specification of the Cedille Core language☆33Updated 5 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆104Updated 3 years ago
- Differential cohesion in Homotopy Type Theory by an axiomatized infinitesimal shape modality☆54Updated 3 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated last month
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆40Updated 3 years ago
- ☆44Updated 6 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆63Updated last year
- Datatypes as quotients of polynomial functors☆36Updated 5 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 3 months ago
- high-performance cubical evaluation☆75Updated 5 months ago
- A non-interactive proof assistant using the Haskell type system☆38Updated 5 years ago
- antifunext☆34Updated last year
- A formalized proof of a version of the initiality conjecture☆43Updated 5 years ago
- Formal Topology in Univalent Foundations (WIP).☆36Updated 3 years ago
- A survey of semantics styles in Coq, from natural semantics through structural operational, axiomatic, and denotational semantics, to abs…☆54Updated 2 months ago