OPLSS / introduction-to-algebraic-effects-and-handlers
Introduction to algebraic effects and handlers
☆95Updated 6 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
- A "implementation" of Girard's paradox in OCaml☆106Updated 10 years ago
- Strongly-typed System F in Haskell☆116Updated 2 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- SPLV20 course notes☆108Updated 2 years ago
- ICFP 2020 papers. Crowd-sourced☆91Updated 4 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆97Updated 6 months ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆81Updated 3 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆56Updated 6 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 5 years ago
- Selective Applicative Functors: Declare Your Effects Statically, Select Which to Execute Dynamically☆205Updated last year
- Dependently Typed Lambda Calculus in Haskell☆114Updated 4 years ago
- TParsec - Total Parser Combinators in Idris☆93Updated last year
- Dependent Object Types (DOT), bottom up☆86Updated 3 years ago
- Programming library for Agda☆127Updated 8 months ago
- A minimalistic, elegant and powerful approach to working with graphs in a functional programming language☆196Updated 3 years ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- Benchmarks for capture-avoiding substitution☆113Updated last week
- Various data structures for use in the Idris Language.☆95Updated 4 years ago
- A small implementation of higher-order unification☆188Updated 7 years ago
- Total Parser Combinators in Agda☆126Updated last year
- Agda formalisation of the Introduction to Homotopy Type Theory☆123Updated 3 years ago
- The 2019/2020 edition of Strathclyde's CS316 Functional Programming course☆41Updated 4 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 8 months ago
- An implementation of Pie in Haskell☆205Updated 5 years ago
- A library for formalizing Haskell types and functions in Coq☆168Updated last year
- Unification and type inference algorithms☆125Updated 10 years ago
- Example implementation of Algorithm W for Hindley-Milner type inference☆79Updated 3 years ago
- ☆46Updated 5 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆81Updated 4 years ago