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☆34Updated 5 years ago
- An embedding of ZFC into Agda☆13Updated 3 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated last month
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated last week
- IO for Gallina☆32Updated 4 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Organize mathematical thoughts☆20Updated 2 years ago
- Algebraic proof discovery in Agda☆35Updated 3 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆26Updated 3 weeks ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 4 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A (formalised) general definition of type theories☆57Updated 4 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]☆51Updated last year
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 5 years ago
- ☆45Updated 6 months ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated 2 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- ☆36Updated 4 years ago
- Mechanizations of Type Theories☆32Updated this week
- Verified Extraction from Rocq to OCaml/Malfunction☆13Updated 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
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- my phd thesis☆26Updated last year
- being a particular fragment of Haskell, extended to a proof system☆42Updated 2 months ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago