01954 2200217 4500001002100000010002100021090001500042100004000057101001300097200007500110210004800185215002400233225005700257330117300314606004601487606001801533686003301551700003001584701003201614995009001646FRBNF375379040000000 a0521622778brel. 97366a7366 a19980610d m y0frey5003 b aengceng1 aDomains and lambda-calculibMONfRoberto, AmadiogPierre-Louis, Curien cCambridge University Pressd1998aCambridge a1 vol. (XVI-484 p.)1 aCambridge tracts in theoretical computer sciencev46 aThis 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 language-independent and a machine-independent 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 meta-languages for denotational semantics. This theory is 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. aLangages de programmationxMathématiques aLambda-calcul a004.16 Logique mathématique aAmadiobRoberto M.914889 aCurienbPierre-Louis914890 97705bENSBcENSBeINFORMATIQUEj00007603k004.16 AMAo0u004.16 Logique mathématique