000 03393nam a22004335i 4500
003 DE-He213
005 20231104114411.0
007 cr nn 008mamaa
008 151106s2015 gw | s |||| 0|eng d
020 _a9783662479926
_z978-3-662-47992-6
024 7 _a10.1007/978-3-662-47992-6
_2doi
050 4 _aQA75.5-76.95
072 7 _aUY
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUY
_2thema
072 7 _aUYA
_2thema004.0151
_223
100 1 _aLongley, John.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
245 1 0 _aHigher-Order Computability /
_cby John Longley, Dag Normann.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2015.
300 _a1 online resource
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 0 _aTheory and Applications of Computability, In cooperation with the association Computability in Europe,
_x2190-619X
505 0 _aIntroduction 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 _aThis 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 _aInformation theory.
650 0 _aComputer science.
650 1 4 _aTheory of Computation.
_0http://scigraph.springernature.com/things/product-market-codes/I16005
650 2 4 _aMathematics of Computing.
_0http://scigraph.springernature.com/things/product-market-codes/I17001
700 1 _aNormann, Dag.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
710 2 _aSpringerLink (Online service)
856 4 0 _uhttps://doi.org/10.1007/978-3-662-47992-6
_3Springer eBooks
_zOnline access link to the resource
912 _aZDB-2-SCS
999 _c200434447
_d52659
942 _2lcc
_cEBK
041 _aeng