A Theory of Type Qualifiers Export

@inproceedings{citeulike:745423, abstract = {We describe a framework for adding type qualifiers to a language. Type qualifiers encode a simple but highly useful form of subtyping. Our framework extends standard type rules to model the flow of qualifiers through a program, where each qualifier or set of qualifiers comes with additional rules that capture its semantics. Our framework allows types to be polymorphic in the type qualifiers. We present a const-inference system for C as an example application of the framework. We show that for a ...}, author = {Foster, Jeffrey S. and Fahndrich, Manuel and Aiken, Alexander}, booktitle = {SIGPLAN Conference on Programming Language Design and Implementation}, citeulike-article-id = {745423}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.1456}, keywords = {qualifiers}, pages = {192--203}, posted-at = {2006-07-07 12:49:51}, priority = {2}, title = {A Theory of Type Qualifiers}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.1456}, year = {1999} }

TY - CONF ID - citeulike:745423 L3 - citeulike-article-id:745423 N2 - We describe a framework for adding type qualifiers to a language. Type qualifiers encode a simple but highly useful form of subtyping. Our framework extends standard type rules to model the flow of qualifiers through a program, where each qualifier or set of qualifiers comes with additional rules that capture its semantics. Our framework allows types to be polymorphic in the type qualifiers. We present a const-inference system for C as an example application of the framework. We show that for a ... EP - 203 TI - A Theory of Type Qualifiers T2 - SIGPLAN Conference on Programming Language Design and Implementation SP - 192 KW - qualifiers AU - Foster, Jeffrey AU - Fahndrich, Manuel AU - Aiken, Alexander PY - 1999/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.1456 ER -