ComputerAidedLL / click-and-collect
A web interactive tool for building proofs in the sequent calculus of Linear Logic, with its backend written in OCaml
☆19Updated 2 years ago
Related projects ⓘ
Alternatives and complementary repositories for click-and-collect
- Coherence typechecker for infinity categories☆18Updated last week
- A (formalised) general definition of type theories☆56Updated 3 years ago
- Algebraic proof discovery in Agda☆32Updated 2 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 6 months ago
- Agda formalisation of second-order abstract syntax☆51Updated 2 years ago
- Algebraic Combinatorics in Coq☆36Updated last month
- A formalized proof of a version of the initiality conjecture☆41Updated 4 years ago
- Synthetic geometry. Probably mostly algebraic geometry.☆23Updated 9 months ago
- ☆12Updated 5 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆45Updated last month
- Research material of Erik Palmgren (1963–2019)☆20Updated last year
- A Henkin-style completeness proof for the modal logic S5☆13Updated 3 years ago
- Libraries demonstrating design patterns for programming and proving with canonical structures in Coq [maintainer=@anton-trunov]☆26Updated 2 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆44Updated 7 months ago
- IO for Gallina☆31Updated last month
- Class instances for Coq inductive types with little boilerplate☆24Updated 6 months ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆29Updated 3 months ago
- Generalized syntax & semantics for universe hierarchies☆28Updated 10 months ago
- Revised Omega-categorical Typechecker☆24Updated last week
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated last year
- HoTT in Lean 3☆75Updated 4 years ago
- Advent of Code 2020 solutions in Lean 4☆26Updated 3 years ago
- A tutorial on how Agda infers things☆34Updated 3 years ago
- An embedding of ZFC into Agda☆14Updated 2 years ago
- A reflection-based proof tactic for lattices in Coq☆20Updated last year
- ☆35Updated 3 years ago
- Datatypes as quotients of polynomial functors☆34Updated 4 years ago
- ☆14Updated 7 months ago
- Implementation of Nuprl's type theory in Coq☆44Updated 3 years ago
- antifunext☆28Updated 4 months ago