kai-qu / linear-logicLinks
An encoding of linear logic in Coq with minimal Sokoban and blocks world examples
☆22Updated 3 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 11 months ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Experiments with linear types☆14Updated 7 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 6 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 8 years ago
- ☆21Updated 7 years ago
- A Dependently Typed Programming Language☆27Updated 5 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- An implementation of Ben Lippmeier's "Don't Substitute Into Abstractions"☆15Updated 7 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Experimental normalisation via scheme☆12Updated 4 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 5 months ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 5 years ago
- ☆16Updated 9 months ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- Type level algebraic "proofs" using lens combinators☆19Updated 6 years ago
- ☆17Updated 7 years ago
- Hakyll support for Agda literate files☆19Updated 4 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago