meta-logic / lltpLinks
TPTP linear logic version
☆15Updated 10 months ago
Alternatives and similar repositories for lltp
Users that are interested in lltp are comparing it to the libraries listed below
Sorting:
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Updated 5 years ago
- A simple λProlog interpreter☆20Updated 4 years ago
- Matita (proof assistant) with embedded elpi☆14Updated 7 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆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 implementation of a simple Neural network in Idris using category theory.☆23Updated last year
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 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.☆23Updated 9 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- Toy implementation of Martin-Löf Type Theory☆30Updated 3 years ago
- A proof tree viewer that works with Coq through Proof General☆28Updated 4 years ago
- A formalization of System Fω in Agda☆20Updated 10 months ago
- ☆21Updated 7 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- A type theory with native support for Polynomial Functors.☆41Updated 2 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 11 years ago
- ☆17Updated last year
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- ☆17Updated 7 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- ☆36Updated 4 years ago
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆29Updated last year
- Extra and extended datatypes for Lean 4☆12Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- Intrinsic Verification of Formal Grammar Theory☆27Updated 3 weeks ago