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:
- An embedding of ZFC into Agda☆13Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆114Updated 5 years ago
- A (formalised) general definition of type theories☆57Updated 4 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- Yet Another deep embedding of Linear Logic in Coq☆16Updated last week
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 11 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
- Specification of the Cedille Core language☆32Updated 5 years ago
- Mechanizations of Type Theories☆32Updated 2 weeks ago
- Research material of Erik Palmgren (1963–2019)☆21Updated 4 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆30Updated last year
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆76Updated last week
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆28Updated 2 years ago
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Updated 4 years ago
- HoTT in Lean 3☆80Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 months ago
- antifunext☆34Updated last year
- ☆36Updated 3 years ago
- Datatypes as quotients of polynomial functors☆36Updated 5 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆61Updated 11 months ago
- The official interpreter for the Jeopardy language☆16Updated 2 years ago
- This aims to be the most pretentious implementation of stlc in existence☆64Updated 3 years ago
- Template to effortlessly build math-rich websites☆39Updated 3 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆40Updated 4 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago