kpavery / System-Fo
An implementation of the "lightweight" linear type system for System F◦ presented in "Lightweight Linear Types in System F◦" by Mazurak, et al.
☆33Updated 9 years ago
Related projects ⓘ
Alternatives and complementary repositories for System-Fo
- Work on type class deriving with elaboration reflection☆31Updated 6 years ago
- Experiments with sequent calculi☆26Updated 3 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Educational implementation of dependent types☆19Updated 6 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 8 years ago
- The Evolution of a Typechecker☆54Updated 5 years ago
- Simply typed lambda calculus in cubical agda☆21Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- System F in coq.☆19Updated 9 years ago
- Free Monads and useful constructions to work with them☆26Updated 6 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆22Updated 4 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated 11 months ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆42Updated 5 years ago
- Category theory formalized in cubical agda☆20Updated 4 years ago
- Alternative Core language for GHC plugins☆39Updated 8 years ago
- ☆12Updated 9 years ago
- Correctness of normalization-by-evaluation for STLC☆21Updated 5 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- System F implemented in Haskell☆24Updated 12 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated last month
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 2 years ago
- Where my everyday research happens☆53Updated last week
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- F-omega with interval kinds mechanized in Agda☆13Updated 3 months ago
- OCaml backend for Idris2☆19Updated 4 years ago
- Tiny type-checker with dependent types☆76Updated 10 years ago
- being a thing I build on a Saturday☆28Updated 6 years ago