Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Simple and Flexible Stack Types

Frances Perry, Chris Hawblitzel, and Juan Chen

Abstract

Typed intermediate languages and typed assembly languages for optimizing compilers require types to describe stack-allocated data. Previous type systems for stack data were either undecidable or did not treat arguments passed by reference. This paper presents a simple, sound, decidable type system expressive enough to support the Micro-CLI source language, including by-reference arguments. This type system safely expresses operations on aliased stack locations by using singleton pointers and a small subset of linear logic.

Details

Publication typeInproceedings
Published inInternational Workshop on Aliasing, Confinement and Ownership in object-oriented programming (IWACO 07)
Pages20
NumberMSR-TR-2007-51
InstitutionMicrosoft Research
> Publications > Simple and Flexible Stack Types