Hindley j roger (68 risultati)

Condizione: very_good. Gently read. May have name of previous ownership, or ex-library edition. Binding tight; spine straight and smooth, with no creasing; covers clean and crisp. Minimal signs of handling or shelving. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships USPS Media Mail.…

Condizione: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

Hardcover. Condizione: Very Good. 2. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.

Hardback. Condizione: Very Good. Combinatory logic and lambda-calculus, originally devised in the 1920s, have since developed into linguistic tools, especially useful in programming languages. The authors' previous book served as the main reference for introductory courses on lambda-calculus for over 20 years: this version is thoroughly revised and offers an account of the subject with the same authoritative exposition. The grammar and basic properties of both combinatory logic and lambda-calculus are discussed, followed by an introduction to type-theory. Typed and untyped versions of the systems, and their differences, are covered. Lambda-calculus models, which lie behind much of the semantics of programming languages, are also explained in depth. The treatment is as non-technical as possible, with the main ideas emphasized and illustrated by examples. Many exercises are included, from routine to advanced, with solutions to most at the end of the book.…

Condizione: Very Good. Very Good condition. A copy that may have a few cosmetic defects. May also contain light spine creasing or a few markings such as an owner's name, short gifter's inscription or light stamp.

Hardback. Condizione: Very Good. Combinatory logic and lambda-calculus, originally devised in the 1920s, have since developed into linguistic tools, especially useful in programming languages. The authors' previous book served as the main reference for introductory courses on lambda-calculus for over 20 years: this version is thoroughly revised and offers an account of the subject with the same authoritative exposition. The grammar and basic properties of both combinatory logic and lambda-calculus are discussed, followed by an introduction to type-theory. Typed and untyped versions of the systems, and their differences, are covered. Lambda-calculus models, which lie behind much of the semantics of programming languages, are also explained in depth. The treatment is as non-technical as possible, with the main ideas emphasized and illustrated by examples. Many exercises are included, from routine to advanced, with solutions to most at the end of the book.…

Condizione: New.

Paperback. Condizione: New. Type theory is one of the most important tools in the design of higher-level programming languages, such as ML. This book introduces and teaches its techniques by focusing on one particularly neat system and studying it in detail. In this way, all the key ideas are covered without getting involved in the complications of more advanced systems, but concentrating rather on the principles that make the theory work in practice. This book takes a type-assignment approach to type theory, and the system considered is the simplest polymorphic one. The author covers all the basic ideas, including the system's relation to propositional logic, and gives a careful treatment of the type-checking algorithm which lies at the heart of every such system. Also featured are two other interesting algorithms that have been buried in inaccessible technical literature. The mathematical presentation is rigorous but clear, making the book at a level which can be used as an introduction to type theory for computer scientists.…

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Condizione: New. An introduction to type theory for computer scientists. Series: Cambridge Tracts in Theoretical Computer Science. Num Pages: 200 pages, 10 b/w illus. 1 table. BIC Classification: PBCD; UYA. Category: (P) Professional & Vocational. Dimension: 227 x 154 x 13. Weight in Grams: 314. . 2008. 1st Edition. paperback. . . . . …

Condizione: New. In English.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Condizione: New. In English.

Condizione: New. pp. 200.

Condizione: New. An introduction to type theory for computer scientists. Series: Cambridge Tracts in Theoretical Computer Science. Num Pages: 200 pages, 10 b/w illus. 1 table. BIC Classification: PBCD; UYA. Category: (P) Professional & Vocational. Dimension: 227 x 154 x 13. Weight in Grams: 314. . 2008. 1st Edition. paperback. . . . . Books ship from the US and Ireland. …

Condizione: good. Befriedigend/Good: Durchschnittlich erhaltenes Buch bzw. Schutzumschlag mit Gebrauchsspuren, aber vollständigen Seiten. / Describes the average WORN book or dust jacket that has all the pages present.

Original-Broschur. 360 Seiten. Gutes Exemplar mit nur leichten Gebrauchsspuren. Textsauber und aus einem Nichtraucherhaushalt. Original softcover. Clean book in good condition. Book from a non smoking environment. Sprache: Englisch.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the Third International Conference on Typed Lambda Calculi and Applications, TLCA '97, held in Nancy, France, in April 1997.The 24 revised full papers presented in the book were carefully selected from a total of 54 submissions. The book reports the main research advances achieved in the area of typed lambda calculi since the predecessor conference, held in 1995, and competently reflects the state of the art in the area.…

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Condizione: New.

Cloth. Condizione: Very Good. Condizione sovraccoperta: No d/j as Published. Type: Book N.B. Small plain label to inside front cover. Slight rubbing to corners of boards and head and tail of spine.

Condizione: New. 2008. 2nd Edition. Hardcover. This book gives an account of combinatory logic and lambda-calculus models. Num Pages: 358 pages, 10 b/w illus. 1 table 55 exercises. BIC Classification: PBCD; UYA. Category: (UU) Undergraduate. Dimension: 237 x 159 x 24. Weight in Grams: 688. . . . . .

Condizione: New. In English.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Type theory is one of the most important tools in the design of higher-level programming languages, such as ML. This book introduces and teaches its techniques by focusing on one particularly neat system and studying it in detail. In this way, all the key ideas are covered without getting involved in the complications of more advanced systems, but concentrating rather on the principles that make the theory work in practice. This book takes a type-assignment approach to type theory, and the system considered is the simplest polymorphic one. The author covers all the basic ideas, including the system's relation to propositional logic, and gives a careful treatment of the type-checking algorithm which lies at the heart of every such system. Also featured are two other interesting algorithms that have been buried in inaccessible technical literature. The mathematical presentation is rigorous but clear, making the book at a level which can be used as an introduction to type theory for computer scientists.…

Hardback. Condizione: New. 2nd. Combinatory logic and lambda-calculus, originally devised in the 1920s, have since developed into linguistic tools, especially useful in programming languages. The authors' previous book served as the main reference for introductory courses on lambda-calculus for over 20 years: this version is thoroughly revised and offers an account of the subject with the same authoritative exposition. The grammar and basic properties of both combinatory logic and lambda-calculus are discussed, followed by an introduction to type-theory. Typed and untyped versions of the systems, and their differences, are covered. Lambda-calculus models, which lie behind much of the semantics of programming languages, are also explained in depth. The treatment is as non-technical as possible, with the main ideas emphasized and illustrated by examples. Many exercises are included, from routine to advanced, with solutions to most at the end of the book.…