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 6 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:
- Specification of the Cedille Core language☆33Updated 5 years ago
- A (formalised) general definition of type theories☆57Updated 4 years ago
- An embedding of ZFC into Agda☆13Updated 3 years ago
- ☆36Updated 3 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated last month
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]☆51Updated 11 months ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated 2 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆31Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 5 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated last month
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Updated 4 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 5 months ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆28Updated 3 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- ☆14Updated 6 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated 10 months ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- Organize mathematical thoughts☆20Updated 2 years ago
- Experiments with higher-order abstract syntax in Agda☆22Updated 3 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- Revised Omega-categorical Typechecker☆27Updated 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