國立虎尾科技大學 |

Higher-order computability

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Higher-order computability/ by John Longley, Dag Normann.
作者:	Longley, John.
其他作者:	Normann, Dag.
出版者:	Berlin, Heidelberg :Imprint: Springer, : 2015.,
面頁冊數:	xvi, 571 p. :ill., digital ; : 24 cm.;
Contained By:	Springer eBooks
標題:	Mathematics of Computing. -
電子資源:	http://dx.doi.org/10.1007/978-3-662-47992-6
ISBN:	9783662479926

Higher-order computability
Longley, John.

Higher-order computability[electronic resource] /by John Longley, Dag Normann. - Berlin, Heidelberg :Imprint: Springer,2015. - xvi, 571 p. :ill., digital ;24 cm. - Theory and applications of computability, in cooperation with the association computability in Europe,2190-619X. - Theory and applications of computability, in cooperation with the association computability in Europe..

Introduction and Motivation -- Historical Survey -- Theory of Computability Models -- Theory of Lambda Algebras -- Kleene Computability in a Total Setting -- Nested Sequential Procedures -- PCF and Its Models -- Total Continuous Functionals -- Hereditarily Effective Operations -- Partial Continuous Functionals -- Sequentially Realizable Functionals -- Some Intensional Models -- Related and Future Work -- References -- Index.

This book offers a self-contained exposition of the theory of computability in a higher-order context, where 'computable operations' may themselves be passed as arguments to other computable operations. The subject originated in the 1950s with the work of Kleene, Kreisel and others, and has since expanded in many different directions under the influence of workers from both mathematical logic and computer science. The ideas of higher-order computability have proved valuable both for elucidating the constructive content of logical systems, and for investigating the expressive power of various higher-order programming languages. In contrast to the well-known situation for first-order functions, it turns out that at higher types there are several different notions of computability competing for our attention, and each of these has given rise to its own strand of research. In this book, the authors offer an integrated treatment that draws together many of these strands within a unifying framework, revealing not only the range of possible computability concepts but the relationships between them. The book will serve as an ideal introduction to the field for beginning graduate students, as well as a reference for advanced researchers.

ISBN: 9783662479926

Standard No.: 10.1007/978-3-662-47992-6doiSubjects--Topical Terms:

669457
Mathematics of Computing.

LC Class. No.: QA9.59

Dewey Class. No.: 511.3

Higher-order computability
LDR:02787nam a2200349 a 4500 001 838247
003 DE-He213
005 20160428145146.0
006 m d
007 cr nn 008maaau
008 160616s2015 gw s 0 eng d
020 $a 9783662479926 $q (electronic bk.)
020 $a 9783662479919 $q (paper)
024 7 $a 10.1007/978-3-662-47992-6 $2 doi
035 $a 978-3-662-47992-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA9.59
072 7 $a UY $2 bicssc
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a COM031000 $2 bisacsh
082 0 4 $a 511.3 $2 23
090 $a QA9.59 $b .L856 2015
100 1 $a Longley, John. $3 1069281
245 1 0 $a Higher-order computability $h [electronic resource] / $c by John Longley, Dag Normann.
260 $a Berlin, Heidelberg : $c 2015. $b Imprint: Springer, $b Springer Berlin Heidelberg :
300 $a xvi, 571 p. : $b ill., digital ; $c 24 cm.
490 1 $a Theory and applications of computability, in cooperation with the association computability in Europe, $x 2190-619X
505 0 $a Introduction and Motivation -- Historical Survey -- Theory of Computability Models -- Theory of Lambda Algebras -- Kleene Computability in a Total Setting -- Nested Sequential Procedures -- PCF and Its Models -- Total Continuous Functionals -- Hereditarily Effective Operations -- Partial Continuous Functionals -- Sequentially Realizable Functionals -- Some Intensional Models -- Related and Future Work -- References -- Index.
520 $a This book offers a self-contained exposition of the theory of computability in a higher-order context, where 'computable operations' may themselves be passed as arguments to other computable operations. The subject originated in the 1950s with the work of Kleene, Kreisel and others, and has since expanded in many different directions under the influence of workers from both mathematical logic and computer science. The ideas of higher-order computability have proved valuable both for elucidating the constructive content of logical systems, and for investigating the expressive power of various higher-order programming languages. In contrast to the well-known situation for first-order functions, it turns out that at higher types there are several different notions of computability competing for our attention, and each of these has given rise to its own strand of research. In this book, the authors offer an integrated treatment that draws together many of these strands within a unifying framework, revealing not only the range of possible computability concepts but the relationships between them. The book will serve as an ideal introduction to the field for beginning graduate students, as well as a reference for advanced researchers.
650 2 4 $a Mathematics of Computing. $3 669457
650 2 4 $a Theory of Computation. $3 669322
650 1 4 $a Computer Science. $3 593922
650 0 $a Computer science $x Mathematics. $3 528496
650 0 $a Computable functions. $3 677058
700 1 $a Normann, Dag. $3 1069282
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer eBooks
830 0 $a Theory and applications of computability, in cooperation with the association computability in Europe. $3 1069283
856 4 0 $u http://dx.doi.org/10.1007/978-3-662-47992-6
950 $a Computer Science (Springer-11645)