meta-logic / lltpLinks
TPTP linear logic version
☆13Updated 7 months ago
Alternatives and similar repositories for lltp
Users that are interested in lltp are comparing it to the libraries listed below
Sorting:
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆28Updated last year
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 11 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆22Updated 8 years ago
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆24Updated 10 months ago
- ☆17Updated 6 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆40Updated 4 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated 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
- A simple λProlog interpreter☆20Updated 3 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- ☆21Updated 7 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A proof tree viewer that works with Coq through Proof General☆28Updated 4 years ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- A clean implementation of Parsing with Zippers.☆38Updated 6 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆29Updated 2 weeks ago
- Experimental type-checker for internally parametric type theory☆32Updated 5 months ago
- Two-Level Type Theory☆28Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago