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
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months 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
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- OCaml backend for Idris2☆20Updated 5 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 9 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- being an experiment with potato power☆23Updated 5 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A Dependently Typed Programming Language☆27Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 8 months ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 7 years ago
- Type Theory with Indexed Equality☆26Updated 8 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
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- ☆21Updated 7 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago