Proceedings Article10.1145/1599410.1599447
Relational semantics for effect-based program transformations: higher-order store
Nick Benton,Andrew Kennedy,Lennart Beringer,Martin Hofmann +3 more
- 07 Sep 2009
- pp 301-312
TL;DR: A denotational semantics is given to a type and effect system tracking reading and writing to global variables holding values that may include higher-order effectful functions.
read more
Abstract: We give a denotational semantics to a type and effect system tracking reading and writing to global variables holding values that may include higher-order effectful functions. Refined types are modelled as partial equivalence relations over a recursively-defined domain interpreting the untyped language, with effect information interpreted in terms of the preservation of certain sets of binary relations on the store.The semantics validates a number of effect-dependent program equivalences and can thus serve as a foundation for effect-based compiler transformations.The definition of the semantics requires the solution of a mixed-variance equation which is not accessible to the hitherto known methods. We illustrate the difficulties with a number of small example equations one of which is still not known to have a solution.
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
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
A Concurrent Logical Relation.
Lars Birkedal,Filip Sieczkowski,Jacob Thamsborg +2 more
- 01 Jan 2012
TL;DR: A Parallelization Theorem is proved, which expresses when it is sound to run two expressions in parallel instead of sequentially, and is the first such result for a concurrent higher- order language with higher-order store and dynamic memory allocation.
•Posted Content
Abstract Effects and Proof-Relevant Logical Relations
TL;DR: A denotational semantics for a region-based effect system that supports type abstraction in the sense that only externally visible effects need to be tracked: non-observable internal modifications can count as 'pure' or 'read only'.
28
References
Environmental bisimulations for higher-order languages
TL;DR: Environmental bisimulations is presented, a form of bisimulation for higher-order languages, and its basic theory, which scales from the pure lambda-calculi to the richer calculi with simple congruence proofs, and does not require induction/indices on evaluation derivation/steps.
On the Relation between Direct and Continuation Semantics
John C. Reynolds
- 29 Jul 1974
TL;DR: This work gives two theorems which specify the relationship between the direct and the continuation semantic functions for a purely applicative language and shows that direct semantics are included in continuation semantics.
Relational reasoning for recursive types and references
Nina Bohr,Lars Birkedal +1 more
- 08 Nov 2006
TL;DR: This work presents a local relational reasoning method for reasoning about contextual equivalence of expressions in a λ-calculus with recursive types and general references and makes use of some new ideas for proving the existence of the parameterized logical relation and for the choice of parameters.
36
•Book
Formal Logical Methods for System Security and Correctness
Orna Grumberg,Tobias Nipkow,Christian Pfaller +2 more
- 15 Mar 2008
TL;DR: The contributors have shown that methods of correct-by-construction program and process synthesis allow a high level programming method more amenable to security and reliability analysis and guarantees.
21
Relational parametricity for references and recursive types
Lars Birkedal,Kristian Støvring,Jacob Thamsborg +2 more
- 24 Jan 2009
TL;DR: The model is one of the first relationally parametric models of a programming language with impredicative polymorphism, general references, and recursive types and it is proved that the resulting semantics is adequate with respect to a standard operational semantics.
16
Related Papers (5)
David K. Gifford,John M. Lucassen +1 more
- 08 Aug 1986
Jacob Thamsborg,Lars Birkedal +1 more
- 19 Sep 2011
Eugenio Moggi
- 05 Jun 1989
Nick Benton,Martin Hofmann,Vivek Nigam +2 more
- 26 Jun 2013