A step-indexed model of substructural state

ACM SIGPLAN Notices

Volumn 40, Issue 9, 2005, Pages 78-91

  Ahmed, Amal ^a   Fluet, Matthew ^b   Morrisett, Greg ^a  

^a HARVARD UNIVERSITY   (United States)

^b Department of Molecular Biology and Genetics   (United States)

Author keywords

Mutable references; Step indexed model; Substructural type system

Indexed keywords

MUTABLE REFERENCES; OPERATIONAL SEMANTICS; STEP-INDEXED MODELS; SUBSTRUCTURAL TYPE SYSTEMS;

DATABASE SYSTEMS; MATHEMATICAL MODELS; SEMANTICS; STORAGE ALLOCATION (COMPUTER); STRUCTURED PROGRAMMING;

COMPUTER PROGRAMMING LANGUAGES;

EID: 33745223513     PISSN: 03621340     EISSN: 03621340     Source Type: Journal    
DOI: 10.1145/1090189.1086376     Document Type: Article

References (33)

1. Amal Ahmed, Andrew W. Appel, and Roberto Virga. An indexed model of impredicative polymorphism and mutable references. Available at http://www.cs.princeton.edu/~appel/papers/ impred.pdf, January 2003.
2. Amal Ahmed, Matthew Fluet, and Greg Morrisett. L3: A linear language with locations. Technical Report TR-24-04, Harvard University, October 2004.
3. Amal Ahmed, Matthew Fluet, and Greg Morrisett. A step-indexed model of substructural state. Technical Report TR-16-05, Harvard University, July 2005.
4. Amal Jamil Ahmed. Semantics of Types for Mutable State. PhD thesis, Princeton University, 2004.
5. Alex Aiken, Jeffrey S. Foster, John Kodumal, and Tachio Terauchi. Checking and inferring local non-aliasing. In Proc. Programming Language Design and Implementation (PLDI), pages 129-140, June 2003.
6. Andrew W. Appel. Foundational proof-carrying code. In Proc. Logic in Computer Science (LICS), pages 247-258, June 2001.
7. Andrew W. Appel and David McAllester. An indexed model of recursive types for foundational proof-carrying code. ACM Transactions on Programming Languages and Systems, 23(5):657-683, September 2001.
8. David Aspinall and Adriana Compagnoni. Heap bounded assembly language. Journal of Automated Reasoning, 31:261-302, 2003.
9. David Aspinall and Martin Hofmann. Another type system for in-place update. In Proc. European Symposium on Programming (ESOP), pages 36-52, March 2002.
10. Henry Baker. Lively linear LISP-look ma, no garbage. ACM SIGPLAN Notices, 27(8):89-98, 1992.
11. John Tang Boyland and William Retert. Connecting effects and uniqueness with adoption. In Proc. Principles of Programming Languages (POPL), pages 283-295, January 2005.
12. James Cheney and Greg Morrisett. A linearly typed assembly language. Technical Report 2003-1900, Department, of Computer Science, Cornell University, 2003.
13. Robert DeLine and Manuel Fähndrich. Enforcing high-level protocols in low-level software. In Proc. Programming Language Design and Implementation (PLDI), pages 59-69, June 2001.
14. Manuel Fähndrich and Robert DeLine. Adoption and focus: Practical linear types for imperative programming. In Proc. Programming Language Design and Implementation (PLDI), pages 13-24, June 2002.
15. Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1-102, 1987.
16. Jǒrgen Gustavsson and Josef Svenningsson. A usage analysis with bounded usage polymorphism and subtyping. In Proc. International Workshop on Implementation of Functional Languages (IFL), pages 140-157, September 2001.
17. Michael Hicks, Greg Morrisett, Dan Grossman, and Trevor Jim. Experience with safe manual memory-management in Cyclone. In Proc. International Symposium on Memory Management (ISMM), pages 73-84, October 2004.
18. Martin Hofmann. A type system for bounded space and functional in-place update. In Proc. European Symposium on Programming (ESOP), pages 165-179, March 2000.
19. Atsushi Igarashi and Naoki Kobayashi. Resource usage analysis. In Proc. ACM Principles of Programming Languages (POPL), pages 331-342, January 2002.
20. Samin Ishtiaq and Peter O'Hearn. BI as an assertion language for mutable data structures. In Proc. Principles of Programming Languages (POPL), pages 14-26, January 2001.
21. Naoki Kobayashi. Quasi-linear types. In Proc. Principles of Programming Languages (POPL), pages 29-42, January 1999.
22. Torben M. Mogensen. Types for 0, 1 or many uses. In Proc. International Workshop on Implementation of Functional Languages (IFL), pages 112-122, 1998.
23. Greg Morrisett, Amal Ahmed, and Matthew Fluet. L3: A linear language with locations. In Proc. International Conference on Typed Lambda Calculi and Applications (TLCA), pages 293-307, April 2005.
24. Peter W. O'Hearn and John C. Reynolds. From Algol to polymorphic linear lambda-calculus. Journal of the ACM, 47(1): 167-223, 2000.
25. John C. Reynolds. Separation Logic: A Logic for Shared Mutable Data Structures. In Proc. Logic in Computer Science (LICS), pages 55-74, July 2002.
26. Sjaak Smetsers, Erik Barendsen, Marko C. J. D. van Eekelen, and Rinus J. Plasmeijer. Guaranteeing safe destructive updates through a type system with uniqueness information for graphs. In Dagstuhl Seminar on Graph Transformations in Computer Science, volume 776 of Lecture Notes in Computer Science, pages 358-379. Springer-Verlag, 1994.
27. Fred Smith, David Walker, and Greg Morrisett. Alias types. In Proc. European Symposium, on Programming (ESOP), pages 366-381, March 2000.
28. David N. Turner, Philip Wadler, and Christian Mossin. Once upon a type. In Proc. Functional Programming Languages and Computer Architecture (FPCA), pages 1-11, June 1995.
29. Philip Wadler. Linear types can change the world! In Programming Concepts and Methods, April 1990. IFIP TC 2 Working Conference.
30. David Walker. Substructural type systems. In Benjamin Pierce, editor, Advanced Topics in Types and Programming Languages, chapter 1, pages 3-43. MIT Press, Cambridge, MA, 2005.
31. David Walker and Greg Morrisett. Alias types for recursive data structures. In Proc. Workshop on Types in Compilation (TIC), pages 177-206, September 2000.
32. David Walker and Kevin Watkins. On regions and linear types. In Proc. International Conference on Functional Programming (ICFP), pages 181-192, September 2001.
33. Keith Wansbrough and Simon Peyton-Jones. Once upon a polymorphic type. In Proc. Principles of Programming Languages (POPL), pages 15-28, January 1999.