Articles liés à Categorical Combinators, Sequential Algorithms, and...
Synopsis
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).
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 50,90
EUR 7,73 expédition depuis Etats-Unis vers France
Destinations, frais et délaisAutres éditions populaires du même titre
Résultats de recherche pour Categorical Combinators, Sequential Algorithms, and...
Image d'archives
Categorical Combinators, Sequential Algorithms, and Functional Programming
Edité par
Birkhauser Boston Inc, 1993
ISBN 10 : 0817636544
ISBN 13 : 9780817636548
Ancien ou d'occasion
Couverture rigide
Vendeur : Ammareal, Morangis, France
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : Très bon. Ancien livre de bibliothèque. Edition 1993. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 1993. Ammareal gives back up to 15% of this item's net price to charity organizations. N° de réf. du vendeur E-595-515
Quantité disponible : 1 disponible(s)
Image d'archives
Categorical Combinators, Sequential Algorithms, and Functional Programming
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. pp. 428 2. N° de réf. du vendeur 263062334
Quantité disponible : 1 disponible(s)
Image d'archives
Categorical Combinators, Sequential Algorithms, and Functional Programming
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. pp. 428. N° de réf. du vendeur 183062324
Quantité disponible : 1 disponible(s)
Image d'archives
Categorical Combinators, Sequential Algorithms, and Functional Programming
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. pp. 428 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam. N° de réf. du vendeur 5834209
Quantité disponible : 1 disponible(s)
Image d'archives
Categorical Combinators, Sequential Algorithms, and Functional Programming
Vendeur : Romtrade Corp., STERLING HEIGHTS, MI, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. N° de réf. du vendeur ABNR-83480
Quantité disponible : 1 disponible(s)
Image d'archives
Categorical Combinators, Sequential Algorithms, and Functional Programming
Vendeur : Basi6 International, Irving, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. N° de réf. du vendeur ABEJUNE24-129781
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Categorical Combinators, Sequential Algorithms, and Functional Programming
Edité par
Birkhäuser Boston, 1993
ISBN 10 : 0817636544
ISBN 13 : 9780817636548
Neuf
Couverture rigide
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Gebunden. Etat : New. N° de réf. du vendeur 5975458
Quantité disponible : Plus de 20 disponibles
Image d'archives
Categorical Combinators, Sequential Algorithms, and Functional Programming (Progress in Theoretical Computer Science)
Edité par
Birkhäuser, 1993
ISBN 10 : 0817636544
ISBN 13 : 9780817636548
Ancien ou d'occasion
Couverture rigide
Vendeur : ALLBOOKS1, Direk, SA, Australie
Évaluation du vendeur 5 sur 5 étoiles
N° de réf. du vendeur SHUB129781
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Categorical Combinators, Sequential Algorithms, and Functional Programming
Edité par
Birkhäuser Boston Jan 1993, 1993
ISBN 10 : 0817636544
ISBN 13 : 9780817636548
Neuf
Couverture rigide
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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). 428 pp. Englisch. N° de réf. du vendeur 9780817636548
Quantité disponible : 2 disponible(s)
Image d'archives
Categorical Combinators, Sequential Algorithms, and Functional Programming (Progress in Theoretical Computer Science)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9780817636548_new
Quantité disponible : Plus de 20 disponibles