 |
Rice University
Department of Computer Science
presents
Bill Harrison
OGI School
of Science and
Engineering
Slaying the 'Dragon': Prospects for Modular Compiler Construction
Abstract
Compiler complexity is a problem as old as Computer Science itself.
Traditional compilers are large, very complicated
programs which take a long time to write and are just as difficult to
maintain. Given the amount of work that goes
into the creation of compilers, it is clearly desirable to reuse as much of
this effort as is possible. But, the monolithic structure of
traditional compilers makes it quite difficult (or worse!) to modify them,
to reuse parts of them in new compilers, and to prove them correct.
In this talk, I will present an overview of a new compiler construction
technique, Modular Compilation, which attempts to `slay the dragon' of
compiler complexity.
Tuesday, Dec. 10 at 10am in DH 1049
About Bill Harrison
Bill Harrison is a Senior Research Associate with the Pacific Software Research
Laboratory (PacSoft) in the Computer Science department of the OGI School
of Science and
Engineering. He undertook his doctoral research at the University of
Illinois at Urbana-
Champaign. His disseration, "Modular Compilers and Their Correctness
Proofs", explores the
application of a powerful abstraction from denotational semantics called
"monads" to compiler
design and their benefits with respect to compiler modularity, reusability,
and correctness.
Before joining PacSoft, he spent a year as Visiting Lecturer in the
Computer Science Department
at Indiana University.
--- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- |
|
| |