| 000 | 02580nam a22003858i 4500 | ||
|---|---|---|---|
| 001 | CR9780511983504 | ||
| 003 | UkCbUP | ||
| 005 | 20200124160237.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr|||||||||||| | ||
| 008 | 101124s1998||||enk o ||1 0|eng|d | ||
| 020 | _a9780511983504 (ebook) | ||
| 020 | _z9780521622776 (hardback) | ||
| 020 | _z9780521062923 (paperback) | ||
| 040 |
_aUkCbUP _beng _erda _cUkCbUP |
||
| 050 | 0 | 0 |
_aQA9.5 _b.A43 1998 |
| 082 | 0 | 0 |
_a511.3 _221 |
| 100 | 1 |
_aAmadio, Roberto M., _eauthor. |
|
| 245 | 1 | 0 |
_aDomains and lambda-calculi / _cRoberto M. Amadio, Pierre-Louis Curien. |
| 246 | 3 | _aDomains & Lambda-Calculi | |
| 264 | 1 |
_aCambridge : _bCambridge University Press, _c1998. |
|
| 300 |
_a1 online resource (xvi, 484 pages) : _bdigital, PDF file(s). |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 490 | 1 |
_aCambridge tracts in theoretical computer science ; _v46 |
|
| 500 | _aTitle from publisher's bibliographic system (viewed on 05 Oct 2015). | ||
| 520 | _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. | ||
| 650 | 0 | _aLambda calculus. | |
| 650 | 0 |
_aProgramming languages (Electronic computers) _xSemantics. |
|
| 700 | 1 |
_aCurien, P.-L. _q(Pierre-Louis), _eauthor. |
|
| 776 | 0 | 8 |
_iPrint version: _z9780521622776 |
| 830 | 0 |
_aCambridge tracts in theoretical computer science ; _v46. |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1017/CBO9780511983504 |
| 999 |
_c518194 _d518192 |
||