effect-handlers / effects-rosetta-stone
A comparison of how computational effects and handlers are implemented in various programming languages.
☆133Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for effects-rosetta-stone
- A pure type system implemented in OCaml☆77Updated 3 years ago
- Dependent type checker using normalisation by evaluation☆254Updated 2 months ago
- A compiler for functional programs on serialized data☆158Updated this week
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆129Updated 4 years ago
- The Makam Metalanguage☆194Updated last year
- Example implementation of Algorithm W for Hindley-Milner type inference☆77Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Build system☆122Updated last year
- being an operating system for typechecking processes☆121Updated last year
- Horn Clause Constraint Solving for Liquid Types☆141Updated last week
- Normalization by Evaluation for Martin-Löf Type Theory☆122Updated 5 months ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- A "implementation" of Girard's paradox in OCaml☆105Updated 9 years ago
- Dependently Typed Lambda Calculus in Haskell☆112Updated 3 years ago
- Benchmarks for capture-avoiding substitution☆107Updated 2 years ago
- Introduction to algebraic effects and handlers☆93Updated 6 years ago
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆204Updated 2 years ago
- An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.☆145Updated 8 months ago
- A prototypical dependently typed languages with sized types and variances☆104Updated 2 years ago
- SPLV20 course notes☆106Updated 2 years ago
- An implementation of Pie in Haskell☆204Updated 5 years ago
- an implementation of stuck macros☆132Updated 2 weeks ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated last year
- Prototype type inference engine☆197Updated 3 months ago
- Total Parser Combinators in Agda☆123Updated last year
- GRIN backend for GHC☆143Updated 3 years ago
- OCaml extended with modular implicits☆103Updated 6 years ago
- Frank compiler☆279Updated 6 months ago
- A minimal proof language.☆204Updated 5 years ago
- A statically-typed programming language based on "F-ing modules"☆80Updated 4 years ago