neel-krishnaswami / linearmlLinks
A simple implementation of linear type theory
☆39Updated 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
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 8 months ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- A dependently typed type checker for a TT with intervals☆24Updated 6 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 10 months ago
- being an experiment with potato power☆23Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆56Updated 3 weeks ago
- being the emperor of Mongo, but also a verb☆15Updated 7 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 9 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Tiny type-checker with dependent types☆78Updated 12 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 7 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
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 11 years ago
- ☆17Updated 7 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- OCaml backend for Idris2☆20Updated 5 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago