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 9 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:
- Algebraic proof discovery in Agda☆35Updated 4 years ago
- Specification of the Cedille Core language☆34Updated 5 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- An embedding of ZFC into Agda☆13Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago
- Revised Omega-categorical Typechecker☆27Updated last year
- Automated Reasoning for the Working Mathematician☆11Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated last week
- The official interpreter for the Jeopardy language☆16Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆116Updated 5 years ago
- An equational theorem prover based on Knuth-Bendix completion☆57Updated last week
- Work in progress☆39Updated 7 months ago
- Organize mathematical thoughts☆21Updated 2 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 4 months 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 (formalised) general definition of type theories☆59Updated 4 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Updated 4 years ago
- Mechanizations of Type Theories☆33Updated this week
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated 2 years ago
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Updated 5 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 8 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Updated last year
- Miller/pattern unification in Agda☆66Updated 2 months ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 4 years ago