home · mobile · calendar · colloquia · 2001-2002 · 

Colloquium - Weirich

Programming with Types
Department of Computer Science, Cornell University

Run-time type analysis is an increasingly important linguistic mechanism in modern programming languages. In language runtime systems, it is used to implement services such as accurate garbage collection, serialization, cloning and structural equality. Component frameworks rely on it to provide reflection mechanisms in order to discover and interact with program interfaces at run-time. This ability is also crucial in the design of large, distributed systems that must be flexible and robust enough to support frequent updates of new code and of new forms of data.

However, existing language support for run-time type analysis was designed for simple type systems and does not scale well to the sophisticated type systems of modern and next-generation programming languages. These languages include complex type constructs such as first-class abstract types, recursive types, and objects, as well as a compile-time language to describe type parameterization. In this talk, I will show how the idea of interpreting that compile-time language at run time yields an expressive and elegant mechanism for describing type-directed operations.

Hosted by John Bennett.
Refreshments will be served afterwards.

Department of Computer Science
University of Colorado Boulder
Boulder, CO 80309-0430 USA
May 5, 2012 (14:13)