Richard Statman
Template:Short description Script error: No such module "Unsubst". Script error: No such module "Template wrapper".Script error: No such module "Check for clobbered parameters".
Richard Statman (born September 6, 1946) is an American computer scientist whose principal research interest is the theory of computation, especially symbolic computation. His research involves lambda calculus, type theory, and combinatory algebra.
Career
In 1974, Statman received his Ph.D. from Stanford University for his Ph.D. dissertation, supervised by Georg Kreisel, entitled Structural Complexity of Proofs.[1] His achievements include the proof that the type inhabitation problem in simply typed lambda calculus is PSPACE-complete,[2] lower bounds on simply typed lambda calculus,[3] logical relations,[4] and intersection types.[5] He was a co-author of the book Lambda Calculus with Types.[6]
References
<templatestyles src="Reflist/styles.css" />
Script error: No such module "Check for unknown parameters".