## A Syntactic Approach to Type Soundness (1992)

### Cached

### Download Links

- [www.cs.princeton.edu]
- [www.cs.rice.edu]
- [www.cs.rice.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | Information and Computation |

Citations: | 538 - 21 self |

### BibTeX

@ARTICLE{Wright92asyntactic,

author = {Andrew K. Wright and Matthias Felleisen},

title = {A Syntactic Approach to Type Soundness},

journal = {Information and Computation},

year = {1992},

volume = {115},

pages = {38--94}

}

### Years of Citing Articles

### OpenURL

### Abstract

We present a new approach to proving type soundness for Hindley/Milner-style polymorphic type systems. The keys to our approach are (1) an adaptation of subject reduction theorems from combinatory logic to programming languages, and (2) the use of rewriting techniques for the specification of the language semantics. The approach easily extends from polymorphic functional languages to imperative languages that provide references, exceptions, continuations, and similar features. We illustrate the technique with a type soundness theorem for the core of Standard ML, which includes the first type soundness proof for polymorphic exceptions and continuations. 1 Type Soundness Static type systems for programming languages attempt to prevent the occurrence of type errors during execution. A definition of type error depends on a specific language and type system, but always includes the use of a function on arguments for which it is not defined, and the attempted application of a non-function. ...