RichardMoot / LinearOneLinks
LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.
☆20Updated 5 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☆36Updated 6 years ago
- A certified semantics for relational programming workout.☆26Updated 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
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 11 years ago
- TPTP linear logic version☆15Updated 11 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 4 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- A small NuPRL style proof assistant☆31Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- ☆17Updated 7 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Implementation of dependent type theory in SWI-Prolog☆10Updated 5 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 3 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- ☆16Updated 10 months ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Experimental normalisation via scheme☆12Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- being an experiment with potato power☆23Updated 5 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A simple λProlog interpreter☆20Updated 4 years ago
- A categorical semantics library in Agda.☆16Updated 6 years ago