neel-krishnaswami / linearmlLinks
A simple implementation of linear type theory
☆38Updated 8 years ago
Alternatives and similar repositories for linearml
Users that are interested in linearml are comparing it to the libraries listed below
Sorting:
- IO using sized types and copatterns☆36Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 8 months ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 7 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 9 years ago
- being an experiment with potato power☆23Updated 5 years ago
- ☆17Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- A prototype implementation of the Frank programming language☆17Updated 9 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- van Laarhoven lenses for Idris☆20Updated 8 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago