Types in Compilation: third International Workshop, TIC 2000 Montreal, Canada, September 21, 2000 Revised Selected Papers

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

The importance of typed languages for building robust software systems is, by now, an undisputed fact. Years of research have led to languages with richly expressive, yet easy to use, type systems for high-level programming languages. Types provide not only a conceptual framework for language designers, but also a ord positive bene ts to the programmer, principally the ability to express and enforce levels of abstraction within a program. Early compilers for typed languages followed closely the methods used for their untyped counterparts. The role of types was limited to the earliest s- ges of compilation, and they were thereafter ignored during the remainder of the translation process. More recently, however, implementors have come to - cognize the importance of types during compilation and even for object code. Several advantages of types in compilation have been noted to date: { They support self-checking by the compiler. By tracking types during c- pilation it is possible for an internal type checker to detect translation errors at an early stage, greatly facilitating compiler development. { They support certi cation of object code. By extending types to the ge- rated object code, it becomes possible for a code user to ensure the basic integrity of that code by checking its type consistency before execution. { They support optimized data representations and calling conventions, even in the presence of modularity. By passing types at compile-, link-, and even run-time, it is possible to avoid compromises of data representation imposed by untyped compilation techniques.

Author(s): Karl Crary (auth.), Robert Harper (eds.)
Series: Lecture Notes in Computer Science 2071
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2001

Language: English
Pages: 214
Tags: Programming Languages, Compilers, Interpreters; Logics and Meanings of Programs; Mathematical Logic and Formal Languages

Sound and Complete Elimination of Singleton Kinds....Pages 1-25
Program Representation Size in an Intermediate Language with Intersection and Union Types....Pages 27-52
An Abstract Model of Java Dynamic Linking and Loading....Pages 53-84
Sharing in Typed Module Assembly Language....Pages 85-116
Scalable Certification for Typed Assembly Language....Pages 117-145
Safe and Flexible Dynamic Linking of Native Code....Pages 147-176
Alias Types for Recursive Data Structures....Pages 177-206