Categorical Combinators, Sequential Algorithms, and Functional Programming

Name: Categorical Combinators, Sequential Algorithms, and Functional Programming
Brand: Springer Nature
SKU: 9781461203179
Availability: InStock

Best Price (Coupon Required):
Buy Categorical Combinators, Sequential Algorithms, and Functional Programming for $76.50 at @ Link.springer.com when you apply the 10% OFF coupon at checkout.
Click “Get Coupon & Buy” to copy the code and unlock the deal.

Set a price drop alert to never miss an offer.

1 Offer Price Range: $84.99 - $84.99

BEST PRICE

Single Product Purchase

$76.50

@ Link.springer.com with extra coupon

Price Comparison

Seller	Contact Seller	List Price	On Sale	Shipping	Best Promo	Final Price	Volume Discount	Financing	Availability	Seller's Page
BEST PRICE 1 Product Purchase @ Link.springer.com		$84.99	$84.99		10% OFF This deals requires coupon	$76.50		See Site	In stock	Visit Store

Product Details

Brand

Springer Nature

Manufacturer

N/A

Part Number

GTIN

9781461203179

Condition

New

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

Available Colors

N/A

Available Sizes

N/A

Reviews

0 reviews

5 stars

4 stars

3 stars

2 stars

1 star

Questions & Answers

Similar Products

Making Renewable Electricity Policy in Spain

$129.99

Poisson Point Processes

$169.99

Policy Responses to the Interwar Economic Crisis

$119.99

Die Einzelhaus-Wasserversorgung

$59.99

Analysis and Control of Age-Dependent Population Dynamics

$109.99

The "I Love My Air Fryer" Cooking for One Recipe Book: 175 Easy and Delicious Single-Serving Recipes, from Chicken Parmesan to Pineapple Upside-Down C

$17.99