Record:   Prev Next
作者 Longley, John, author
書名 Higher-order computability / John Longley, Dag Normann
出版項 Heidelberg : Springer, 2015
2015
國際標準書號 9783662479919
3662479915
9783662479926
3662479923
9783662517116
3662517116
book jacket
館藏地 索書號 處理狀態 OPAC 訊息 條碼
 資訊所圖書室圖書區  F4.1 L856    到期 03-08-21    30330000234737
說明 xvi, 571 pages ; 25 cm
text txt rdacontent
unmediated n rdamedia
volume nc rdacarrier
系列 Theory and applications of computability, 2190-619X
Theory and applications of computability. 2190-619X
附註 Includes bibliographical references (pages 547-559) and index
Also available in print
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.
鏈接 Longley, John. Higher-order computability. Heidelberg : Springer, 2015 9783662479926 (OCoLC)928625975
主題 Computable functions
Computer science -- Mathematics
Computable functions. fast (OCoLC)fst00871985
Computer science -- Mathematics. fast (OCoLC)fst00872460
Alt Author Normann, Dag, 1947- author
Record:   Prev Next