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 3 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year
- Relational interpreter for miniKanren, in miniKanren.☆14Updated 3 years ago
- Research material of Erik Palmgren (1963–2019)☆20Updated last month
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- Type theory in type theory☆16Updated 13 years 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
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 5 months ago
- ☆19Updated 3 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- ☆22Updated 8 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆20Updated last year
- Implementation of dependent type theory in SWI-Prolog☆9Updated 4 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 10 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- Constructive definition of real numbers implemented in agda.☆10Updated 8 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Algebraic Combinatorics in Coq☆38Updated 3 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
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- miniKanren with a first-order representation of the search space☆16Updated 9 months ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆38Updated 10 months ago