Importo totale (1 articolo articoli):
Destinazione ordine:
categorical combinators sequential algorithms (33 risultati)
Vai alla pagina principale dei risultati di ricerca
Filtri di ricerca
Tipo di articolo
- Tutti i tipi di prodotto
- Libri (33)
- Riviste e Giornali (Nessun altro risultato corrispondente a questo perfezionamento)
- Fumetti (Nessun altro risultato corrispondente a questo perfezionamento)
- Spartiti (Nessun altro risultato corrispondente a questo perfezionamento)
- Arte, Stampe e Poster (Nessun altro risultato corrispondente a questo perfezionamento)
- Fotografie (Nessun altro risultato corrispondente a questo perfezionamento)
- Mappe (Nessun altro risultato corrispondente a questo perfezionamento)
- Manoscritti e Collezionismo cartaceo (Nessun altro risultato corrispondente a questo perfezionamento)
Condizioni Maggiori informazioni
- Nuovo (29)
- Come nuovo, Ottimo o Quasi ottimo (4)
- Molto buono o Buono (Nessun altro risultato corrispondente a questo perfezionamento)
- Discreto o Mediocre (Nessun altro risultato corrispondente a questo perfezionamento)
- Come descritto (Nessun altro risultato corrispondente a questo perfezionamento)
Legatura
Ulteriori caratteristiche
- Prima ed. (1)
- Copia autograf. (Nessun altro risultato corrispondente a questo perfezionamento)
- Sovracoperta (Nessun altro risultato corrispondente a questo perfezionamento)
- Con foto (15)
- Non Print on Demand (24)
Lingua (2)
Spedizione gratuita
Paese del venditore
Valutazione venditore
-
Categorical Combinators, Sequential Algorithms, and Functional Programming
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 428 2.
-
Categorical Combinators, Sequential Algorithms, and Functional Programming
Da: Majestic Books, Hounslow, Regno Unito
Valutazione del venditore 4 su 5 stelle
EUR 49,13
EUR 7,45 shipping
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. pp. 428 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.
-
Categorical Combinators, Sequential Algorithms, and Functional Programming
Da: Biblios, Frankfurt am main, HESSE, Germania
Valutazione del venditore 4 su 5 stelle
EUR 49,78
EUR 9,95 shipping
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. pp. 428.
-
CATEGORICAL COMBINATORS, SEQUENTIAL ALGORITHMS, AND FUNCTIONAL PROGRAMMING.
Da: PASCALE'S BOOKS, NORTH READING, MA, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hard Cover. Condizione: Fine. First published in 1986, this book is the second edition, revised from 1993, 430 pages. "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. This monograph that presents an approach to the design and implementation of sequential programming languges based on the relationship between lamdba-calculus and category theory." FINE HARDCOVER. Size: 8vo - over 7¾" - 9¾" tall.
-
Categorical Combinators, Sequential Algorithms, and Functional Programming
Da: Basi6 International, Irving, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
-
Categorical Combinators, Sequential Algorithms, and Functional Programming
Da: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: 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.
-
Categorical Combinators, Sequential Algorithms, and Functional Programming
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New.
-
Categorical Combinators, Sequential Algorithms, and Functional Programming (Progress in Theoretical Computer Science)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New.
-
Categorical Combinators, Sequential Algorithms, and Functional Programming (Progress in Theoretical Computer Science)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New.
-
EUR 111,80
Spedizione gratuita
Spedito da Australia a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloBrand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
-
Categorical Combinators, Sequential Algorithms, and Functional (Progress in Theoretical Computer Science)
Editore: Birkhäuser, Boston, Basel & Berlin, 1993
ISBN 10: 1850709386 ISBN 13: 9781850709381
Da: Literary Cat Books, Machynlleth, Powys, WALES, Regno Unito
Membro dell'associazione: IOBA
Valutazione del venditore 3 su 5 stelle
Prima edizione
EUR 46,29
EUR 16,05 shipping
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloOriginal boards. Condizione: New. First Edition; First Impression. Light shelfwear. ; Octavo; xx, 404 pages.
-
Categorical Combinators, Sequential Algorithms, and Functional Programming (Progress in Theoretical Computer Science)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 111,35
EUR 13,73 shipping
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
-
Categorical Combinators, Sequential Algorithms, and Functional Programming (Progress in Theoretical Computer Science)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 111,35
EUR 13,73 shipping
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
-
Categorical Combinators, Sequential Algorithms, and Functional Programming
Da: Chiron Media, Wallingford, Regno Unito
Valutazione del venditore 4 su 5 stelle
EUR 112,07
EUR 17,76 shipping
Spedito da Regno Unito a U.S.A.Quantità: 10 disponibili
Aggiungi al carrelloPF. Condizione: New.
-
Categorical Combinators, Sequential Algorithms, and Functional Programming
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 111,34
EUR 17,20 shipping
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
EUR 92,27
EUR 48,99 shipping
Spedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Categorical Combinators, Sequential Algorithms, and Functional Programming
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 428.
-
EUR 92,27
EUR 48,99 shipping
Spedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloGebunden. Condizione: New.
-
Categorical Combinators, Sequential Algorithms, and Functional Programming
Lingua: Inglese
Editore: Birkhäuser Boston, Birkhäuser Boston Jan 1993, 1993
ISBN 10: 0817636544 ISBN 13: 9780817636548
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
EUR 106,99
EUR 60,00 shipping
Spedito da Germania a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. 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).Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin 428 pp. Englisch.
-
Categorical Combinators, Sequential Algorithms, and Functional Programming
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 159,39
EUR 17,20 shipping
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
-
Categorical Combinators, Sequential Algorithms, and Functional Programming (Progress in Theoretical Computer Science)
Da: Mispah books, Redhill, SURRE, Regno Unito
Valutazione del venditore 4 su 5 stelle
EUR 149,96
EUR 28,66 shipping
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
-
Categorical Combinators, Sequential Algorithms, and Functional Programming
Lingua: Inglese
Editore: Birkhäuser Boston, Birkhäuser Boston, 2012
ISBN 10: 1461267048 ISBN 13: 9781461267041
EUR 114,36
EUR 63,23 shipping
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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).
-
Categorical Combinators, Sequential Algorithms, and Functional Programming
Lingua: Inglese
Editore: Birkhäuser Boston, Birkhäuser Boston, 1993
ISBN 10: 0817636544 ISBN 13: 9780817636548
EUR 114,36
EUR 64,03 shipping
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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).
-
Categorical Combinators, Sequential Algorithms, and Functional Programming
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: As New. Unread book in perfect condition.
-
Categorical Combinators, Sequential Algorithms, and Functional Programming
Lingua: Inglese
Editore: Birkhäuser, Birkhäuser Sep 2012, 2012
ISBN 10: 1461267048 ISBN 13: 9781461267041
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
EUR 106,99
EUR 23,00 shipping
Spedito da Germania a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
-
Categorical Combinators, Sequential Algorithms, and Functional Programming
Lingua: Inglese
Editore: Birkhäuser Boston Jan 1993, 1993
ISBN 10: 0817636544 ISBN 13: 9780817636548
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
EUR 106,99
EUR 23,00 shipping
Spedito da Germania a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloBuch. Condizione: 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.
-
Categorical Combinators, Sequential Algorithms, and Functional Programming
Lingua: Inglese
Editore: Springer-Verlag New York Inc., 2012
ISBN 10: 1461267048 ISBN 13: 9781461267041
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 135,40
EUR 19,49 shipping
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloPaperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 625.
-
Categorical Combinators, Sequential Algorithms, and Functional Programming
Da: Majestic Books, Hounslow, Regno Unito
Valutazione del venditore 4 su 5 stelle
EUR 145,47
EUR 7,45 shipping
Spedito da Regno Unito a U.S.A.Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand pp. 428 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.
-
Categorical Combinators, Sequential Algorithms, and Functional Programming
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 136,49
EUR 21,52 shipping
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloHardback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 802.
-
Categorical Combinators, Sequential Algorithms, and Functional Programming
Da: Biblios, Frankfurt am main, HESSE, Germania
Valutazione del venditore 4 su 5 stelle
EUR 148,57
EUR 9,95 shipping
Spedito da Germania a U.S.A.Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND pp. 428.
