kai-qu / linear-logic
An encoding of linear logic in Coq with minimal Sokoban and blocks world examples
☆21Updated 2 years ago
Alternatives and similar repositories for linear-logic:
Users that are interested in linear-logic are comparing it to the libraries listed below
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 2 months ago
- Experiments with linear types☆14Updated 6 years ago
- ☆20Updated 6 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 6 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- Type theory in type theory☆16Updated 12 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- System F in coq.☆19Updated 10 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- The core logical system of the HaskHOL theorem prover. See haskhol.org for more details.☆2Updated 8 years ago
- ☆29Updated 9 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 4 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- ☆16Updated 6 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 7 years ago
- A dependently typed type checker for a TT with intervals☆22Updated 4 years ago
- A formalization of finite, constructive log analysis using linear temporal logic☆19Updated this week
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Build Status A Haskell implementation of the ZKBoo protocol for non-interactive zero-knowledge arguments of boolean circuits.☆18Updated 6 years ago
- Compositional type checking for Haskell☆36Updated 13 years ago
- An implementation of Ben Lippmeier's "Don't Substitute Into Abstractions"☆15Updated 6 years ago