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 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
- Work on type class deriving with elaboration reflection☆32Updated 6 years ago
- Experiments with sequent calculi☆27Updated 4 years ago
- This a type-checker plugin to rule all type checker plugins involving type-equality reasoning using smt solvers.☆21Updated 3 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- System F in coq.☆19Updated 10 years ago
- Educational implementation of dependent types☆19Updated 6 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 5 months ago
- GRIN backend for Idris☆51Updated 5 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 9 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Deciding Presburger arithmetic in agda☆31Updated 2 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Alternative Core language for GHC plugins☆39Updated 9 years ago
- Category Theory in Agda. Learning exercise, not for public consumption.☆25Updated 5 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- "Programs that explain their effects" talk material☆17Updated 6 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- A well-typed symmetric-monoidal category of concurrent processes☆24Updated 6 years ago
- van Laarhoven lenses for Idris☆20Updated 7 years ago