| | |
Summary: A Theory of Type Quali ers
Je rey S. Foster
jfoster@cs.berkeley.edu
Manuel Fahndrich
maf@microsoft.com
EECS Department
University of California, Berkeley
Berkeley, CA 94720-1776
Alexander Aiken
aiken@cs.berkeley.edu
Abstract
We describe a framework for adding type quali ers to a lan-
guage. Type quali ers encode a simple but highly useful
form of subtyping. Our framework extends standard type
rules to model the
ow of quali ers through a program,
where each quali er or set of quali ers comes with addi-
tional rules that capture its semantics. Our framework al-
lows types to be polymorphic in the type quali ers. We
present a const-inference system for C as an example appli-
cation of the framework. We show that for a set of real C
|
