null
Loading…
Skip to main content Skip to buy box

Holiday gifts by Fri, Dec 18? Order by Thu, Dec 3. Plan gifts Gifts by Dec 18? Order by Dec 3. Plan

Free shipping on most orders over $95 in the contiguous US

Specialists Mon–Fri, 8:30 am–5 pm PTSpecialists Mon–Fri, 8:30–5 PT866-522-6657

Categorical Combinators, Sequential Algorithms, and Functional Programming (Progress in Theoretical Computer Science) book cover by P.-L. Curien
Hardcover

Categorical Combinators, Sequential Algorithms, and Functional Programming (Progress in Theoretical Computer Science)

by P.-L. Curien

From $96.79 / copy at 25+ copies; lower per-copy prices at higher quantities (see Volume pricing) As low as $94.59 at 100+

Total $2,419.75

Hardcover · 404 pages Birkhäuser Boston · 1993

Format

Hardcover
Volume pricing

The more copies, the less each one costs

Applied automatically in your cart. No code needed.

About the book

Categorical Combinators, Sequential Algorithms, and Functional Programming (Progress in Theoretical Computer Science)

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

Details

Publisher
Birkhäuser Boston
Author
P.-L. Curien
Format
Hardcover
Published
Jan 1, 1993
ISBN-13
9780817636548
Pages
404
Buying for a group

Categorical Combinators, Sequential Algorithms, and Functional Programming (Progress in Theoretical Computer Science) for groups: pricing

Volume pricing applies automatically in your cart. No codes, no account needed.

CopiesPrice per copyYou save
25 – 49 $96.79 12% off list
50 – 99 $95.69 13% off list
100+ $94.59 14% off list
Ways groups use it

Popular for

1
Course and classroom adoption

A copy for every student in the class or section.

2
Faculty and staff book studies

Shared reading for professional development.

3
Orientation and campus events

Common reads and first-year programs.

Where can I buy 100 copies of Categorical Combinators, Sequential Algorithms, and Functional Programming?

BookPal sells Categorical Combinators, Sequential Algorithms, and Functional Programming in quantity. At 100 copies the price is $94.59 a copy, against a list price of $109.99, and the cart applies the volume tier automatically. Free shipping on most orders over $95 in the contiguous US. A specialist can quote a larger or mixed order.

  • New books only, straight from the publisher
  • Volume prices apply automatically in the cart, with no code needed
  • Order at least 10 business days before you need the books (11 from mid-November through December)

Ask a specialist about a larger or mixed order

What does Categorical Combinators, Sequential Algorithms, and Functional Programming (Progress in Theoretical Computer Science) cost when I buy for a group?

Volume pricing applies automatically in your cart, with no code needed. Price per copy: 25 to 49 copies, $96.79 (12% off list); 50 to 99 copies, $95.69 (13% off list); 100+ copies, $94.59 (14% off list). Need a different quantity, or a quote to forward for approval? Ask a specialist and we will confirm pricing before you pay.

How fast can I get copies of Categorical Combinators, Sequential Algorithms, and Functional Programming (Progress in Theoretical Computer Science)?

Need them by a specific date? Request a quote and we'll confirm timing before you pay.

Can you ship to several locations or people's homes?

Yes. We ship group orders to one address, to multiple sites, or to individual recipients, in the US and internationally. See fulfillment options.

Can I get a formal quote for approval before ordering?

Yes. Request a quote and we'll send a PDF you can forward for approval.

Do you accept purchase orders and tax-exempt orders?

Yes. We accept purchase orders upon approval, as well as cards, PayPal, ACH, wire transfers and checks. BookPal is a tax-exempt supplier in all 50 states. See purchase orders and sales tax exemption.

What if I find a lower price?

Send us the link. We match prices from other booksellers and distributors on a new copy in the same edition, available to ship in the quantity you need. Clearance sales and pricing errors are the exception, and we'll tell you quickly if that's the case. Start a price match.

Send for approval

Get a yes from your approver

Categorical Combinators, Sequential Algorithms, and Functional Programming (Progress in Theoretical Computer Science)
Email it to my approver

Your approver gets a link to this page with the quantity set and an "Approve and order" button. Nothing is sent until you press send in your email app.

Log In
Review Your Cart
Your cart is empty Your cart is empty Your cart is empty

Menu

Recently Viewed Recently Viewed
Back to top Back to top