OPLSS / introduction-to-algebraic-effects-and-handlersLinks
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
Sorting:
- ICFP 2020 papers. Crowd-sourced☆91Updated 4 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- SPLV20 course notes☆112Updated 2 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆57Updated 6 years ago
- Dependent Object Types (DOT), bottom up☆87Updated 3 years ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- A "implementation" of Girard's paradox in OCaml☆109Updated 10 years ago
- TParsec - Total Parser Combinators in Idris☆95Updated last year
- Library of the ##dependent distributed research support group☆114Updated last year
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years 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
- A minimalistic, elegant and powerful approach to working with graphs in a functional programming language☆197Updated 3 years ago
- Notes and handouts from OPLSS 2018☆55Updated 6 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- The 2019/2020 edition of Strathclyde's CS316 Functional Programming course☆41Updated 5 years ago
- A tutorial on how Agda infers things☆58Updated last week
- Dependently Typed Lambda Calculus in Haskell☆115Updated 4 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated this week
- A comparison of how computational effects and handlers are implemented in various programming languages.☆141Updated 6 years ago
- Benchmarks for capture-avoiding substitution☆119Updated last month
- Agda bindings to SMT-LIB2 compatible solvers.☆100Updated 9 months ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 6 years ago
- being the materials for Summer 2013's course☆112Updated 2 years ago
- The category theory by example book☆59Updated 2 years ago
- Total Parser Combinators in Agda☆130Updated 2 years ago
- Towards changing things and see if it proofs☆60Updated 4 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Experiments with sequent calculi☆27Updated 4 years ago