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:
- SPLV20 course notes☆112Updated 2 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated last month
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 3 years ago
- TParsec - Total Parser Combinators in Idris☆95Updated 2 years ago
- ICFP 2020 papers. Crowd-sourced☆91Updated 5 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆102Updated last month
- Normalization by Evaluation for Martin-Löf Type Theory☆129Updated last year
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆72Updated 6 years ago
- Benchmarks for capture-avoiding substitution☆119Updated 3 months ago
- Dependent Object Types (DOT), bottom up☆88Updated 3 years ago
- A comparison of how computational effects and handlers are implemented in various programming languages.☆142Updated 6 years ago
- Strongly-typed System F in Haskell☆118Updated 2 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- Dependently Typed Lambda Calculus in Haskell☆115Updated 4 years ago
- Basics of the dependently-typed functional language Agda ^_^☆39Updated 3 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆61Updated 2 months ago
- A verified compiler for a lazy functional language☆37Updated this week
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 7 years ago
- being the materials for Summer 2013's course☆112Updated 2 years ago
- A tutorial on how Agda infers things☆61Updated 2 months ago
- Experiments with sequent calculi☆27Updated 4 years ago
- An implementation of Pie in Haskell☆209Updated 5 years ago