|
1991 – Robin Milner
Citation
For three distinct and complete achievements: 1) LCF, the mechanization of
Scott's Logic of Computable Functions, probably the first theoretically based yet practical tool
for machine assisted proof construction; 2) ML, the first language to include polymorphic type
inference together with a type-safe exception-handling mechanism; 3) CCS, a general theory of
concurrency. In addition, he formulated and strongly advanced full abstraction, the study of
the relationship between operational and denotational semantics.
[Home] [ACM Awards] [A. M. Turing Award]
|
