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:
- System F in coq.☆19Updated 11 years ago
- Experiments with sequent calculi☆28Updated 4 years ago
- Tiny type-checker with dependent types☆78Updated 12 years ago
- Alternative Core language for GHC plugins☆39Updated 9 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆44Updated 6 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Adding linear types to Haskell in the style of Linear/Non-Linear (LNL) logic☆36Updated 7 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- Work on type class deriving with elaboration reflection☆32Updated 7 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- van Laarhoven lenses for Idris☆20Updated 8 years ago
- A simple implementation of linear type theory☆39Updated 8 years ago
- Deciding Presburger arithmetic in agda☆33Updated 2 years ago
- second-order abstract syntax☆31Updated 4 years ago
- Type Safe LLVM IR ( Experimental )☆49Updated 7 years ago
- Bidirectional programming in Haskell with monadic profunctors☆48Updated 3 years ago
- The Evolution of a Typechecker☆54Updated 7 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated 2 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 7 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- Implementing grep in Agda☆33Updated 5 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆18Updated 9 years ago
- ☆84Updated last year
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 9 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 4 years ago
- IO using sized types and copatterns☆36Updated 4 years ago