Categorical Combinators, Sequential Algorithms, and Functional Programming - Progress in Theoretical Computer Science (Hardback)
  • Categorical Combinators, Sequential Algorithms, and Functional Programming - Progress in Theoretical Computer Science (Hardback)
zoom

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

(author)
£109.99
Hardback 404 Pages / Published: 01/01/1993
  • We can order this

Usually dispatched within 2 weeks

  • This item has been added to your basket
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).

Publisher: Birkhauser Boston Inc
ISBN: 9780817636548
Number of pages: 404
Weight: 1710 g
Dimensions: 235 x 155 x 23 mm
Edition: 2nd Revised edition

You may also be interested in...

MATLAB Demystified
Added to basket
£21.99
Paperback
Computational Physics
Added to basket
Discrete Mathematics
Added to basket
Concrete Mathematics
Added to basket
All of Statistics
Added to basket
Logic in Computer Science
Added to basket
Algorithms on Trees and Graphs
Added to basket
The Art of Computer Programming
Added to basket
Quantum Computer Science
Added to basket
Foundation Mathematics
Added to basket
The Algorithm Design Manual
Added to basket
The Elements of Statistical Learning
Added to basket
Bayesian Methods for Hackers
Added to basket
Data Analysis with Open Source Tools
Added to basket

Please sign in to write a review

Your review has been submitted successfully.