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:
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆44Updated 6 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 2 years ago
- Experiments with sequent calculi☆28Updated 4 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Work on type class deriving with elaboration reflection☆32Updated 7 years ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- System F in coq.☆19Updated 10 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- van Laarhoven lenses for Idris☆20Updated 8 years ago
- Adding linear types to Haskell in the style of Linear/Non-Linear (LNL) logic☆35Updated 7 years ago
- Alternative Core language for GHC plugins☆39Updated 9 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Implementing grep in Agda☆33Updated 4 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Map lazy functional language constructs to LLVM IR☆50Updated 6 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- ☆86Updated last year
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 10 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Simplified Observational Type Theory☆85Updated 2 years ago
- Where my everyday research happens☆55Updated this week
- This a type-checker plugin to rule all type checker plugins involving type-equality reasoning using smt solvers.☆21Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 4 months ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year