Relational semantics for effect-based program transformations: Higher-order store

PPDP'09 - Proceedings of the 11th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming

Volumn , Issue , 2009, Pages 301-311

  Benton, Nick ^a   Kennedy, Andrew ^a   Beringer, Lennart ^b   Hofmann, Martin ^b  

^a MICROSOFT RESEARCH   (United Kingdom)

^b UNIVERSITY OF MUNICH   (Germany)

Author keywords

Domain theory; Logical relations; Program transformation; Type and effect systems

Indexed keywords

BINARY RELATION; COMPILER TRANSFORMATIONS; DENOTATIONAL SEMANTICS; DOMAIN THEORY; EFFECT INFORMATION; GLOBAL VARIABLES; HIGHER ORDER; LOGICAL RELATIONS; PARTIAL EQUIVALENCE RELATIONS; PROGRAM EQUIVALENCE; PROGRAM TRANSFORMATIONS; REFINED TYPE; RELATIONAL SEMANTICS; TYPE AND EFFECT SYSTEMS; VARIANCE EQUATIONS;

COMPUTER PROGRAMMING; FORMAL LOGIC; SEMANTICS; SET THEORY;

PROGRAM COMPILERS;

EID: 70450233543     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1599410.1599447     Document Type: Conference Paper

References (14)

1. A. J. Ahmed. Step-indexed syntactic logical relations for recursive and quantified types. In Peter Sestoft, editor, ESOP, volume 3924 of LNCS, pages 69-83. Springer, 2006.
2. A. J. Ahmed, A. W. Appel, and R. Virga. A stratified semantics of general references. In 17th IEEE Symposium on Logic in Computer Science (LICS 2002), Proceedings. IEEE Computer Society, 2002.
3. N. Benton, A. Kennedy, L. Beringer, and M. Hofmann. Reading, writing, and relations: Towards extensional semantics for effect analyses. In 4th Asian Symposium on Programming Languages and Systems (APLAS), LNCS, 2006.
4. N. Benton, A. Kennedy, L. Beringer, and M. Hofmann. Relational semantics for effect-based program transformations with dynamic allocation. In Proc. PPDP 2007, ACM, 2007.
5. L. Birkedal, K. Stovring, and J. Thamsborg. Relational parametricity for references and recursive types. In Types in Language Design and Implementation (TLDI), 2009.
6. N. Bohr and L. Birkedal. Relational reasoning for recursive types and references. In Naoki Kobayashi, editor, Programming Languages and Systems, 4th Asian Symposium, APLAS 2006, Proceedings, volume 4279 of LNCS, pages 79-96. Springer, 2006.
7. H. Cai, Z. Shao, and A. Vaynberg. Certified self-modifying code. In PLDI '07: Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation, pages 66-77, New York, NY, USA, 2007. ACM.
8. M. Hofmann. Correctness of effect-based program transformations. In Orna Grumberg and Tobias Nipkow, editors, Formal Logical Methods for System Security and Correctness, pages 149-173. IOS Press, 2008.
9. V. Koutavas and M. Wand. Small bisimulations for reasoning about higher-order imperative programs. In POPL, pages 141-152, 2006.
10. A. M. Pitts. Relational properties of domains. Information and Computation, 127(2), 1996.
11. B. Reus and J. Schwinghammer. Denotational semantics for Abadi and Leino's logic of objects. In Shmuel Sagiv, editor, Programming Languages and Systems, 14th European Symposium on Programming, ESOP 2005, Proceedings, volume 3444 of LNCS, pages 263-278. Springer, 2005.
12. J. C. Reynolds. On the relation between direct and continuation semantics. In Proceedings of the 2nd Colloquium on Automata, Languages and Programming. Springer-Verlag, 1974.
13. D. Sangiorgi, N. Kobayashi, and E. Sumii. Environmental bisimulations for higher-order languages. In 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), Proceedings, pages 293-302. IEEE Computer Society, 2007.
14. E. Sumii and B. C. Pierce. A bisimulation for type abstraction and recursion. In POPL '05: Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM Press, 2005.