A Syntactic Approach to Type Soundness

DMCA

A Syntactic Approach to Type Soundness (1992)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Andrew K. Wright , Matthias Felleisen

Venue:	INFORMATION AND COMPUTATION
Citations:	629 - 22 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}
}

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.

Keyphrases

type soundness syntactic approach type error hindley milner-style polymorphic type system attempted application polymorphic functional language subject reduction theorem specific language combinatory logic similar feature type soundness theorem language semantics standard ml new approach polymorphic exception type system type soundness static type system first type soundness proof

DMCA