Notions of computation and monads
Information and Computation
Lisp and Symbolic Computation
Principles of Program Analysis
Principles of Program Analysis
Using a Continuation Twice and Its Implications for the Expressive Power of call/cc
Higher-Order and Symbolic Computation
Axioms for Recursion in Call-by-Value
Higher-Order and Symbolic Computation
An equational notion of lifting monad
Theoretical Computer Science - Category theory and computer science
Control categories and duality: on the categorical semantics of the lambda-mu calculus
Mathematical Structures in Computer Science
Premonoidal categories and notions of computation
Mathematical Structures in Computer Science
From control effects to typed continuation passing
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Duality between Call-by-Name Recursion and Call-by-Value Iteration
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
On the call-by-value CPS transform and its semantics
Information and Computation
Parameterizations and Fixed-Point Operators on Control Categories
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
HasCasl: Integrated higher-order specification and program development
Theoretical Computer Science
Parameterizations and fixed-point operators on control categories
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Proof abstraction for imperative languages
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Parameterizations and Fixed-Point Operators on Control Categories
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
A Relatively Complete Generic Hoare Logic for Order-Enriched Effects
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We introduce the notion of effectoid as a way of axiomatising the notion of "computational effect". Guided by classical algebra, we define several effectoids equationally and explore their relationship with each other. We demonstrate their computational relevance by applying them to global exceptions, partiality, continuations, and global state.