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:
- A "implementation" of Girard's paradox in OCaml☆108Updated 10 years ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- SPLV20 course notes☆111Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- TParsec - Total Parser Combinators in Idris☆95Updated last year
- Dependent Object Types (DOT), bottom up☆87Updated 3 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆99Updated 8 months ago
- Library of the ##dependent distributed research support group☆114Updated 11 months ago
- ICFP 2020 papers. Crowd-sourced☆91Updated 4 years ago
- A minimalistic, elegant and powerful approach to working with graphs in a functional programming language☆197Updated 3 years ago
- ☆46Updated 5 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆57Updated 6 years ago
- Various data structures for use in the Idris Language.☆95Updated 5 years ago
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years ago
- An implementation of Pie in Haskell☆205Updated 5 years ago
- Dependently Typed Lambda Calculus in Haskell☆115Updated 4 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Provides 'graded monads' and 'parameterised monads' to Haskell, enabling fine-grained reasoning about effects.☆100Updated last year
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 10 months ago
- The theory of algebraic graphs formalised in Agda☆90Updated 6 years ago
- A tutorial on how Agda infers things☆43Updated 4 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 6 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- ☆84Updated last year
- Selective Applicative Functors: Declare Your Effects Statically, Select Which to Execute Dynamically☆207Updated last year
- Total Parser Combinators in Agda☆129Updated 2 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- Learn the Agda basics in three 2-hour sessions.☆59Updated last year