The logical approach to stack typing
- 18 January 2003
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 38 (3) , 74-85
- https://doi.org/10.1145/604174.604185
Abstract
We develop a logic for reasoning about adjacency and separation of memory blocks, as well as aliasing of pointers. We provide a memory model for our logic and present a sound set of natural deduction-style inference rules. We deploy the logic in a simple type system for a stack-based assembly language. The connectives for the logic provide a flexible yet concise mechanism for controlling allocation, deallocation and access to both heap-allocated and stack-allocated data.Keywords
This publication has 24 references indexed in Scilit:
- On bunched typingJournal of Functional Programming, 2003
- Stack-based typed assembly languageJournal of Functional Programming, 2002
- A judgmental reconstruction of modal logicMathematical Structures in Computer Science, 2001
- Typed memory management via static capabilitiesACM Transactions on Programming Languages and Systems, 2000
- From Algol to polymorphic linear lambda-calculusJournal of the ACM, 2000
- From system F to typed assembly languageACM Transactions on Programming Languages and Systems, 1999
- Region-Based Memory ManagementInformation and Computation, 1997
- Reference counting as a computational interpretation of linear logicJournal of Functional Programming, 1996
- The linear abstract machineTheoretical Computer Science, 1988
- Linear logicTheoretical Computer Science, 1987