kpavery / System-FoLinks
An implementation of the "lightweight" linear type system for System F◦ presented in "Lightweight Linear Types in System F◦" by Mazurak, et al.
☆33Updated 10 years ago
Alternatives and similar repositories for System-Fo
Users that are interested in System-Fo are comparing it to the libraries listed below
Sorting:
- Work on type class deriving with elaboration reflection☆32Updated 7 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- System F in coq.☆19Updated 10 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆44Updated 6 years ago
- Type Safe LLVM IR ( Experimental )☆49Updated 7 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Experiments with sequent calculi☆28Updated 4 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- being the materials for CS410 Advanced Functional Programming in the 2015/16 session☆40Updated 9 years ago
- Implementing grep in Agda☆33Updated 4 years ago
- Example row-polymorphism implementations☆61Updated 2 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Where my everyday research happens☆55Updated last month
- A simple implementation of linear type theory☆38Updated 8 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆53Updated 4 months ago
- IO using sized types and copatterns☆36Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Generic functions for single-sorted first-order structural unification☆45Updated 7 months ago
- van Laarhoven lenses for Idris☆20Updated 8 years ago
- "Programs that explain their effects" talk material☆17Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago