Compiling a Functional Language (1984) [55 citations — 0 self]
http://research.microsoft.com/Users/luca/Papers/Co
http://lucacardelli.name/Papers/CompilingML.A4.pdf
DBLP
CACHED:
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Luca Cardelli},
title = {Compiling a Functional Language},
booktitle = {In Conference Record of the 1984 ACM Symposium on Lisp and Functional Programming},
year = {1984},
pages = {208--217},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
Machine The Functional Abstract Machine (Fam) is a stack machine designed to support functional languages on large address space computers. It can be considered an SECD machine [Landin 64] which has been optimized to allow very fast function application and the use of true stacks (as opposed to linked lists). This section contains a brief overview of the Fam; which is fully described in [Cardelli 83]. The machine supports functional objects (closures, which are dynamically allocated and garbage collected). All the optimization and support techniques which make application slower are strictly avoided, while tail recursion and pattern-matching calls are supported. Restricted side effects and arrays are provided. The machine is intended to make compilation from ML and other functional languages easy and regular, by providing a rich set of operations and an open-ended collection of data types. The instructions of the machine are not supposed to be interpreted, but assembled into machine...
Citations
No citations identified.
