effect-handlers / effects-rosetta-stone
A comparison of how computational effects and handlers are implemented in various programming languages.
☆137Updated 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
- Build system☆123Updated last year
- A pure type system implemented in OCaml☆78Updated 4 years ago
- Dependent type checker using normalisation by evaluation☆260Updated 8 months ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆131Updated 4 years ago
- being an operating system for typechecking processes☆126Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- A "implementation" of Girard's paradox in OCaml☆107Updated 10 years ago
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆209Updated 3 years ago
- An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.☆147Updated last year
- Normalization by Evaluation for Martin-Löf Type Theory☆126Updated 11 months ago
- 😎TT☆226Updated last year
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- Dependently Typed Lambda Calculus in Haskell☆115Updated 4 years ago
- The Makam Metalanguage☆198Updated 2 years ago
- A compiler for functional programs on serialized data☆163Updated this week
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆58Updated last year
- Spartan type theory☆265Updated 11 months ago
- A prototype programming language for programming with runners☆89Updated 3 years ago
- Example implementation of Algorithm W for Hindley-Milner type inference☆79Updated 3 years ago
- Implementation of the λΠ-calculus modulo rewriting☆208Updated last week
- Prototype type inference engine☆201Updated 3 months ago
- Horn Clause Constraint Solving for Liquid Types☆145Updated 2 weeks ago
- SPLV20 course notes☆108Updated 2 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆121Updated 3 months ago
- Benchmarks for capture-avoiding substitution☆113Updated last week
- A small implementation of higher-order unification☆188Updated 7 years ago
- Strongly-typed System F in Haskell☆116Updated 2 years ago
- A tiny language, a subset of Haskell aimed at aiding teachers teach Haskell☆214Updated 2 years ago
- A statically-typed programming language based on "F-ing modules"☆81Updated 4 years ago
- OCaml extended with modular implicits☆104Updated 6 years ago