Domains and lambda-calculi:
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 the...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
1998
|
| Schriftenreihe: | Cambridge tracts in theoretical computer science
46 |
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 URL des Erstveröffentlichers |
| Zusammenfassung: | 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 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 |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
| Beschreibung: | 1 online resource (xvi, 484 pages) |
| ISBN: | 9780511983504 |
| DOI: | 10.1017/CBO9780511983504 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV043942008 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s1998 |||| o||u| ||||||eng d | ||
| 020 | |a 9780511983504 |c Online |9 978-0-511-98350-4 | ||
| 024 | 7 | |a 10.1017/CBO9780511983504 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9780511983504 | ||
| 035 | |a (OCoLC)967776132 | ||
| 035 | |a (DE-599)BVBBV043942008 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 | ||
| 082 | 0 | |a 511.3 |2 21 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 140 |0 (DE-625)143592: |2 rvk | ||
| 100 | 1 | |a Amadio, Roberto M. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Domains and lambda-calculi |c Roberto M. Amadio, Pierre-Louis Curien |
| 246 | 1 | 3 | |a Domains & Lambda-Calculi |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 1998 | |
| 300 | |a 1 online resource (xvi, 484 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Cambridge tracts in theoretical computer science |v 46 | |
| 500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
| 520 | |a 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 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 | 4 | |a Lambda calculus | |
| 650 | 4 | |a Programming languages (Electronic computers) / Semantics | |
| 650 | 0 | 7 | |a Attributwertebereich |0 (DE-588)4281335-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Lambda-Kalkül |0 (DE-588)4166495-4 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Lambda-Kalkül |0 (DE-588)4166495-4 |D s |
| 689 | 0 | 1 | |a Attributwertebereich |0 (DE-588)4281335-9 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Curien, P.-L. |e Sonstige |4 oth | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-06292-3 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-62277-6 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9780511983504 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029350978 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511983504 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511983504 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804176884389380096 |
|---|---|
| any_adam_object | |
| author | Amadio, Roberto M. |
| author_facet | Amadio, Roberto M. |
| author_role | aut |
| author_sort | Amadio, Roberto M. |
| author_variant | r m a rm rma |
| building | Verbundindex |
| bvnumber | BV043942008 |
| classification_rvk | ST 130 ST 140 |
| collection | ZDB-20-CBO |
| ctrlnum | (ZDB-20-CBO)CR9780511983504 (OCoLC)967776132 (DE-599)BVBBV043942008 |
| dewey-full | 511.3 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3 |
| dewey-search | 511.3 |
| dewey-sort | 3511.3 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| doi_str_mv | 10.1017/CBO9780511983504 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03357nmm a2200541zcb4500</leader><controlfield tag="001">BV043942008</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s1998 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511983504</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-511-98350-4</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9780511983504</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9780511983504</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)967776132</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043942008</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 140</subfield><subfield code="0">(DE-625)143592:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Amadio, Roberto M.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Domains and lambda-calculi</subfield><subfield code="c">Roberto M. Amadio, Pierre-Louis Curien</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Domains & Lambda-Calculi</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">1998</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xvi, 484 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Cambridge tracts in theoretical computer science</subfield><subfield code="v">46</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 05 Oct 2015)</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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 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</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Lambda calculus</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programming languages (Electronic computers) / Semantics</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Attributwertebereich</subfield><subfield code="0">(DE-588)4281335-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Lambda-Kalkül</subfield><subfield code="0">(DE-588)4166495-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Lambda-Kalkül</subfield><subfield code="0">(DE-588)4166495-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Attributwertebereich</subfield><subfield code="0">(DE-588)4281335-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Curien, P.-L.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-06292-3</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-62277-6</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9780511983504</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029350978</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511983504</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511983504</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043942008 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:39:16Z |
| institution | BVB |
| isbn | 9780511983504 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029350978 |
| oclc_num | 967776132 |
| open_access_boolean | |
| owner | DE-12 DE-92 |
| owner_facet | DE-12 DE-92 |
| physical | 1 online resource (xvi, 484 pages) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| publishDate | 1998 |
| publishDateSearch | 1998 |
| publishDateSort | 1998 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Cambridge tracts in theoretical computer science |
| spelling | Amadio, Roberto M. Verfasser aut Domains and lambda-calculi Roberto M. Amadio, Pierre-Louis Curien Domains & Lambda-Calculi Cambridge Cambridge University Press 1998 1 online resource (xvi, 484 pages) txt rdacontent c rdamedia cr rdacarrier Cambridge tracts in theoretical computer science 46 Title from publisher's bibliographic system (viewed on 05 Oct 2015) 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 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 Lambda calculus Programming languages (Electronic computers) / Semantics Attributwertebereich (DE-588)4281335-9 gnd rswk-swf Lambda-Kalkül (DE-588)4166495-4 gnd rswk-swf Lambda-Kalkül (DE-588)4166495-4 s Attributwertebereich (DE-588)4281335-9 s 1\p DE-604 Curien, P.-L. Sonstige oth Erscheint auch als Druckausgabe 978-0-521-06292-3 Erscheint auch als Druckausgabe 978-0-521-62277-6 https://doi.org/10.1017/CBO9780511983504 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Amadio, Roberto M. Domains and lambda-calculi Lambda calculus Programming languages (Electronic computers) / Semantics Attributwertebereich (DE-588)4281335-9 gnd Lambda-Kalkül (DE-588)4166495-4 gnd |
| subject_GND | (DE-588)4281335-9 (DE-588)4166495-4 |
| title | Domains and lambda-calculi |
| title_alt | Domains & Lambda-Calculi |
| title_auth | Domains and lambda-calculi |
| title_exact_search | Domains and lambda-calculi |
| title_full | Domains and lambda-calculi Roberto M. Amadio, Pierre-Louis Curien |
| title_fullStr | Domains and lambda-calculi Roberto M. Amadio, Pierre-Louis Curien |
| title_full_unstemmed | Domains and lambda-calculi Roberto M. Amadio, Pierre-Louis Curien |
| title_short | Domains and lambda-calculi |
| title_sort | domains and lambda calculi |
| topic | Lambda calculus Programming languages (Electronic computers) / Semantics Attributwertebereich (DE-588)4281335-9 gnd Lambda-Kalkül (DE-588)4166495-4 gnd |
| topic_facet | Lambda calculus Programming languages (Electronic computers) / Semantics Attributwertebereich Lambda-Kalkül |
| url | https://doi.org/10.1017/CBO9780511983504 |
| work_keys_str_mv | AT amadiorobertom domainsandlambdacalculi AT curienpl domainsandlambdacalculi AT amadiorobertom domainslambdacalculi AT curienpl domainslambdacalculi |