Verfügbarkeit: The pi-calculus | Technische Universität München

The pi-calculus: a theory of mobile processes

Gespeichert in:

Bibliographische Detailangaben
Beteilige Person:	Sangiorgi, Davide (VerfasserIn)
Format:	Buch
Sprache:	Englisch
Veröffentlicht:	Cambridge u.a. Cambridge Univ. Pr. 2001
Ausgabe:	1. publ.
Schlagwörter:	Pi-Kalkül Lambda-Kalkül Mobilfunk Tragbarer Personal Computer
Links:	http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009553282&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
Umfang:	XII, 580 S.
ISBN:	0521781779 0521543274

Internformat

MARC


LEADER	00000nam a2200000 c 4500
001	BV013959764
003	DE-604
005	20170530
007	t\|
008	011016s2001 xx \|\|\|\| 00\|\|\| eng d
020			\|a 0521781779 \|9 0-521-78177-9
020			\|a 0521543274 \|9 0-521-54327-4
035			\|a (OCoLC)471713809
035			\|a (DE-599)BVBBV013959764
040			\|a DE-604 \|b ger \|e rakwb
041	0		\|a eng
049			\|a DE-384 \|a DE-19 \|a DE-91G \|a DE-473 \|a DE-11
084			\|a ST 130 \|0 (DE-625)143588: \|2 rvk
084			\|a DAT 545f \|2 stub
084			\|a DAT 555f \|2 stub
100	1		\|a Sangiorgi, Davide \|e Verfasser \|4 aut
245	1	0	\|a The pi-calculus \|b a theory of mobile processes \|c Davide Sangiorgi ; David Walker
250			\|a 1. publ.
264		1	\|a Cambridge u.a. \|b Cambridge Univ. Pr. \|c 2001
300			\|a XII, 580 S.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
650	0	7	\|a Pi-Kalkül \|0 (DE-588)4563344-7 \|2 gnd \|9 rswk-swf
650	0	7	\|a Lambda-Kalkül \|0 (DE-588)4166495-4 \|2 gnd \|9 rswk-swf
650	0	7	\|a Mobilfunk \|0 (DE-588)4170280-3 \|2 gnd \|9 rswk-swf
650	0	7	\|a Tragbarer Personal Computer \|0 (DE-588)4363314-6 \|2 gnd \|9 rswk-swf
689	0	0	\|a Tragbarer Personal Computer \|0 (DE-588)4363314-6 \|D s
689	0	1	\|a Mobilfunk \|0 (DE-588)4170280-3 \|D s
689	0	2	\|a Pi-Kalkül \|0 (DE-588)4563344-7 \|D s
689	0	3	\|a Lambda-Kalkül \|0 (DE-588)4166495-4 \|D s
689	0		\|8 1\p \|5 DE-604
700	1		\|a Walker, David \|e Sonstige \|4 oth
856	4	2	\|m Digitalisierung UB Bamberg - ADAM Catalogue Enrichment \|q application/pdf \|u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009553282&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
883	1		\|8 1\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
943	1		\|a oai:aleph.bib-bvb.de:BVB01-009553282

Datensatz im Suchindex

