Syntactic type abstraction (2000) [38 citations — 1 self]
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@ARTICLE{Grossman00syntactictype,author = {Dan Grossman and Greg Morrisett and Steve Zdancewic},
title = {Syntactic type abstraction},
journal = {ACM TOPLAS},
year = {2000},
volume = {22},
pages = {2000}
}
Years of Citing Articles
Abstract:
Software developers often structure programs in such a way that dierent pieces of code constitute distinct principals. Types help dene the protocol by which these principals interact. In particular, abstract types allow a principal to make strong assumptions about how well-typed clients use the facilities that it provides. We show how the notions of principals and type abstraction can be formalized within a language. Dierent principals can know the implementation of dierent abstract types. We use additional syntax to track the ow of values with abstract types during the evaluation of a program and demonstrate how this framework supports syntactic proofs (in the style of subject reduction) for type-abstraction properties. Such properties have traditionally required semantic arguments; using syntax avoids the need to build a model for the language. We present various typed lambda calculi with principals, including versions that have mutable state and recursive types.
