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
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 8 months ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 8 months ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Observational Type Theory as an Agda library☆54Updated 8 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 months ago
- The Alms Programming Language☆44Updated 6 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆43Updated 6 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- being bits and pieces I'm inclined to leave lying around☆53Updated last month
- A version of Epigram 1 that can run with newer GHCs☆53Updated 8 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago