Stack-based Typed Assembly Language

DSpace/Manakin Repository

Stack-based Typed Assembly Language

Citable link to this page

 

 
Title: Stack-based Typed Assembly Language
Author: Walker, David; Glew, Neal; Crary, Karl; Morrisett, John Gregory

Note: Order does not necessarily reflect citation order of authors.

Citation: Morrisett, Greg, Karl Crary, Neal Glew, and David Walker. 2003. Stack-based typed assembly language. Journal of Functional Programming 13: 957-959.
Full Text & Related Files:
Abstract: In previous work, we presented a Typed Assembly Language (TAL). TAL is sufficiently expressive to serve as a target language for compilers of high-level languages such as ML. This work assumed such a compiler would perform a continuation-passing style transform and eliminate the control stack by heap-allocating activation records. However, most compilers are based on stack allocation. This paper presents STAL, an extension of TAL with stack constructs and stack types to support the stack allocation style. We show that STAL is sufficiently expressive to support languages such as Java, Pascal, and ML; constructs such as exceptions and displays; and optimizations such as tail call elimination and callee-saves registers. This paper also formalizes the typing connection between CPS-based compilation and stack-based compilation and illustrates how STAL can formally model calling conventions by specifying them as formal translations of source function types to STAL types.
Published Version: http://dx.doi.org/10.1017/S0956796802004446
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAA
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:3710253
Downloads of this work:

Show full Dublin Core record

This item appears in the following Collection(s)

 
 

Search DASH


Advanced Search
 
 

Submitters