 Richard Statman
Professor
Ph.D., Stanford University
Office: Wean Hall 7214
Phone: (412) 268-8475
E-mail: statman@cs.cmu.edu
Research
My principal research interests lie in the theory of computation with special emphasis on symbolic computation. In particular, my current research involves lambda calculus and combinatory algebra. This area underwent extensive development in the first half of this century, and then lay dormant until Dana Scott's fundamental work in the 1970's. Part of what has emerged from Scott's work is that lambda calculus forms the foundation of functional programming at both the semantic and syntactic levels. As a result, the area has been revived by an influx of theoretical problems directly related to design and implementation issues.
Selected Publications
The omega rule is sigma-zero-three hard (with Benedetto Intrigilia), LICS'04
On the lambda Y calculus, LICS '02
Church's lambda delta calculus, LPR '00
The word problem for combinators, RTA '00
Marginalia to a theorem of Jacopini, TLCA '99
Link
IEEE Symposium on Logic in Computer Science
|
