Description: Categorical Combinators, Sequential Algorithms, and Functional Programming by P.-L. Curien The study of the full abstraction problem for PCF and extensions of it has been enriched with a new full abstraction result: the model of sequential algorithms is fully abstract with respect to an extension of PCF with a control operator (Cartwright, Felleisen, Curien). FORMAT Paperback LANGUAGE English CONDITION Brand New Publisher Description This book is a revised edition of the monograph which appeared under the same title in the series Research Notes in Theoretical Computer Science, Pit man, in 1986. In addition to a general effort to improve typography, English, and presentation, the main novelty of this second edition is the integration of some new material. Part of it is mine (mostly jointly with coauthors). Here is brief guide to these additions. I have augmented the account of categorical combinatory logic with a description of the confluence properties of rewriting systems of categor ical combinators (Hardin, Yokouchi), and of the newly developed cal culi of explicit substitutions (Abadi, Cardelli, Curien, Hardin, Levy, and Rios), which are similar in spirit to the categorical combinatory logic, but are closer to the syntax of A-calculus (Section 1.2). The study of the full abstraction problem for PCF and extensions of it has been enriched with a new full abstraction result: the model of sequential algorithms is fully abstract with respect to an extension of PCF with a control operator (Cartwright, Felleisen, Curien). An order extensional model of error-sensitive sequential algorithms is also fully abstract for a corresponding extension of PCF with a control operator and errors (Sections 2.6 and 4.1). I suggest that sequential algorithms lend themselves to a decomposition of the function spaces that leads to models of linear logic (Lamarche, Curien), and that connects sequentiality with games (Joyal, Blass, Abramsky) (Sections 2.1 and 2.6). Notes Springer Book Archives Table of Contents 1. Categorical Combinators.- 1.1 Introducing categorical combinators.- 1.2 ?-calculus and untyped categorical combinatory logic.- 1.3 Types and cartesian closed categories.- 1.4 From untyped calculus to typed calculus: axiomatizing a universal type.- 1.5 Models of the ?-calculus.- 1.6 Equivalence of presentations.- 1.7 Evaluation of categorical terms.- 1.8 Discussion.- 2. Sequential Algorithms.- 2.1 Concrete data structures.- 2.2 Representation theorems.- 2.3 Domain equations.- 2.4 Sequential functions.- 2.5 Sequential algorithms.- 2.6 The category of concrete data structures and sequential algorithms.- 2.7 Discussion.- 3. CDSO: The Kernel of a Functional Language.- 3.1 Declaring concrete data structures.- 3.2 The language of constants: states and sequential algorithms.- 3.3 The language of expressions.- 3.4 Operational semantics: presentation.- 3.5 Operational semantics: the rules of CDSO1.- 3.6 Pull abstraction for CDS0l.- 3.7 Discussion.- 4. The Full Abstraction Problem.- 4.1 The languages PCF, PCFP, and PCFC.- 4.2 Sequential algorithms and extensionality: the bicds.- 4.3 Complete bicds.- 4.4 Extensional algorithms and definability.- 4.5 Discussion.- 5. Conclusion.- 6. Mathematical Prerequisites.- References.- Index of Definitions.- Index of Symbols. Promotional Springer Book Archives Long Description This book is a revised edition of the monograph which appeared under the same title in the series Research Notes in Theoretical Computer Science, Pit Details ISBN1461267048 Language English Year 2012 Short Title CATEGORICAL COMBINATORS SEQUEN Series Progress in Theoretical Computer Science Media Book DEWEY 511.3 Edition 93199th ISBN-10 0817636544 Imprint Springer-Verlag New York Inc. Place of Publication New York Country of Publication United States Illustrations XX, 404 p. AU Release Date 2012-09-27 NZ Release Date 2012-09-27 US Release Date 2012-09-27 UK Release Date 2012-09-27 Author P.-L. Curien Pages 404 Publisher Springer-Verlag New York Inc. Edition Description Softcover reprint of the original 1st ed. 1993 ISBN-13 9781461267041 Format Paperback Publication Date 2012-09-27 Alternative 9780817636548 Audience Professional & Vocational We've got this At The Nile, if you're looking for it, we've got it. With fast shipping, low prices, friendly service and well over a million items - you're bound to find what you want, at a price you'll love! TheNile_Item_ID:137888744;
Price: 218.65 AUD
Location: Melbourne
End Time: 2024-11-06T15:05:24.000Z
Shipping Cost: 0 AUD
Product Images
Item Specifics
Restocking fee: No
Return shipping will be paid by: Buyer
Returns Accepted: Returns Accepted
Item must be returned within: 30 Days
ISBN-13: 9781461267041
Book Title: Categorical Combinators, Sequential Algorithms, and Functional Pr
Number of Pages: 404 Pages
Language: English
Publication Name: Categorical Combinators, Sequential Algorithms, and Functional Programming
Publisher: Springer-Verlag New York Inc.
Publication Year: 2012
Subject: Computer Science, Mathematics
Item Height: 235 mm
Item Weight: 652 g
Type: Textbook
Author: P.-L. Curien
Item Width: 155 mm
Format: Paperback
