Categorical Combinators, Sequential Algorithms, and Functional Programming

Name: Categorical Combinators, Sequential Algorithms, and Functional Programming
Brand: Springer, Berlin
SKU: 9781461267041
Price: 553.26 RON
Availability: InStock

Autor: P.-L. Curien

Limbă:

Legare: Carte broșată

Editura: Springer, Berlin

Disponibilitate: În depozitul extern

Expediem în 5-8 zile

553.26 lei

This book is a revised edition of the monograph which appeared under the same title in the series Re...

Informații despre carte

Autor

P.-L. Curien

Limbă

engleză

Legare

Carte - Carte broșată

Publicat

2013

Pagini

404

EAN

9781461267041

ISBN

1461267048

Enbook ID

06794877

Editura

Springer, Berlin

Greutate

652

Dimensiuni

155 x 235 x 22

Descriere completă

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

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Categorical Combinators, Sequential Algorithms, and Functional Programming

Informații despre carte

Descriere completă

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și