Proving memory management invariants for a language based on linear logic
- 1 January 1992
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Lisp Pointers
- Vol. V (1), 139-150
- https://doi.org/10.1145/141478.141527
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Operational aspects of linear lambda calculusPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Parameter-passing and the lambda calculusPublished by Association for Computing Machinery (ACM) ,1991
- On determining lifetime and aliasing of dynamically allocated data in higher-order functional specificationsPublished by Association for Computing Machinery (ACM) ,1990
- The linear abstract machineTheoretical Computer Science, 1988
- Linear logicTheoretical Computer Science, 1987
- A semantic model of reference counting and its abstraction (detailed summary)Published by Association for Computing Machinery (ACM) ,1986
- A flexible approach to interprocedural data flow analysis and programs with recursive data structuresPublished by Association for Computing Machinery (ACM) ,1982
- Garbage Collection of Linked Data StructuresACM Computing Surveys, 1981
- LCF considered as a programming languageTheoretical Computer Science, 1977
- Call-by-name, call-by-value and the λ-calculusTheoretical Computer Science, 1975