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

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριος συγγραφέας: Kluge, W. (Συγγραφέας)
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Brauer, W. (Επιμελητής έκδοσης), Rozenberg, G. (Επιμελητής έκδοσης), Salomaa, A. (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005.
Σειρά:Texts in Theoretical Computer Science, An EATCS Series
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 03197nam a22005295i 4500
001 978-3-540-27359-2
003 DE-He213
005 20151204185507.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 
040 |d GrThAP 
050 4 |a QA76.7-76.73 
050 4 |a QA76.76.C65 
072 7 |a UMX  |2 bicssc 
072 7 |a UMC  |2 bicssc 
072 7 |a COM051010  |2 bisacsh 
072 7 |a COM010000  |2 bisacsh 
082 0 4 |a 005.13  |2 23 
100 1 |a Kluge, W.  |e author. 
245 1 0 |a Abstract Computing Machines  |h [electronic resource] :  |b A Lambda Calculus Perspective /  |c by W. Kluge ; edited by W. Brauer, G. Rozenberg, A. Salomaa. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |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 
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 Computer science. 
650 0 |a Programming languages (Electronic computers). 
650 0 |a Computer logic. 
650 1 4 |a Computer Science. 
650 2 4 |a Programming Languages, Compilers, Interpreters. 
650 2 4 |a Logics and Meanings of Programs. 
700 1 |a Brauer, W.  |e editor. 
700 1 |a Rozenberg, G.  |e editor. 
700 1 |a Salomaa, A.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783540211464 
830 0 |a Texts in Theoretical Computer Science, An EATCS Series 
856 4 0 |u http://dx.doi.org/10.1007/b138965  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
950 |a Computer Science (Springer-11645)