OPLSS / introduction-to-algebraic-effects-and-handlersLinks
Introduction to algebraic effects and handlers
☆98Updated 7 years ago
Alternatives and similar repositories for introduction-to-algebraic-effects-and-handlers
Users that are interested in introduction-to-algebraic-effects-and-handlers are comparing it to the libraries listed below
Sorting:
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- ICFP 2020 papers. Crowd-sourced☆90Updated 5 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 4 years ago
- Strongly-typed System F in Haskell☆119Updated 3 years ago
- Dependent Object Types (DOT), bottom up☆89Updated 3 years ago
- SPLV20 course notes☆114Updated 3 years ago
- TParsec - Total Parser Combinators in Idris☆97Updated 2 years ago
- A prototypical dependently typed languages with sized types and variances☆113Updated 4 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- ☆84Updated last year
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 7 years ago
- A "implementation" of Girard's paradox in OCaml☆110Updated 10 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆57Updated 6 years ago
- Organization and planning for the Initial Types Club☆75Updated 3 years ago
- Dependently Typed Lambda Calculus in Haskell☆116Updated 4 years ago
- Basics of the dependently-typed functional language Agda ^_^☆40Updated 3 years ago
- ☆47Updated 6 years ago
- Provides 'graded monads' and 'parameterised monads' to Haskell, enabling fine-grained reasoning about effects.☆99Updated last month
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- The 2019/2020 edition of Strathclyde's CS316 Functional Programming course☆40Updated 5 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆131Updated last year
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- A tutorial on how Agda infers things☆63Updated 5 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆103Updated 4 months ago
- An implementation of Pie in Haskell☆211Updated 6 years ago
- Experiments with sequent calculi☆28Updated 4 years ago
- Haskell embedding of PlusCal☆62Updated 3 years ago
- Benchmarks for capture-avoiding substitution☆121Updated 6 months ago
- Selective Applicative Functors: Declare Your Effects Statically, Select Which to Execute Dynamically☆209Updated last month