samskivert / bidir-scalaLinks
A simple bidirectional type checker
☆18Updated 6 years ago
Alternatives and similar repositories for bidir-scala
Users that are interested in bidir-scala are comparing it to the libraries listed below
Sorting:
- An implementation of the "lightweight" linear type system for System F◦ presented in "Lightweight Linear Types in System F◦" by Mazurak, …☆33Updated 10 years ago
- Example row-polymorphism implementations☆61Updated last year
- every day i'm truffling☆70Updated 4 years ago
- Formalization of the Dependent Object Types (DOT) calculus☆66Updated 3 years ago
- Isomorphic Reasoning: Counting with Types☆38Updated 5 years ago
- A bidirectional type checker☆64Updated 8 years ago
- Dependent Object Types (DOT), bottom up☆88Updated 3 years ago
- MixML prototype interpreter☆27Updated 5 years ago
- Introduction to algebraic effects and handlers☆98Updated 7 years ago
- Experiments with sequent calculi☆28Updated 4 years ago
- A playground for parsers, type checkers, interpreters, compilers, etc.☆40Updated 8 months ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- ☆14Updated 6 years ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- An Idris 2 build tool and a package manager☆28Updated 2 years ago
- Alternative Core language for GHC plugins☆39Updated 9 years ago
- A well-typed symmetric-monoidal category of concurrent processes☆25Updated 6 years ago
- van Laarhoven lenses for Idris☆20Updated 8 years ago
- Proof theory seminar☆35Updated 4 years ago
- Effect Handlers for Java / the JVM☆29Updated 5 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 9 months ago
- prototyping logic programming in Scala☆41Updated 3 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 8 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆133Updated 5 years ago
- An interpreter of F-ing modules☆19Updated 6 years ago
- Work on type class deriving with elaboration reflection☆32Updated 7 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago