Title Details

Domains and Lambda Calculi Université de Provence, Marseille and PierreLouis Curien ENS, Paris Other titles in Cambridge Tracts in Theoretical Computer Science series DescriptionThis book describes the mathematical aspects of the semantics of programming languages. The main goals are to provide formal tools to assess the meaning of programming constructs in both a languageindependent and a machineindependent way, and to prove properties about programs, such as whether they terminate, or whether their result is a solution of the problem they are supposed to solve. In order to achieve this the authors first present, in an elementary and unified way, the theory of certain topological spaces that have proved of use in the modelling of various families of typed lambda calculi considered as core programming languages and as metalanguages for denotational semantics. This theory is now known as Domain Theory, and was founded as a subject by Scott and Plotkin. One of the main concerns is to establish links between mathematical structures and more syntactic approaches to semantics, often referred to as operational semantics, which is also described. This dual approach has the double advantage of motivating computer scientists to do some mathematics and of interesting mathematicians in unfamiliar application areas from computer science. Chapter Contents 
© Cambridge University Press 1998 Cambridge University Press, Edinburgh Building, Shaftesbury Road, Cambridge CB2 2RU 
© Cambridge University Press 1999 Cambridge University Press, Edinburgh Building, Shaftesbury Road, Cambridge CB2 2RU 