Proceedings Article10.1145/1273920.1273932
Relational semantics for effect-based program transformations with dynamic allocation
Nick Benton,Andrew Kennedy,Lennart Beringer,Martin Hofmann +3 more
- 14 Jul 2007
- pp 87-96
TL;DR: A denotational semantics is given to a region-based effect system tracking reading, writing and allocation in a higher-order language with dynamically allocated integer references that validates a number of effect-dependent program equivalences and can serve as a foundation for effect-based compiler transformations.
read more
Abstract: We give a denotational semantics to a region-based effect system tracking reading, writing and allocation in a higher-order language with dynamically allocated integer references.Effects are interpreted in terms of the preservation of certain binary relations on the store, parameterized by region-indexed partial bijections on locations.The semantics validates a number of effect-dependent program equivalences and can thus serve as a foundation for effect-based compiler transformations.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Koka: Programming with Row Polymorphic Effect Types.
Daan Leijen
- 05 Jun 2014
TL;DR: This work proposes a programming model where effects are treated in a disciplined way, and where the potential side-effects of a function are apparent in its type signature, and describes a polymorphic type inference system based on Hindley-Milner style inference.
Parametric effect monads and semantics of effect systems
Shin-ya Katsumata
- 08 Jan 2014
TL;DR: Fundamental properties of a generalisation of monad called parametric effect monad are studied, and they are applied to the interpretation of general effect systems whose effects have sequential composition operators.
127
Algebraic foundations for effect-dependent optimisations
Ohad Kammar,Gordon Plotkin +1 more
- 25 Jan 2012
TL;DR: This work develops an annotated version of Levy's Call-by-Push-Value language with a kind of computations for every effect set, and develops a range of validated optimisations, generalising many existing ones and adding new ones.
118
Parametric effect monads and semantics of effect systems
TL;DR: In this article, the authors study fundamental properties of a generalisation of monads called parametric effect monad, and apply it to the interpretation of general effect systems whose effects have sequential composition.
61
•Proceedings Article
A Logical Relation for Monadic Encapsulation of State: Proving contextual equivalences in the presence of runST
Amin Timany,Léo Stefanesco,Morten Krogh-Jespersen,Lars Birkedal +3 more
- 07 Jan 2018
TL;DR: This work uses a logical relations model of a higher-order functional programming language with impredicative polymorphism, recursive types, and a Haskell-style ST monad type to show that runST provides proper encapsulation of state, by showing that effectful computations encapsulated by runST are heap independent.
31
References
•Book
Communication and Concurrency
Robin Milner
- 01 Jan 1989
TL;DR: This chapter discusses Bisimulation and Observation Equivalence as a Modelling Communication, a Programming Language, and its application to Equational laws.
9K
Simple Relational Correctness Proofs for Static Analyses and Program Transformations (Revised, Long Version)
Nick Benton
- 01 Jan 2005
TL;DR: It is shown how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logical and denotationaltechniques.
255
•Book
Higher order operational techniques in semantics
Andrew D. Gordon,Andrew M. Pitts +1 more
- 01 Jun 1999
TL;DR: Introduction 1.
200
The marriage of effects and monads
Philip Wadler,Peter Thiemann +1 more
TL;DR: This work shows that the type, region, and effect system of Talpin and Jouvelot carries over directly to an analogous system for monads, including a type and effect reconstruction algorithm.
190
Observational purity and encapsulation
TL;DR: A notion of observational purity is formalized, the use of weakly and observationally pure methods in specifications are justified, and it is shown that a method is observationallypure if it simulates a weakly pure method.
71
Related Papers (5)
David K. Gifford,John M. Lucassen +1 more
- 08 Aug 1986
Jacob Thamsborg,Lars Birkedal +1 more
- 19 Sep 2011
Amal Ahmed,Derek Dreyer,Andreas Rossberg +2 more
- 21 Jan 2009