Stack-based typed assembly language
Greg Morrisett, Karl Crary, Neal Glew et al. · Journal of Functional Programming · 2002
This paper presents STAL, a variant of Typed Assembly Language with constructs and types to support a limited form of stack allocation. As with other statically-typed low-level languages, the type system of STAL ensures that a wide class of errors cannot occur at run time, and therefore the language can be adapted for use in certifying compilers where security is a concern. Like the Java Virtual Machine Language (JVML), STAL supports stack allocation of local variables and procedure activation records, but unlike the JVML, STAL does not pre-suppose fixed notions of procedures, exceptions, or calling conventions. Rather, compiler writers can choose encodings for these high-level constructs using the more primitive RISC-like mechanisms of STAL. Consequently, some important optimizations that are impossible to perform within the JVML, such as tail call elimination or callee-saves registers, can be easily expressed within STAL.
Cited by 100 works. doi:10.1017/s0956796801004178 Open-access PDF
Authors
References
- The Java Language Specification
- The Mechanical Evaluation of Expressions
- Java Virtual Machine Specification
- The Definition of Standard ML
- Proof-carrying code
- Safe kernel extensions without run-time checking
- Rabbit: A Compiler for Scheme
- Compiling with Continuations
- The Definition of Standard ML (Revised)
- Orbit