OPLSS / introduction-to-algebraic-effects-and-handlersLinks
Introduction to algebraic effects and handlers
☆99Updated 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:
- SPLV20 course notes☆114Updated 3 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
- TParsec - Total Parser Combinators in Idris☆99Updated 2 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆84Updated 4 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆63Updated 6 months ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆57Updated 6 years ago
- A prototypical dependently typed languages with sized types and variances☆115Updated last week
- Strongly-typed System F in Haskell☆120Updated 3 years ago
- Dependently Typed Lambda Calculus in Haskell☆116Updated 4 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆85Updated 9 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆76Updated 7 years ago
- Organization and planning for the Initial Types Club☆75Updated 3 years ago
- Towards changing things and see if it proofs☆60Updated 4 years ago
- Total Parser Combinators in Agda☆132Updated 5 months ago
- A small implementation of higher-order unification☆192Updated 8 years ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- Dependent Object Types (DOT), bottom up☆89Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆116Updated 5 years ago
- A comparison of how computational effects and handlers are implemented in various programming languages.☆144Updated 6 years ago
- Benchmarks for capture-avoiding substitution☆121Updated 7 months ago
- An implementation of Pie in Haskell☆211Updated 6 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆133Updated 5 years ago
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- being an operating system for typechecking processes☆130Updated 3 months ago
- Library of the ##dependent distributed research support group☆118Updated last year
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- ☆48Updated 6 years ago
- A "implementation" of Girard's paradox in OCaml☆110Updated 10 years ago