effect-handlers / effects-rosetta-stone
A comparison of how computational effects and handlers are implemented in various programming languages.
☆136Updated 5 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
- The Makam Metalanguage☆197Updated last year
- A compiler for functional programs on serialized data☆158Updated this week
- A "implementation" of Girard's paradox in OCaml☆105Updated 9 years ago
- A pure type system implemented in OCaml☆77Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- 😎TT☆222Updated last year
- Normalization by Evaluation for Martin-Löf Type Theory☆122Updated 8 months ago
- Build system☆123Updated last year
- Dependent type checker using normalisation by evaluation☆256Updated 5 months ago
- being an operating system for typechecking processes☆123Updated last year
- Prototype type inference engine☆200Updated 2 weeks ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆130Updated 4 years ago
- A statically-typed programming language based on "F-ing modules"☆80Updated 4 years ago
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆206Updated 2 years ago
- An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.☆147Updated 11 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- ICFP 2020 papers. Crowd-sourced☆91Updated 4 years ago
- Functional teaching language for use in a discrete mathematics course☆168Updated 3 weeks ago
- Horn Clause Constraint Solving for Liquid Types☆144Updated 2 weeks ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- A small implementation of higher-order unification☆186Updated 7 years ago
- A core language and API for dependently typed languages☆89Updated this week
- SPLV20 course notes☆108Updated 2 years ago
- an implementation of stuck macros☆138Updated this week
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆56Updated 9 months ago
- OCaml extended with modular implicits☆103Updated 6 years ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated last year
- Hoare Type Theory☆70Updated last month
- Example implementation of Algorithm W for Hindley-Milner type inference☆79Updated 3 years ago