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
- Tiny type-checker with dependent types☆78Updated 12 years ago
- Alternative Core language for GHC plugins☆39Updated 9 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 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
- Implementing grep in Agda☆33Updated 5 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- System F in coq.☆19Updated 10 years ago
- Adding linear types to Haskell in the style of Linear/Non-Linear (LNL) logic☆36Updated 7 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 11 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Generic functions for single-sorted first-order structural unification☆45Updated 8 months ago
- Unification and type inference algorithms☆127Updated 10 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- van Laarhoven lenses for Idris☆20Updated 8 years ago
- Map lazy functional language constructs to LLVM IR☆52Updated 6 years ago
- Fine-grain implementations of common lambda calculi in Haskell, tested with QuickCheck☆36Updated 4 years ago
- Type Safe LLVM IR ( Experimental )☆49Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 8 months ago
- second-order abstract syntax☆31Updated 4 years ago
- Where my everyday research happens☆55Updated this week
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated 2 years ago