Domains and Lambda-Calculi
Cambridge University Press (1998)
| Abstract | This 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 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. | |||||||||
| Keywords | Lambda calculus Programming languages (Electronic computers Semantics | |||||||||
| Categories | ||||||||||
| Buy the book | $73.71 new (28% off) $81.92 direct from Amazon (19% off) $100.42 used (1% off) Amazon page | |||||||||
| Call number | QA9.5.A43 1998 | |||||||||
| ISBN(s) | 0521062926 0521622778 9780521622776 | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,709 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesH. P. Barendregt (1984). The Lambda Calculus: Its Syntax and Semantics. Sole Distributors for the U.S.A. And Canada, Elsevier Science Pub. Co..
J. Roger Hindley (1986). Introduction to Combinators and [Lambda]-Calculus. Cambridge University Press.
Henk Barendregt (1997). The Impact of the Lambda Calculus in Logic and Computer Science. Bulletin of Symbolic Logic 3 (2):181-215.
György E. Révész (1988). Lambda-Calculus, Combinators, and Functional Programming. Cambridge University Press.
C. Böhm (ed.) (1975). [Lambda]-Calculus and Computer Science Theory: Proceedings of the Symposium Held in Rome, March 25-27, 1975. Springer-Verlag.
Chris Hankin (1994). Lambda Calculi: A Guide for the Perplexed. Oxford University Press.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads6 ( #145,761 of 549,671 )Recent downloads (6 months)1 ( #63,425 of 549,671 )How can I increase my downloads? |
My notes
Discussion
