meta-logic / lltpLinks
TPTP linear logic version
☆14Updated 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 simple λProlog interpreter☆20Updated 3 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- a self-hosting lambda calculus compiler☆37Updated 5 months ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- 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 certified semantics for relational programming workout.☆26Updated 4 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- 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
- A clean implementation of Parsing with Zippers.☆38Updated 6 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- Matita (proof assistant) with embedded elpi☆13Updated 7 years ago
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆28Updated 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
- ☆21Updated 7 years ago
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated last year
- A language-integrated proof assistant, for and in Racket☆39Updated 9 years ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- Generation of abstract binding trees☆27Updated 10 months ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Implementation of dependent type theory in SWI-Prolog☆10Updated 4 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 4 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated this week