|
|
|
|
| LEADER |
02784nmm a2200325 u 4500 |
| 001 |
EB000710463 |
| 003 |
EBX01000000000000000563545 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9789400709546
|
| 100 |
1 |
|
|a Levy, P.B.
|
| 245 |
0 |
0 |
|a Call-By-Push-Value
|h Elektronische Ressource
|b A Functional/Imperative Synthesis
|c by P.B. Levy
|
| 250 |
|
|
|a 1st ed. 2003
|
| 260 |
|
|
|a Dordrecht
|b Springer Netherlands
|c 2003, 2003
|
| 300 |
|
|
|a XLI, 352 p
|b online resource
|
| 505 |
0 |
|
|a I Language -- 1. Call-By-Value and Call-By-Name -- 2. Call-By-Push-Value: A Subsuming Paradigm -- 3. Complex Values and Equational Theory -- 4. Recursion and Infinitely Deep CBPV -- II Concrete Semantics -- 5. Simple Models of CBPV -- 6. Possible World Model for Cell Generation -- 7. Jump-With-Argument -- 8. Pointer Games -- III Categorical Semantics -- 9. Semantics in Element Style -- 10. All Models are Categorical Models -- 11. Representing Objects -- IV Conclusions -- 12. Conclusions, Comparisons and Further Work -- Appendices -- Technical Treatment of CBV and CBN -- A.1 The Jumbo ?-Calculus -- A.1.1. Introduction -- A.1.2. Tuple Types -- A.1.3. Function Types -- A.2 Languages and Tranlations -- A.3 Call-By-Value -- A.3.1. Coarse-Grain Call-By-Value -- A.3.2. Fine-Grain Call-By-Value -- A.3.3. From CG-CBV To FG-CBV -- A.4 Call-By-Name -- A.5 The Lazy Paradigm -- A.6 Subsuming FG-CBV and CBN -- A.6.1 From FG-CBV to CBPV -- A.6.2 From CBPV Back to FG-CBV -- A.6.3 From CBN to CBPV -- A.6.4 From CBPV back To CBN -- Models In The Style Of Power-Robinson -- B.1 Intoduction -- B.2 Actions of Monoidal Categories -- B.3 Freyd Categories -- B.4 Judgement Model -- B.5 Enrichment -- B.6 Connectives -- B.7 Modelling CBPV -- B.8 The Full Reflection -- B.9 Theories -- B.10 Conservativity -- References
|
| 653 |
|
|
|a Compilers (Computer programs)
|
| 653 |
|
|
|a Compilers and Interpreters
|
| 653 |
|
|
|a Mathematics of Computing
|
| 653 |
|
|
|a Computer science / Mathematics
|
| 653 |
|
|
|a Algebra, Homological
|
| 653 |
|
|
|a Category Theory, Homological Algebra
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Semantics Structures in Computation
|
| 028 |
5 |
0 |
|a 10.1007/978-94-007-0954-6
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-94-007-0954-6?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 005.45
|
| 520 |
|
|
|a Call-by-push-value is a programming language paradigm that, surprisingly, breaks down the call-by-value and call-by-name paradigms into simple primitives. This monograph, written for graduate students and researchers, exposes the call-by-push-value structure underlying a remarkable range of semantics, including operational semantics, domains, possible worlds, continuations and games
|