LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.
☆21Mar 9, 2026Updated last week
Alternatives and similar repositories for LinearOne
Users that are interested in LinearOne are comparing it to the libraries listed below
Sorting:
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Aug 1, 2014Updated 11 years ago
- TPTP linear logic version☆15Jan 27, 2025Updated last year
- an experiment in presenting code.☆14Aug 11, 2020Updated 5 years ago
- formally and easily, describe the semantics.☆13Aug 17, 2020Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Dec 21, 2019Updated 6 years ago
- A simple λProlog interpreter☆20Nov 29, 2021Updated 4 years ago
- An esoteric language based on overlapping tree-like structures☆10Oct 16, 2021Updated 4 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Nov 28, 2024Updated last year
- Lambda Calculus with quote and unquote☆19Jun 29, 2020Updated 5 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Feb 21, 2016Updated 10 years ago
- HW: a modern, open-source, typeless, turing-incomplete programming language.☆10Jul 17, 2018Updated 7 years ago
- A web interactive tool for building proofs in the sequent calculus of Linear Logic, with its backend written in OCaml☆24Apr 7, 2025Updated 11 months ago
- Polynomial semantics of linear logic☆13Apr 15, 2018Updated 7 years ago
- Haskell knowledgebase, Zettelkasten style (~2 months experiment, which resulted in migration to srid.ca)☆17Jun 11, 2020Updated 5 years ago
- ☆12Feb 11, 2019Updated 7 years ago
- A Programming language of directories. Just for fun.☆15Feb 2, 2023Updated 3 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Sep 11, 2025Updated 6 months ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Oct 5, 2020Updated 5 years ago
- secret project☆17Mar 14, 2018Updated 8 years ago
- Survey on materials that touch on the history of Lambda Calculus☆12Sep 13, 2020Updated 5 years ago
- Experiments in Synthetic Differential Geometry☆16Jul 1, 2021Updated 4 years ago
- Generation of abstract binding trees☆27Sep 26, 2025Updated 5 months ago
- Design, play with, and analyze sequent calculus proof systems.☆14Sep 5, 2024Updated last year
- Inline, type safe X86-64 assembly programming in Agda☆69Jan 3, 2019Updated 7 years ago
- A simple prolog implementation in Rust☆26Nov 14, 2020Updated 5 years ago
- A library for deadlock-free multiparty session-typed communication in Rust.☆31Sep 18, 2024Updated last year
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Jun 13, 2024Updated last year
- Semantic graph parser based on Categorial grammars☆16Jun 29, 2025Updated 8 months ago
- A Toy Inverse Bidirectional Typechecker☆32May 13, 2019Updated 6 years ago
- Abstract binding tree code generator☆37Oct 31, 2016Updated 9 years ago
- STLC-related snippets in Agda☆16May 1, 2013Updated 12 years ago
- SWORD: A Whole Program Race Detector for Java☆13Jan 30, 2021Updated 5 years ago
- Implementation of dependent type theory in SWI-Prolog☆10Oct 6, 2020Updated 5 years ago
- A small NuPRL style proof assistant☆31Jan 31, 2019Updated 7 years ago
- Standard ML compiler based on typed intermediate languages.☆51Aug 22, 2014Updated 11 years ago
- A verified Implementation of a mini prolog☆17Nov 27, 2022Updated 3 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago