Frame rules from answer types for code pointers

ACM SIGPLAN Notices

Volumn 41, Issue 1, 2006, Pages 309-319

  Thielecke, Hayo ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Code pointers; Continuations; Hoare logic; Polymorphism; Typed assembly language

Indexed keywords

ASSEMBLY; CODES (SYMBOLS); COMPUTER PROGRAMMING LANGUAGES; FORMAL LOGIC;

CODE POINTERS; CONTINUATIONS; HOARE LOGIC; POLYMORPHISM; TYPED ASSEMBLY LANGUAGE;

LOGIC PROGRAMMING;

EID: 33745203288     PISSN: 03621340     EISSN: 03621340     Source Type: Journal    
DOI: 10.1145/1111320.1111065     Document Type: Article

References (32)

1. Andrew A. Appel and David McAllester. An indexed model for recursive types for foundational proof-carrying code. ACM Transactions on Programming Languages and Systems (TOPLAS), 23(5):657-683, 2001.
2. Andrew W. Appel and Amy P. Felty. A semantic model of types and machine instructions for proof-carrying code. In Proceedings 27th Principles of Programming Languages (POPL '00), pages 243-253. ACM, 2000.
3. Josh Berdine. Linear Typing of Continuation Passing Style. PhD thesis, Queen Mary, University of London, 2002.
4. Josh Berdine and Peter W. O'Hearn. Strong update, disposal and encapsulation in bunched typing. Draft, October 2005.
5. Josh Berdine, Peter W. O'Hearn, Uday Reddy, and Hayo Thielecke. Linear continuation passing. Higher-order and Symbolic Computation, 15(2/3):181-208, 2002.
6. Richard Bornat, Cristiano Calcagno, Peter W. O'Hearn, and Matthew J. Parkinson. Permission accounting in separation logic. In Principles of Programming Languages (POPL '05), pages 259-270. ACM, 2005.
7. Matthias Felleisen and Daniel P. Friedman. Control operators, the SECD-machine, and the λ-calculus. In Martin Wirsing, editor, Formal Description of Programming Concepts, pages 193-217. North-Holland, 1986.
8. Timothy G. Griffin. A formulae-as-types notion of control. In Principles of Programming Languages (POPL '90), pages 47-58. ACM, 1990.
9. Samin S. Ishtiaq and Peter O'Hearn. BI as an assertion language for mutable data structures. In Principles of Programming Languages (POPL '01), pages 14-26. ACM, 2001.
10. Pierre Jouvelot and David K. Gifford. Reasoning about continuations with control effects. In Programming Language Design and Implementation (PLDI), pages 218-226. ACM, 1988.
11. Jean-Louis Krivine. Typed lambda-calculus in classical Zermelo-Fraenkel set theory. Archive of Mathematical Logic, 40(3):189-205, 2001.
12. Jean-Louis Krivine. Dependent choice, 'quote' and the clock. Theoretical Computer Science, 308(1-3):259-276, 2003.
13. Sam Lindley and Ian Stark. Reducibility and TT-lifting for computation types. In Typed lambda calculus and applications (TLCA), number 3461 in LNCS, pages 262-277. Springer, 2005.
14. John M. Lucassen and David K. Gifford. Polymorphic effect systems. In Principles of Programming Languages (POPL '88), pages 47-57. ACM, 1988.
15. Paul-André Melliés and Jérôme Vouillon. Recursive polymorphic types and parametricity in an operational framework. In Logic and Computer Science (LICS'05). IEEE, 2005.
16. Greg Morrisett, David Walker, Karl Crary, and Neal Glew. From system F to typed assembly language. In Principles of Programming Languages (POPL '98), pages 85-97. ACM, 1998.
17. Gregory Morrisett, Amal J. Ahmed, and Matthew Fluet. L3: A linear language with locations. In Typed Lambda Calculus and Applications (TLCA), volume 3461, pages 293-307. Springer, 2005.
18. Gregory Morrisett, F. Smith, and D. Walker. Alias types. In Proceedings European Symposium on Programming (ESOP), volume 1782 of LNCS, pages 366-381. Springer, 2000.
19. George C. Necula. Proof-carrying code, In Principles of Programming Languages (POPL '97), pages 106-119. ACM, 1997.
20. Zhaozhong Ni and Zhong Shao. Certified assembly programming with embedded code pointers. In Proc. 33rd ACM Symposium on Principles of Programming Languages (POPL'06). ACM, January 2006. (to appear).
21. Peter W. O'Hearn. On bunched typing. Journal of Functional Programming, 13(4):747-796, 2003.
22. Peter W. O'Hearn, Hongseok Yang, and John C. Reynolds. Separation and information hiding. In Principles of Programming Languages (POPL'04), pages 268-280, 2004.
23. Andrew M. Pitts. Parametric polymorphism and operational equivalence. Mathematical Structures in Computer Science, 10:321-359, 2000.
24. David J. Pym. The Semantics and Proof Theory of the Logic of Bunched Implications. Kluwer Academic Publishers, 2002.
25. David J. Pym, Peter W. O'Hearn, and Hongseok Yang. Possible worlds and resources: the semantics of BI. Theoretical Computer Science, 315(1):257-305, 2004.
26. John C. Reynolds. Types, abstraction and parametric polymorphism. In R. E. A. Mason, editor, Information Processing 83, pages 513-523, Amsterdam, 1983. Elsevier Science Publishers B. V. (North-Holland).
27. John C. Reynolds. Separation logic: A logic for shared mutable data structures. In Logic in Computer Science (LICS), pages 55-74. IEEE, 2002.
28. Hayo Thielecke. Comparing control constructs by double-barrelled CPS. Higher-order and Symbolic Computation, 15(2/3):141-160, 2002.
29. Hayo Thielecke. From control effects to typed continuation passing. In 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'03), pages 139-149. ACM, 2003.
30. Hayo Thielecke. Answer type polymorphism in call-by-name continuation passing. In European Symposium, on Programming (ESOP 2004), volume 2986 of LNCS, pages 279-293. Springer, 2004.
31. Jérôme Vouillon and Paul-André Melliés. Semantic types: a fresh look at the ideal model for types. In Principles of Programming Languages (POPL'04), pages 52-63, 2004.
32. Philip Wadler. Theorems for free! In 4'th International Conference on Functional Programming and Computer Architecture (FPCA'89), pages 347-359. ACM, 1989.