codyroux / name-the-biggest-number
☆62Updated 2 years ago
Related projects: ⓘ
- A (formalised) general definition of type theories☆56Updated 3 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆94Updated 5 months ago
- A quick reference for mapping Coq tactics to Lean tactics☆68Updated 3 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆44Updated 6 months ago
- This aims to be the most pretentious implementation of stlc in existence☆60Updated 2 years ago
- Lecture notes on realizability☆65Updated 5 months ago
- Agda formalisation of second-order abstract syntax☆51Updated 2 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆69Updated 3 weeks ago
- HoTT in Lean 3☆75Updated 4 years ago
- ☆35Updated 2 years ago
- A WIP definitional (co)datatype package for Lean4☆27Updated 3 weeks ago
- A non-interactive proof assistant using the Haskell type system☆35Updated 4 years ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- Latex documentation of our understanding of the synthetic /internal theory of the Zariski-Topos☆50Updated this week
- Documentation on goals of the coq-community organization, the shared contributing guide and code of conduct.☆68Updated 4 months ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆60Updated 2 months ago
- A tutorial on how Agda infers things☆33Updated 3 years ago
- A formalized proof of a version of the initiality conjecture☆41Updated 4 years ago
- Set up a specific version of Agda for your GitHub Actions workflow.☆26Updated 3 weeks ago
- sockets for Lean 4☆16Updated 2 months ago
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆50Updated 2 months ago
- LaTeX code for a paper on lean's type theory☆113Updated 2 years ago
- ☆27Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆83Updated 3 years ago
- Specification of the Cedille Core language☆29Updated 4 years ago
- Coq Repository at Nijmegen [maintainers=@spitters,@VincentSe,@Lysxia]☆108Updated 2 weeks ago
- Basics of the dependently-typed functional language Agda ^_^☆37Updated 2 years ago
- antifunext☆27Updated 2 months ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆91Updated 2 years ago