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 2 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
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 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
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- miniKanren with a first-order representation of the search space☆16Updated 8 months ago
- Type theory in type theory☆16Updated 13 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 10 years ago
- Research material of Erik Palmgren (1963–2019)☆20Updated 2 weeks ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Relational interpreter for miniKanren, in miniKanren.☆14Updated 3 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- ☆17Updated 6 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- IO using sized types and copatterns☆33Updated 4 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 9 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- ☆26Updated 8 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- AACMM's generic-syntax, but with QTT-style annotations☆20Updated last year
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- Haskell version of the code from "Handbook of Practical Logic and Automated Reasoning"☆16Updated last year
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago