ComputerAidedLL / click-and-collectLinks
A web interactive tool for building proofs in the sequent calculus of Linear Logic, with its backend written in OCaml
☆22Updated 4 months ago
Alternatives and similar repositories for click-and-collect
Users that are interested in click-and-collect are comparing it to the libraries listed below
Sorting:
- A (formalised) general definition of type theories☆57Updated 4 years ago
- An embedding of ZFC into Agda☆13Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆113Updated 5 years ago
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- Real number computation software☆126Updated 2 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- Class instances for Coq inductive types with little boilerplate☆25Updated 3 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 10 months ago
- MLB support for CM (the SML/NJ Compilation and Library Manager)☆18Updated 2 months ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Revised Omega-categorical Typechecker☆27Updated 9 months ago
- Research material of Erik Palmgren (1963–2019)☆21Updated 4 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- Specification of the Cedille Core language☆32Updated 5 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- HoTT in Lean 3☆80Updated 5 years ago
- A polynomial model of a Martin-Löf type theory + a bit of game semantics☆32Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Organize mathematical thoughts☆20Updated last year
- ☆14Updated last year
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆29Updated this week
- Yet Another deep embedding of Linear Logic in Coq☆16Updated 4 months ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆46Updated last year
- Mechanizations of Type Theories☆31Updated last month
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆28Updated last year
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Work in progress☆37Updated 2 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 10 months ago
- ☆16Updated this week