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 10 months ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ☆21Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 4 months ago
- Experiments with linear types☆14Updated 7 years ago
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Updated 5 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 6 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- ☆17Updated 6 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 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
- 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
- ☆29Updated 10 years ago
- being an experiment with potato power☆23Updated 5 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Build Status A Haskell implementation of the ZKBoo protocol for non-interactive zero-knowledge arguments of boolean circuits.☆18Updated 7 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Generation of abstract binding trees☆27Updated 2 weeks ago
- Towards Optic-Based Algebraic Theories: the Case of Lenses☆17Updated 6 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- ☆16Updated 7 months ago
- ☆26Updated 8 years ago