Language: English
Published by Cambridge University Press, 1986
ISBN 10: 0521318394 ISBN 13: 9780521318396
Seller: Cotswold Internet Books, Cheltenham, United Kingdom
Condition: Used - Very Good. VG paperback. London Mathematical Society Student Texts 1. 1986 1st edition with uncreased but slightly faded spine and lightly creased cover; a little wear to edges and corners. Page fore-edges a bit yellowed. Internally, top corner of first page removed; otherwise, a clean, tidy copy. Used - Very Good. VG paperback.
Language: English
Published by Cambridge University Press (edition 2), 2008
ISBN 10: 0521898854 ISBN 13: 9780521898850
Seller: BooksRun, Philadelphia, PA, U.S.A.
Hardcover. Condition: New. 2. The item is brand new, never used or read. It's in perfect condition and may include supplements and/or access codes or come shrink-wrapped.
Language: English
Published by Cambridge University Press, 2008
ISBN 10: 0521898854 ISBN 13: 9780521898850
Seller: medimops, Berlin, Germany
Condition: very good. Gut/Very good: Buch bzw. Schutzumschlag mit wenigen Gebrauchsspuren an Einband, Schutzumschlag oder Seiten. / Describes a book or dust jacket that does show some signs of wear on either the binding, dust jacket or pages.
Language: English
Published by Cambridge University Press, 2008
ISBN 10: 0521898854 ISBN 13: 9780521898850
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New.
Language: English
Published by Cambridge University Press, 2008
ISBN 10: 0521898854 ISBN 13: 9780521898850
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 73.81
Quantity: Over 20 available
Add to basketCondition: New. In.
Language: English
Published by Cambridge University Press, 2008
ISBN 10: 0521898854 ISBN 13: 9780521898850
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New.
Language: English
Published by Cambridge University Press, GB, 2008
ISBN 10: 0521898854 ISBN 13: 9780521898850
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Hardback. Condition: New. 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.
Language: English
Published by Cambridge University Press, 2008
ISBN 10: 0521898854 ISBN 13: 9780521898850
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
£ 138.99
Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
Language: English
Published by Cambridge University Press, GB, 2008
ISBN 10: 0521898854 ISBN 13: 9780521898850
Seller: Rarewaves.com UK, London, United Kingdom
Hardback. Condition: New. 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.
Language: English
Published by Cambridge University Press, 2008
ISBN 10: 0521898854 ISBN 13: 9780521898850
Seller: Mispah books, Redhill, SURRE, United Kingdom
Hardcover. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Language: English
Published by Cambridge University Press, 2008
ISBN 10: 0521898854 ISBN 13: 9780521898850
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition.
Language: English
Published by Amsterdam, North-Holland Publishing Company 1968 / 1972., 1968
ISBN 10: 0720422086 ISBN 13: 9780720422085
Seller: Antiquariat An der Vikarie, Grafschaft-Leimersdorf, Germany
Association Member: GIAQ
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),
Seller: Revaluation Books, Exeter, United Kingdom
Hardcover. Condition: Brand New. 2nd edition. 360 pages. 9.25x6.00x1.00 inches. In Stock. This item is printed on demand.
Seller: moluna, Greven, Germany
Gebunden. Condition: 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 .