Seldin jonathan p (17 risultati)

hardcover. Condizione: Acceptable.

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.

Condizione: Very Good. Item in very good condition! Textbooks may not include supplemental items i.e. CDs, access codes etc.

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.

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.

Condizione: New.

Condizione: New.

Condizione: New.

Condizione: New. In English.

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

Condizione: As New. Unread book in perfect condition.

Hardcover. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condizione: As New. Unread book in perfect condition.

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

Vol. I in second printing 1968. XVI/417, XIV/520 pp., ex-library copy with label on covers and stamps, spines slightly rubbed and with little residues of a library-signature, 2 pages in Vol. I with little underlinings, else good and clean, text in English, BITTE BEACHTEN: Aufgrund des höheren Gewichtes sind zusätzliche Versandkosten für den Versand außerhalb der EU erforderlich. PLEASE NOTE: This is a heavy book / set, that requires additional postage for international delivery outside EU. Sprache: Englisch Gewicht in Gramm: 1840 original hardcover (no dust jackets).…

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book gives an account of combinatory logic and lambda-calculus. The grammar and basic properties of both systems are discussed, followed by explanations of type-theory and lambda-calculus models. The treatment is as non-technical as possible with many .…