Type Qualifiers as Composable Language Extensions
This paper reformulates type qualifiers as language extensions that can be automatically and reliably composed. Type qualifiers annotate type expressions to introduce new subtyping relations and are powerful enough to detect many kinds of errors. Type qualifiers, as illustrated in our ableC extensible language framework for C, can introduce rich forms of concrete syntax, can generate dynamic checks on data when static checks are infeasible or not appropriate, and inject code that affects the program's behavior, for example for conversions of data or logging.
ableC language extensions to C are implemented as attribute grammar fragments and provide an expressive mechanism for type qualifier implementations to check for additional errors, e.g. dereferences to pointers not qualified by a "nonnull" qualifier, and report custom error messages. Our approach distinguishes language extension users from developers and provides modular analyses to developers to ensure that when users select a set of extensions to use, they will automatically compose to form a working compiler.
this URL might only work when visiting from a http://www.sigplan.org/ URL.
Mon 23 OctDisplayed time zone: Tijuana, Baja California change
15:30 - 17:00
|Type Qualifiers as Composable Language Extensions
GPCE 2017DOI Authorizer link
|Accurate Reification of Complete Supertype Information for Dynamic Analysis on the JVM
Andrea Rosà University of Lugano, Switzerland, Eduardo Rosales University of Lugano, Switzerland, Walter Binder University of Lugano, SwitzerlandDOI Authorizer link
|Rewriting for Sound and Complete Union, Intersection and Negation Types
David J. Pearce Victoria University of Wellington, New ZealandDOI Authorizer link