kai-qu / linear-logicLinks
An encoding of linear logic in Coq with minimal Sokoban and blocks world examples
☆22Updated 4 years ago
Alternatives and similar repositories for linear-logic
Users that are interested in linear-logic are comparing it to the libraries listed below
Sorting:
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- Experiments with linear types☆14Updated 7 years ago
- A simple implementation of linear type theory☆39Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- ☆21Updated 7 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 8 years ago
- A dependently typed type checker for a TT with intervals☆24Updated 6 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Updated 3 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 11 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Updated 5 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 7 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Dependently typed Algorithm M and friends☆26Updated 7 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- A formal verification of Linear Temporal Logic in Coq☆23Updated 2 months ago
- Build Status A Haskell implementation of the ZKBoo protocol for non-interactive zero-knowledge arguments of boolean circuits.☆18Updated 7 years ago
- ☆17Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- The Alms Programming Language☆44Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 8 months ago
- ☆29Updated 10 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 7 years ago