E Book

Abstract Computing Machines



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


Ketersediaan

Tidak ada salinan data


Informasi Detil

Judul Seri
-
No. Panggil
-
Penerbit Springer : Berlin, Heidelberg.,
Deskripsi Fisik
XIV, 384 p. 89 illus.online resource.
Bahasa
English
ISBN/ISSN
9783540273592
Klasifikasi
005.13
Tipe Isi
-
Tipe Media
-
Tipe Pembawa
-
Edisi
1st ed.
Subyek
Info Detil Spesifik
-
Pernyataan Tanggungjawab

Informasi Lainnya

Anak judul
A Lambda Calculus Perspective
Judul asli
-
DOI/URL
https://doi.org/10.1007/b138965

Versi lain/terkait

Tidak tersedia versi lain




Informasi


DETAIL CANTUMAN


Kembali ke sebelumnyaDetail XMLCite this