RichardMoot / LinearOne
LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.
☆18Updated 4 years ago
Alternatives and similar repositories for LinearOne:
Users that are interested in LinearOne are comparing it to the libraries listed below
- TPTP linear logic version☆13Updated this week
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- A dependently typed type checker for a TT with intervals☆22Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 5 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- Relational interpreter for miniKanren, in miniKanren.☆14Updated 3 years ago
- Type theory in type theory☆16Updated 12 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆20Updated 9 months ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- A Unifying Cartesian Cubical Set Model☆35Updated 5 years ago
- Research material of Erik Palmgren (1963–2019)☆20Updated last year
- Matita (proof assistant) with embedded elpi☆11Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- αProlog☆17Updated last year
- IO using sized types and copatterns☆33Updated 3 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 2 years ago
- ☆20Updated 6 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 3 months ago
- Implementation of Nuprl's type theory in Coq☆44Updated last month
- ☆17Updated 6 years ago
- Implementation of dependent type theory in SWI-Prolog☆8Updated 4 years ago
- Automated Reasoning for the Working Mathematician☆11Updated 5 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago