0
Your cart

Your cart is empty

Books > Computing & IT > Computer programming > Programming languages

Buy Now

Categorical Combinators, Sequential Algorithms, and Functional Programming (Paperback, Softcover reprint of the original 1st ed. 1993) Loot Price: R2,999
Discovery Miles 29 990
Categorical Combinators, Sequential Algorithms, and Functional Programming (Paperback, Softcover reprint of the original 1st...

Categorical Combinators, Sequential Algorithms, and Functional Programming (Paperback, Softcover reprint of the original 1st ed. 1993)

P-.L. Curien

Series: Progress in Theoretical Computer Science

 (sign in to rate)
Loot Price R2,999 Discovery Miles 29 990 | Repayment Terms: R281 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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)."

General

Imprint: Springer-Verlag New York
Country of origin: United States
Series: Progress in Theoretical Computer Science
Release date: December 2012
First published: 1993
Authors: P-.L. Curien
Dimensions: 235 x 155 x 22mm (L x W x T)
Format: Paperback
Pages: 404
Edition: Softcover reprint of the original 1st ed. 1993
ISBN-13: 978-1-4612-6704-1
Categories: Books > Science & Mathematics > Mathematics > Numerical analysis
Books > Computing & IT > General theory of computing > Mathematical theory of computation
Books > Computing & IT > General theory of computing > Data structures
Books > Computing & IT > Computer programming > Algorithms & procedures
Books > Computing & IT > Applications of computing > General
Books > Science & Mathematics > Mathematics > Applied mathematics > Mathematics for scientists & engineers
Books > Computing & IT > Computer programming > Programming languages > General
LSN: 1-4612-6704-8
Barcode: 9781461267041

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners