Librería:
Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Calificación del vendedor: 5 de 5 estrellas
Vendedor de AbeBooks desde 27 de febrero de 2001
Emphasizes the design of full-fledged, fully normalizing lambda calculus machinery, as opposed to the just weakly normalizing machines. Series: Texts in Theoretical Computer Science: An EATCS Series. Num Pages: 384 pages, 89 black & white illustrations, biography. BIC Classification: UMX. Category: (P) Professional & Vocational. Dimension: 235 x 155 x 21. Weight in Grams: 611. . 2010. Softcover reprint of hardcover 1st ed. 2005. Paperback. . . . . N° de ref. del artículo V9783642059384
The book addresses ways and means of organizing computations, highlighting the relationship between algorithms and the basic mechanisms and runtime structures necessary to execute them using machines. It completely abstracts from concrete programming languages and machine architectures, taking instead the lambda calculus as the basic programming and program execution model to design various abstract machines for its correct implementation. This book takes a lambda calculus approach to organizing computations. It sets out with a brief introduction to lambda calculus, describes a variant of the classical SECD-machine as a basic interpreter for the lambda calculus, and in the main part continues with fully normalizing abstract lambda calculus machines, of which some are interpreting and some execute compiled code.
Acerca del autor:
Received a Dr. rer. nat. degree in physics from the Technical University Munich/Germany in 1968; worked in industrie/research institutes at the central laboratories of Siemens AG between 1963 and 1968, at Bell Northern Research Ltd in Ottawa/Canada between 1969, and 1972 at the Gesellschaft fuer Mathematik und Datenverarbeitung in St. Augustin/Germany between 1973 and 1978; became an associate professor of computer science at the University of Bonn/Germany in 1978; became a full professor of computer science at the University of Kiel/Germany retired in 2003.
Título: Abstract Computing Machines
Editorial: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Año de publicación: 2010
Encuadernación: Encuadernación de tapa blanda
Condición: New
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Condición: New. Nº de ref. del artículo: 11869270-n
Cantidad disponible: Más de 20 disponibles
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. In. Nº de ref. del artículo: ria9783642059384_new
Cantidad disponible: Más de 20 disponibles
Librería: moluna, Greven, Alemania
Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Emphasizes the design of full-fledged, fully normalizing Lambda-calculus machinery, as opposed to the just weakly normalizing machinesEmphasizes the design of full-fledged, fully normalizing Lambda-calculus machinery, as opposed to the just we. Nº de ref. del artículo: 5045066
Cantidad disponible: Más de 20 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 11869270-n
Cantidad disponible: Más de 20 disponibles
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Condición: New. Nº de ref. del artículo: ABLIING23Mar3113020215180
Cantidad disponible: Más de 20 disponibles
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
Paperback. Condición: new. Paperback. The book emphasizes the design of full-fledged, fully normalizing lambda calculusmachinery, as opposed to the just weakly normalizing machines. Emphasizes the design of full-fledged, fully normalizing lambda calculus machinery, as opposed to the just weakly normalizing machines. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Nº de ref. del artículo: 9783642059384
Cantidad disponible: 1 disponibles
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Taschenbuch. Condición: Neu. Neuware -The book emphasizes the design of full-fledged, fully normalizing lambda calculus machinery, as opposed to the just weakly normalizing machines.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 400 pp. Englisch. Nº de ref. del artículo: 9783642059384
Cantidad disponible: 2 disponibles
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - The book addresses ways and means of organizing computations, highlighting the relationship between algorithms and the basic mechanisms and runtime structures necessary to execute them using machines. It completely abstracts from concrete programming languages and machine architectures, taking instead the lambda calculus as the basic programming and program execution model to design various abstract machines for its correct implementation.The emphasis is on fully normalizing machines based on full-fledged beta-reductions as essential prerequisites for symbolic computations that treat functions and variables truly as first-class objects. Their weakly normalizing counterparts are shown to be functional abstract machines that sacrifice the flavors of full beta-reductions for decidedly simpler runtime structures and improved runtime efficiency. Further downgrading of the lambda calculus leads to classical imperative machines that permit side-effecting operations on the runtime environment. Nº de ref. del artículo: 9783642059384
Cantidad disponible: 1 disponibles
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The book addresses ways and means of organizing computations, highlighting the relationship between algorithms and the basic mechanisms and runtime structures necessary to execute them using machines. It completely abstracts from concrete programming languages and machine architectures, taking instead the lambda calculus as the basic programming and program execution model to design various abstract machines for its correct implementation.The emphasis is on fully normalizing machines based on full-fledged beta-reductions as essential prerequisites for symbolic computations that treat functions and variables truly as first-class objects. Their weakly normalizing counterparts are shown to be functional abstract machines that sacrifice the flavors of full beta-reductions for decidedly simpler runtime structures and improved runtime efficiency. Further downgrading of the lambda calculus leads to classical imperative machines that permit side-effecting operations on the runtime environment. 400 pp. Englisch. Nº de ref. del artículo: 9783642059384
Cantidad disponible: 2 disponibles
Librería: California Books, Miami, FL, Estados Unidos de America
Condición: New. Nº de ref. del artículo: I-9783642059384
Cantidad disponible: Más de 20 disponibles