A theory of type qualifiers

Jeffrey S. Foster, Manuel Fähndrich, Alexander Aiken
1999 Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation - PLDI '99  
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
more » ... We show that for a set of real C programs, many more consts can be used than are actually present in the original code. *
doi:10.1145/301618.301665 dblp:conf/pldi/FosterFA99 fatcat:py4n3h6q3ragxnzwtantcwltty