RichardMoot / LinearOneLinks
LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.
☆20Updated 4 years ago
Alternatives and similar repositories for LinearOne
Users that are interested in LinearOne are comparing it to the libraries listed below
Sorting:
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- TPTP linear logic version☆13Updated 6 months 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 dynamically-typed CBPV language embedded in Racket☆39Updated last year
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 11 years ago
- Implementation of dependent type theory in SWI-Prolog☆9Updated 4 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 8 months ago
- ☆17Updated 6 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 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.☆22Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Experimental normalisation via scheme☆12Updated 4 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆40Updated last year
- Formalisation of the linear lambda calculus in Coq☆10Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆25Updated 4 years ago
- ☆16Updated 5 months ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- being an experiment with potato power☆23Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 8 months ago