Semantics of an effect analysis for exceptions

Proceedings of the TLDI 2007: 2007 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation - Papers Presented at the Workshop

Volumn , Issue , 2007, Pages 15-26

  Benton, Nick ^a   Buchlovsky, Peter ^b  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Denotational semantics; Effect systems; Exceptions; Optimizing compilation; Partial equivalence relations; Program analysis; Types

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; POLYMORPHISM; PROGRAM COMPILERS;

DENOTATIONAL SEMANTICS; EFFECT SYSTEMS; OPTIMIZING COMPILATION; PARTIAL EQUIVALENCE RELATIONS; PROGRAM ANALYSIS;

SEMANTICS;

EID: 34548321715     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1190315.1190320     Document Type: Conference Paper

References (24)

1. M. Abadi, A. Banerjee, N. Heintze, and J. G. Riecke. A core calculus of dependency. In Proceedings of the 26th ACM Symposium on Principles of Programming Languages (POPL), 1999.
2. M. Abadi and G. D. Plotkin. A PER model of polymorphism and recursive types. In Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science (LICS). IEEE Computer Society Press, June 1990.
3. R. M. Amadio. Recursion over realizability structures. Information and Computation, 91(1), 1991.
4. 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.
5. 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.
6. N. Benton and A. Kennedy. Exceptional syntax. Journal of Functional Programming, 11(4), 2001.
7. N. Benton, A. Kennedy, M. Hofmann, and L. Beringer. Reading, writing and relations: Towards extensional semantics for effect analyses. In Proceedings of the Fourth Asian Symposium on Programming Languages and Systems (APLAS), volume 4279 of Lecture Notes in Computer Science, 2006.
8. F. Cardone. Relational semantics for recursive types and bounded quantification. In Proceedings of the 16th International Colloquium on Automata, Languages and Programming (ICALP), volume 372 of Lecture Notes in Computer Science. Springer, 1989.
9. F. Damiani and P. Giannini. Automatic useless-code detection and elimination for HOT functional programs. Journal, of Functional Programming, 10(6), 2000.
10. J. Gosling, B. Joy, and G. Steele. The Java(TM) Language Specification. Addison Wesley, 1996.
11. S. Hunt and D. Sands. Binding time analysis: A new PERspective. In Proceedings ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation (PEPM), June 1991.
12. F. Iwama, A. Igarashi, and N. Kobayashi. Resource usage analysis for a functional language with, exceptions. In Proceedings of the 2006 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation (PEPM), 2006.
13. A. J. Kennedy. Type inference and equational theories. Technical Report LIX/RR/96/09, École Polytechnique, 1996.
14. J. M. Lucassen and D. K. Gifford. Polymorphic effect systems. In Proceedings of the 15th Annual ACM Symposium on Principles of Programming Languages (POPL), 1988.
15. U. Martin and T. Nipkow. Boolean unification - the story so far. Journal of Symbolic Computation, 7(3/4), 1989.
16. E. Moggi. Notions of computation and monads. Information and Computation, 93(1), 1991.
17. F. Nielson, H. R. Nielson, and C. Hankin. Principles of Program Analysis. Springer-Verlag, 1999.
18. F. Pessaux and X. Leroy. Type-based analysis ofuncaught exceptions. In Proceedings of the 26th ACM Symposium on Principles of programming languages (POPL), 1999.
19. G. D. Plotkin. Lambda definability and logical relations. Technical report, Department of AI, University of Edinburgh, 1973.
20. J. C. Reynolds. The meaning of types - from intrinsic to extrinsic semantics. Technical Report BRICS RS-00-32, BRICS, University of Aarhus, December 2000.
21. A. Sabelfeld and D. Sands. A PER model of secure information flow in sequential programs. Higher-Order and Symbolic Computation, 14(1), March 2001.
22. J.-P. Talpin and P. Jouvelot. The type and effect discipline. Information and Computation, 111 (2), June 1994.
23. P. Wadler and P. Thiemann. The marriage of effects and monads. ACM Trans. Comput. Logic, 4(1), 2003.
24. K. Yi. Compile-time detection of uncaught exceptions in Standard ML programs. In Proceedings of the 1st International Static Analysis Symposium (SAS), volume 864 of Lecture Notes in Computer Science. Springer-Verlag, 1994.