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☆35Updated 4 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 7 months ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 3 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last month
- being an experiment with potato power☆23Updated 5 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- A Dependently Typed Programming Language☆27Updated 4 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 7 months ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- OCaml backend for Idris2☆19Updated 4 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- ☆17Updated 6 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago