@inproceedings{84e38a50ba4e499484a4136eef93172a,
title = "A type-based analysis for stack allocation in functional languages",
abstract = "We consider the problem of detecting when bindings for variables in a higher-order, call-by-value functional language can be allocated on a stack. We use an annotated type system to infer information about the occurrence and extent of variables in a simple higher-order functional language and combine this system with a translation to an annotated language which explicitly indicates when stack allocation can be performed. This technique supports both stack and heap allocation of variable bindings. Only the stack allocated bindings need follow the protocol for stacks: their extent must coincide with their scope. Heap allocated bindings can have any extent and their allocation has no impact on the stack allocated ones. The type system uses a simple notion of annotated types in which types encode not only the typical simple type information, but also information about the use of variables. We demonstrate the use of our analysis by defining both an operational semantics and an abstract machine which utilize both a stack and an environment for variable allocation.",
author = "Hannan, {John Joseph}",
year = "1995",
month = jan,
day = "1",
language = "English (US)",
isbn = "9783540603603",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "172--188",
editor = "Alan Mycroft",
booktitle = "Static Analysis - 2nd International Symposium, SAS 1995, Proceedings",
address = "Germany",
note = "2nd International Static Analysis Symposium, SAS 1995 ; Conference date: 25-09-1995 Through 27-09-1995",
}