effect-handlers / effects-rosetta-stone
A comparison of how computational effects and handlers are implemented in various programming languages.
☆136Updated 6 years ago
Alternatives and similar repositories for effects-rosetta-stone:
Users that are interested in effects-rosetta-stone are comparing it to the libraries listed below
- A pure type system implemented in OCaml☆78Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Build system☆123Updated last year
- Strongly-typed System F in Haskell☆116Updated 2 years ago
- The Makam Metalanguage☆198Updated 2 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆124Updated 10 months ago
- Example implementation of Algorithm W for Hindley-Milner type inference☆79Updated 3 years ago
- being an operating system for typechecking processes☆126Updated last year
- Dependently Typed Lambda Calculus in Haskell☆115Updated 4 years ago
- A "implementation" of Girard's paradox in OCaml☆106Updated 10 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- A compiler for functional programs on serialized data☆159Updated last week
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆131Updated 4 years ago
- 😎TT☆225Updated last year
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- Hoare Type Theory☆74Updated last week
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆58Updated 11 months ago
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆208Updated 3 years ago
- Horn Clause Constraint Solving for Liquid Types☆144Updated 2 weeks ago
- A bidirectional type checker☆62Updated 7 years ago
- Dependent type checker using normalisation by evaluation☆258Updated 7 months ago
- An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.☆147Updated last year
- A small implementation of higher-order unification☆188Updated 7 years ago
- Introduction to algebraic effects and handlers☆95Updated 6 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 7 years ago
- SPLV20 course notes☆108Updated 2 years ago
- Prototype type inference engine☆201Updated 2 months ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated 2 years ago
- Benchmarks for capture-avoiding substitution☆113Updated this week