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 7 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
- Algebraic proof discovery in Agda☆35Updated 3 years ago
- A (formalised) general definition of type theories☆58Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- An embedding of ZFC into Agda☆13Updated 3 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 2 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 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 last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]☆51Updated last year
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 6 months ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated 2 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- being a particular fragment of Haskell, extended to a proof system☆42Updated 3 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 5 years ago
- Work in progress☆38Updated 5 months ago
- Toy typechecker for Insanely Dependent Types☆82Updated last month
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated last week
- ☆45Updated 7 months ago
- Miller/pattern unification in Agda☆67Updated 3 weeks ago
- IO for Gallina☆32Updated 4 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated 11 months ago