DE-BY-TUM_call_number	0102 DAT 555f 2001 A 30226
DE-BY-TUM_katkey	1277104
DE-BY-TUM_location	01
DE-BY-TUM_media_number	040020061036
_version_	1821932759073947650
adam_text	Contents Foreword ix Preface xi General Introduction 1 Part I: The 7r-calculus 5 Introduction to Part I 7 1 Processes.......................................................... 11 1.1 Syntax............................................................ 11 1.2 Reduction.......................................................... IT 1.3 Action........................................................ 36 1.4 Basic properties of the transition system......................... 44 2 Behavioural Equivalence........................................ 54 2.1 Strong barbed congruence........................................... 54 2.2 Strong bisimilarity............................................ 64 2.3 Up-to techniques................................................... 80 2.4 Barbed congruence — .............................................. 92 Notes and References for Part I 118 Part II: Variations of the 7r-calculus 121 Introduction to Part II 123 3 Polyadicity and Recursion..........................................127 3.1 Polyadicity........................................................127 3.2 Recursion......................................................... 132 IV Contents V 3.3 Priority-queue data structures................................... 138 3.4 Data as processes.............................................. 145 4 Behavioural Equivalence, continued.............................. 154 4.1 Distinctions ............................................... 154 4.2 Variants of bisimilarity........·.·.............................. 157 4.3 The late transition relations.................................. 158 4.4 Ground bisimilarity............................................ 162 4.5 Late bisimilarity.............................................. 164 4.6 Open bisimilarity............................................... 166 4.7 The weak equivalences.......................................... 172 4.8 Axiomatizations and proof systems..................................174 5 Subcalculi....................................................... 189 5.1 The Asynchronous 7r-calculus.................................. 189 5.2 Syntax of A7t................................................... 190 5.3 Behavioural equivalence in A7T..... —.......................... 194 5.4 Asynchronous equivalences .................................... 198 5.5 Expressiveness of asynchronous calculi...................... 203 5.6 The Localized 7r-calculus.........՛.,·.................—...........211 5.7 Internal mobility ....... —.................................... 215 5.8 Non-congruence results for ground bisimilarity................ 223 Notes and References for Part II 227 Part III: Typed 7r-calculi 231 Introduction to Part III 233 6 Foundations ................................................ 236 6.1 Terminology and notation for typed calculi....................... 236 6.2 Base-7r................................................... 238 6.3 Properties of typing........................................ 244 6.4 The simply-typed 7r-calculus.................................. 247 6.5 Products, unions, records, and variants............................249 6.6 Pattern matching in input..........................................255 6.7 Recursive types....................................................257 7 Subtyping...................................................... 260 7.1 i/o types..........................................................261 7.2 Properties of the type systems with i/o............................265 7.3 Other subtyping.................................................. .270 vi Contents 7.4 The priority queues, revisited..................................272 7.5 Encodings between union and product types.......................276 8 Advanced Type Systems...........................................281 8.1 Linearity.......................................................281 8.2 Receptiveness...................................................288 8.3 Polymorphism....................................................296 Notes and References for Part III 305 Part IV: Reasoning about Processes using Types 309 Introduction to Part IV 311 9 Groundwork......................................................313 9.1 Using types to obtain encapsulation.............................313 9.2 Why types for reasoning?........................................316 9.3 A security property.............................................317 9.4 Typed behavioural equivalences..................................319 9.5 Equivalences and preorders in simply-typed 7r-calculi...........328 10 Behavioural Effects of i/o Types................................329 10.1 Type coercion...................................................329 10.2 Examples...................................................... 330 10.3 Wires in the Asynchronous 7r-calculus...........................335 10.4 Delayed input...................................................336 10.5 Sharpened Replication Theorems..................................338 10.6 Proof techniques ...............................................340 10.7 Context Lemma................................................. 342 10.8 Adding internal mobility........................................348 11 Techniques for Advanced Type Systems............................351 11.1 Some properties of linearity................................... 351 11.2 Behavioural properties of receptiveness.........................352 11.3 A proof technique for polymorphic types.........................359 Notes and References for Part IV 365 Part V : The Higher-Order Paradigm 367 Introduction to Part V 369 12 Higher-Order 7r-calculus...................................... 373 12.1 Simply-typed HOir...............................................373 Contents vii 12.2 Other HOtt languages...............................................381 13 Comparing First-Order and Higher-Order Calculi.....................383 13.1 Compiling higher order into first order............................383 13.2 Optimizations......................................................397 13.3 Reversing the compilation......................................... 408 13.4 Full abstraction...................................................412 Notes and References for Part V 415 Part VI: Functions as Processes 419 Introduction to Part VI 421 14 The A-calculus.....................................................424 14.1 The formal system..................................................424 14.2 Contrasting A and n................................................426 14.3 Reduction strategies: call-by-name, call-by-value, call-by-need....429 15 Interpreting A-calculi ......................................... 434 15.1 Continuation Passing Style....................................... 434 15.2 Notations and terminology for functions as processes...............436 15.3 The interpretation of call-by-value................................438 15.4 The interpretation of call-by-name.................................452 15.5 A uniform encoding................................................ 461 15.6 Optimizations of the call-by-name encoding ........................464 15.7 The interpretation of strong call-by-name..........................465 16 Interpreting Typed A-calculi.......................................469 16.1 Typed A-calculus..................................................469 16.2 The interpretation of typed call-by-value..........................470 16.3 The interpretation of typed call-by-name...........................474 17 Full Abstraction...................................................477 17.1 The full-abstraction problem.......................................477 17.2 Applicative bisimilarity...........................................478 17.3 Soundness and non-completeness.....................................479 17.4 Extending the A-calculus...........................................483 18 The Local Structure of the Interpretations.........................492 18.1 Sensible theories and lazy theories................................492 18.2 Levy-Longo Trees...................................................493 18.3 The Local Structure Theorem for call-by-name.......................496 Contents viii 18.4 Böhm Trees.........................................................505 18.5 Local structure of the call-by-value interpretation................505 Notes and References for Part VI 507 Part VII: Objects and 7r-calculus 513 Introduction to Part VII 515 19 Semantic Definition................................................517 19.1 A programming language.............................................517 19.2 Modelling examples.................................................522 19.3 Formal definition..................................................528 20 Applications.......................................................533 20.1 Some properties of declarations and commands...................533 20.2 Proxies............................................................535 20.3 An implementation technique........................................539 20.4 A program transformation...........................................541 Notes and References for Part VII 546 List of Tables 548 List of Notations 550 Bibliography 562 Index 576
any_adam_object	1
author	Sangiorgi, Davide
author_facet	Sangiorgi, Davide
author_role	aut
author_sort	Sangiorgi, Davide
author_variant	d s ds
building	Verbundindex
bvnumber	BV013959764
classification_rvk	ST 130
classification_tum	DAT 545f DAT 555f
ctrlnum	(OCoLC)471713809 (DE-599)BVBBV013959764
discipline	Informatik
edition	1. publ.
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01861nam a2200457 c 4500</leader><controlfield tag="001">BV013959764</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20170530 </controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">011016s2001 xx \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521781779</subfield><subfield code="9">0-521-78177-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521543274</subfield><subfield code="9">0-521-54327-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)471713809</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV013959764</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-11</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">DAT 545f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 555f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sangiorgi, Davide</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The pi-calculus</subfield><subfield code="b">a theory of mobile processes</subfield><subfield code="c">Davide Sangiorgi ; David Walker</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. publ.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge u.a.</subfield><subfield code="b">Cambridge Univ. Pr.</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII, 580 S.</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Pi-Kalkül</subfield><subfield code="0">(DE-588)4563344-7</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="650" ind1="0" ind2="7"><subfield code="a">Mobilfunk</subfield><subfield code="0">(DE-588)4170280-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Tragbarer Personal Computer</subfield><subfield code="0">(DE-588)4363314-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Tragbarer Personal Computer</subfield><subfield code="0">(DE-588)4363314-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Mobilfunk</subfield><subfield code="0">(DE-588)4170280-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Pi-Kalkül</subfield><subfield code="0">(DE-588)4563344-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><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=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Walker, David</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Bamberg - ADAM Catalogue Enrichment</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009553282&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</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="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-009553282</subfield></datafield></record></collection>
id	DE-604.BV013959764
illustrated	Not Illustrated
indexdate	2024-12-20T10:56:36Z
institution	BVB
isbn	0521781779 0521543274
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-009553282
oclc_num	471713809
open_access_boolean
owner	DE-384 DE-19 DE-BY-UBM DE-91G DE-BY-TUM DE-473 DE-BY-UBG DE-11
owner_facet	DE-384 DE-19 DE-BY-UBM DE-91G DE-BY-TUM DE-473 DE-BY-UBG DE-11
physical	XII, 580 S.
publishDate	2001
publishDateSearch	2001
publishDateSort	2001
publisher	Cambridge Univ. Pr.
record_format	marc
spellingShingle	Sangiorgi, Davide The pi-calculus a theory of mobile processes Pi-Kalkül (DE-588)4563344-7 gnd Lambda-Kalkül (DE-588)4166495-4 gnd Mobilfunk (DE-588)4170280-3 gnd Tragbarer Personal Computer (DE-588)4363314-6 gnd
subject_GND	(DE-588)4563344-7 (DE-588)4166495-4 (DE-588)4170280-3 (DE-588)4363314-6
title	The pi-calculus a theory of mobile processes
title_auth	The pi-calculus a theory of mobile processes
title_exact_search	The pi-calculus a theory of mobile processes
title_full	The pi-calculus a theory of mobile processes Davide Sangiorgi ; David Walker
title_fullStr	The pi-calculus a theory of mobile processes Davide Sangiorgi ; David Walker
title_full_unstemmed	The pi-calculus a theory of mobile processes Davide Sangiorgi ; David Walker
title_short	The pi-calculus
title_sort	the pi calculus a theory of mobile processes
title_sub	a theory of mobile processes
topic	Pi-Kalkül (DE-588)4563344-7 gnd Lambda-Kalkül (DE-588)4166495-4 gnd Mobilfunk (DE-588)4170280-3 gnd Tragbarer Personal Computer (DE-588)4363314-6 gnd
topic_facet	Pi-Kalkül Lambda-Kalkül Mobilfunk Tragbarer Personal Computer
url	http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009553282&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
work_keys_str_mv	AT sangiorgidavide thepicalculusatheoryofmobileprocesses AT walkerdavid thepicalculusatheoryofmobileprocesses

Verfügbarkeit

Bestellen (Login erforderlich)

Inhaltsverzeichnis
Paper/Kapitel scannen lassen

Teilbibliothek Mathematik & Informatik

Bestandsangaben von Teilbibliothek Mathematik & Informatik
Signatur:	0102 DAT 555f 2001 A 30226 Lageplan
Exemplar 1	Ausleihbar Am Standort