DEPARTMENT RESEARCH ACADEMICS PEOPLE NEWS
Rice Computer Science		SEARCH:
Rice University Department of Computer Science presents Stephanie Weirich Cornell Universty Programming with Types Abstract 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 sophisticvated 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. Monday, April 29, 2002 @ 4:00 in Duncan Hall 1064 Reception at 3:30 in Duncan Hall 3092 About Stephanie Weirich Stephanie Weirich received a B.A. degree in Computer Science, magna cum laude, from Rice University in 1996. From Cornell she received her M.S. degree in 2000, and expects her Ph.D. degree in May 2002. Her awards include an Intel Graduate Student Fellowship, an NSF Fellowship, a CRA-W Distributed Mentorship Project Award, and a Microsoft Technical Scholar award. Ms. Weirich's research interests include programming languages, type theory, dynamic type analysis, functional programming, metaprogramming, and language-based security. Copyright 2000 Rice University site problems: www@cs.rice.edu --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- ---