Higher-Order Computability (Record no. 57439)

000 -LEADER
fixed length control field 03476nam a22005055i 4500
001 - CONTROL NUMBER
control field 978-3-662-47992-6
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20200421112222.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 151106s2015 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783662479926
-- 978-3-662-47992-6
082 04 - CLASSIFICATION NUMBER
Call Number 004.0151
100 1# - AUTHOR NAME
Author Longley, John.
245 10 - TITLE STATEMENT
Title Higher-Order Computability
300 ## - PHYSICAL DESCRIPTION
Number of Pages XVI, 571 p. 2 illus. in color.
490 1# - SERIES STATEMENT
Series statement Theory and Applications of Computability, In cooperation with the association Computability in Europe,
505 0# - FORMATTED CONTENTS NOTE
Remark 2 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 ## - SUMMARY, ETC.
Summary, etc 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 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
General subdivision Mathematics.
700 1# - AUTHOR 2
Author 2 Normann, Dag.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-3-662-47992-6
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg :
-- Imprint: Springer,
-- 2015.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer science.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computers.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer science
650 14 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer Science.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Theory of Computation.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Mathematics of Computing.
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 2190-619X
912 ## -
-- ZDB-2-SCS

No items available.