ComputerAidedLL / click-and-collectLinks
A web interactive tool for building proofs in the sequent calculus of Linear Logic, with its backend written in OCaml
☆24Updated 10 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☆59Updated 4 years ago
- An embedding of ZFC into Agda☆13Updated 4 years ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated 2 years ago
- Algebraic proof discovery in Agda☆35Updated 4 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 4 months ago
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago
- Revised Omega-categorical Typechecker☆27Updated last year
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated 3 weeks ago
- Work in progress on semi-simplicial types☆23Updated 3 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- Mechanizations of Type Theories☆33Updated 3 weeks ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated last week
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Updated 5 years ago
- Research material of Erik Palmgren (1963–2019)☆21Updated 10 months ago
- Experiments with Realizability in Univalent Type Theory☆19Updated last year
- ☆45Updated 10 months ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- A type theory with native support for Polynomial Functors.☆41Updated 2 years ago
- ☆52Updated 5 months ago
- Automated Reasoning for the Working Mathematician☆11Updated 6 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated this week
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆15Updated 2 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- Organize mathematical thoughts☆21Updated 2 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago
- Yet Another deep embedding of Linear Logic in Coq☆16Updated last week
- Synthetic geometry. Probably mostly algebraic geometry.☆25Updated 2 years ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆29Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Updated 4 years ago