Vendeur
Russell Books, Victoria, BC, Canada
Évaluation du vendeur 4 sur 5 étoiles
Honoris Librarius
Membre AbeBooks depuis 1996
Special order direct from the distributor. N° de réf. du vendeur ING9780521898850
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.
À propos des auteurs:
J. Roger Hindley is an Honorary Research Fellow at Swansea University, Wales. His main research interests are Lambda-calculus and combinatory logic and he has taught at many international universities including Bristol University, Pennsylvania State University and Tokyo Institute of technology. This is his 7th book.
Jonathan P. Seldin is a Professor in the Department of Mathematics and Computer Science at the University of Lethbridge in Alberta, Canada.
Titre : Lambda-Calculus and Combinators: An ...
Éditeur : Cambridge University Press
Date d'édition : 2008
Reliure : Hardcover
Etat : New
Edition : 2nd Edition.
Vendeur : Bay State Book Company, North Smithfield, RI, Etats-Unis
Etat : very_good. N° de réf. du vendeur BSM.VVFX
Quantité disponible : 1 disponible(s)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Etat : New. N° de réf. du vendeur ABLIING23Feb2416190021093
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 5576970-n
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Etat : New. N° de réf. du vendeur 5576970-n
Quantité disponible : Plus de 20 disponibles
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9780521898850_new
Quantité disponible : Plus de 20 disponibles
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Hardcover. Etat : Brand New. 2nd edition. 360 pages. 9.25x6.00x1.00 inches. In Stock. This item is printed on demand. N° de réf. du vendeur __0521898854
Quantité disponible : 1 disponible(s)
Vendeur : California Books, Miami, FL, Etats-Unis
Etat : New. N° de réf. du vendeur I-9780521898850
Quantité disponible : Plus de 20 disponibles
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
Hardback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. N° de réf. du vendeur C9780521898850
Quantité disponible : Plus de 20 disponibles
Vendeur : moluna, Greven, Allemagne
Gebunden. Etat : 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 . N° de réf. du vendeur 446952907
Quantité disponible : Plus de 20 disponibles
Vendeur : CitiRetail, Stevenage, Royaume-Uni
Hardcover. Etat : new. Hardcover. 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. 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 examples and exercises. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. N° de réf. du vendeur 9780521898850
Quantité disponible : 1 disponible(s)