Abstract Computing Machines A Lambda Calculus Perspective /

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

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Kluge, Werner (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
Edición:1st ed. 2005.
Colección:Texts in Theoretical Computer Science. An EATCS Series,
Temas:
Compilers (Computer programs).
Computer science.
Compilers and Interpreters.
Computer Science Logic and Foundations of Programming.
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-540-27359-2
003 DE-He213
005 20220116101129.0
007 cr nn 008mamaa
008 100301s2005 gw | s |||| 0|eng d
020 |a 9783540273592  |9 978-3-540-27359-2 
024 7 |a 10.1007/b138965  |2 doi 
050 4 |a QA76.76.C65 
072 7 |a UMC  |2 bicssc 
072 7 |a COM051010  |2 bisacsh 
072 7 |a UMC  |2 thema 
082 0 4 |a 005.45  |2 23 
100 1 |a Kluge, Werner.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Abstract Computing Machines  |h [electronic resource] :  |b A Lambda Calculus Perspective /  |c by Werner Kluge. 
250 |a 1st ed. 2005. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2005. 
300 |a XIV, 384 p. 89 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Texts in Theoretical Computer Science. An EATCS Series,  |x 1862-4502 
505 0 |a Algorithms and Programs -- An Algorithmic Language -- The ?-Calculus -- The se(m)cd Machine and Others -- Toward Full-Fledged ?-Calculus Machines -- Interpreted Head-Order Graph Reduction -- The B-Machine -- The G-Machine -- The ?-red Machinery -- Pattern Matching -- Another Functional Abstract Machine -- Imperative Abstract Machines -- Real Computing Machines. 
520 |a 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. 
650 0 |a Compilers (Computer programs). 
650 0 |a Computer science. 
650 1 4 |a Compilers and Interpreters. 
650 2 4 |a Computer Science Logic and Foundations of Programming. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783540801085 
776 0 8 |i Printed edition:  |z 9783642059384 
776 0 8 |i Printed edition:  |z 9783540211464 
830 0 |a Texts in Theoretical Computer Science. An EATCS Series,  |x 1862-4502 
856 4 0 |u https://doi.uam.elogim.com/10.1007/b138965  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710) 

Ejemplares similares