Skip to main content

Effect Systems Revisited - Control-Flow Algebra and Semantics

Mycroft, Alan, Orchard, Dominic A., Petricek, Tomas (2016) Effect Systems Revisited - Control-Flow Algebra and Semantics. Lecture Notes in Computer Science, . pp. 1-32. ISSN 0302-9743. (doi:10.1007/978-3-319-27810-0_1) (KAR id:61623)

PDF Author's Accepted Manuscript
Language: English
Download (425kB) Preview
Official URL


Effect systems were originally conceived as an inference-based program analysis to capture program behaviour—as a set of (representations of) effects. Two orthogonal developments have since happened. First, motivated by static analysis, effects were generalised to values in an algebra, to better model control flow (e.g. for may/must analyses and concurrency). Second, motivated by semantic questions, the syntactic notion of set- (or semilattice-) based effect system was linked to the semantic notion of monads and more recently to graded monads which give a more precise semantic account of effects.

We give a lightweight tutorial explanation of the concepts involved in these two threads and then unify them via the notion of an effect-directed semantics for a control-flow algebra of effects. For the case of effectful programming with sequencing, alternation and parallelism—illustrated with music—we identify a form of graded joinads as the appropriate structure for unifying effect analysis and semantics.

Item Type: Article
DOI/Identification number: 10.1007/978-3-319-27810-0_1
Divisions: Faculties > Sciences > School of Computing
Depositing User: Dominic Orchard
Date Deposited: 05 May 2017 14:14 UTC
Last Modified: 29 May 2019 19:01 UTC
Resource URI: (The current URI for this page, for reference purposes)
Orchard, Dominic A.:
  • Depositors only (login required):


Downloads per month over past year