Reading, writing and relations towards extensional semantics for effect analyses

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4279 LNCS, Issue , 2006, Pages 114-130

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

^a MICROSOFT RESEARCH   (United Kingdom)

^b UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; MATHEMATICAL TRANSFORMATIONS;

EFFECT ANALYSES; EXTENSIONAL SEMANTICS; ORIGINAL LANGUAGE; PROGRAM TRANSFORMATIONS; READING;

SEMANTICS;

EID: 33845951705     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11924661_7     Document Type: Conference Paper

References (21)

1. M. Abadi, A. Banerjee, N. Heintze, and J. G. Riecke. A core calculus of dependency. In 26th Symposium on Principles of Programming Languages (POPL), 1999.
2. A. Banerjee, N. Heintze, and J. Riecke. Region analysis and the polymorphic lambda calculus. In Proceedings of the 14th IEEE Symposium on Logic in Computer Science (LICS), 1999.
3. N. Benton. Simple relational correctness proofs for static analyses and program transformations. In Proceedings of the 31st ACM Symposium on Principles of Programming Languages (POPL), January 2004. Revised version available from http://research.microsoft.com/~nick/publications.htm.
4. N. Benton. Semantics of program analyses and transformations. Lecture Notes for the PAT Summer School, Copenhagen, June 2005.
5. N. Benton, J. Hughes, and E. Moggi. Monads and effects. In G. Barthe, P. Dybjer, L. Pinto, and J. Saraiva, editors, Applied Semantics, Advanced Lectures, volume 2395 of Lecture Notes in Computer Science. Springer-Verlag, 2002.
6. N. Benton and A. Kennedy. Monads, effects and transformations. In 3rd International Workshop on Higher Order Operational Techniques in Semantics (HOOTS), Paris, volume 26 of Electronic Notes in Theoretical Computer Science. Elsevier, September 1999.
7. N. Benton and B. Leperchey. Relational reasoning in a nominal semantics for storage. In Proc. 7th International Conference on Typed Lambda Calculi and Applications (TLCA), volume 3461 of Lecture Notes in Computer Science, 2005.
8. D. K. Gifford and J. M. Lucassen. Integrating functional and imperative programming. In ACM Conference on LISP and Functional Programming, Cambridge, Massachusetts, August 1986.
9. S. Helsen. Bisimilarity for the region calculus. Higher-Order and Symbolic Computation, 17(4), 2004.
10. S. Peyton Jones and J. Launchbury. State in Haskell. Lisp and Symbolic Computation, 8(4), 1995.
11. J. M. Lucassen and D. K. Gifford. Polymorphic effect systems. In Conference Record of the 15th Annual ACM Symposium on Principles of Programming Languages (POPL), 1988.
12. E. Moggi and A. Sabry. Monadic encapsulation of effects: A revised approach (extended version). Journal of Functional Programming, 11(6), 2001.
13. D. Naumann. Observational purity and encapsulation. Theoretical Computer Science, To appear.
14. A. M. Pitts and I. D. B. Stark. Operational reasoning for functions with local state. In Higher Order Operational Techniques in Semantics. CUP, 1998.
15. G. D. Plotkin and J. Power. Notions of computation determine monads. In Foundations of Software Science and Computation Structures, Proceedings of FOBS ACS '02, volume 2303 of Lecture Notes in Computer Science. Springer-Verlag, 2002.
16. U. S. Reddy and H. Yang. Correctness of data representations involving heap data structures. Science of Computer Programming, 50(1-3):129-160, March 2004.
17. J. C. Reynolds. The meaning of types - from intrinsic to extrinsic semantics. Technical Report BRIGS RS-00-32, BRIGS, University of Aarhus, December 2000.
18. A. Sabelfeld and D. Sands. A PER model of secure information flow in sequential programs. Higher-Order and Symbolic Computation, 14(1):59-91, March 2001.
19. M. Tofte and J.-P. Talpin. Region-based memory management. Information and Computation, 132(2):109-176, 1997.
20. A. Tolmach. Optimizing ML using a hierarchy of monadic types. In Proceedings of the Workshop on Types in Compilation (TIC), volume 1473 of Lecture Notes in Computer Science. Springer-Verlag, 1998.
21. P. Wadler and P. Thiemann. The marriage of effects and monads. ACM Trans. Comput. Logic, 4(1):1-32, 2003.