000 | 03685nam a22005175i 4500 | ||
---|---|---|---|
001 | vtls000561946 | ||
003 | RU-ToGU | ||
005 | 20210922090720.0 | ||
007 | cr nn 008mamaa | ||
008 | 170213s2015 gw | s |||| 0|eng d | ||
020 |
_a9783662479926 _9978-3-662-47992-6 |
||
024 | 7 |
_a10.1007/978-3-662-47992-6 _2doi |
|
035 | _ato000561946 | ||
040 |
_aSpringer _cSpringer _dRU-ToGU |
||
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUY _2bicssc |
|
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aCOM031000 _2bisacsh |
|
082 | 0 | 4 |
_a004.0151 _223 |
100 | 1 |
_aLongley, John. _eauthor. _9470055 |
|
245 | 1 | 0 |
_aHigher-Order Computability _helectronic resource _cby John Longley, Dag Normann. |
250 | _a1st ed. 2015. | ||
260 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2015. |
||
300 |
_aXVI, 571 p. 2 illus. in color. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
490 | 1 |
_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 |
_aComputer Science. _9155490 |
|
650 | 0 |
_acomputers. _9460101 |
|
650 | 0 |
_aComputer science _xMathematics. _9304486 |
|
650 | 1 | 4 |
_aComputer Science. _9155490 |
650 | 2 | 4 |
_aTheory of Computation. _9303507 |
650 | 2 | 4 |
_aMathematics of Computing. _9303612 |
700 | 1 |
_aNormann, Dag. _eauthor. _9470056 |
|
710 | 2 |
_aSpringerLink (Online service) _9143950 |
|
773 | 0 | _tSpringer eBooks | |
830 | 0 |
_aTheory and Applications of Computability, In cooperation with the association Computability in Europe, _9470057 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-662-47992-6 |
912 | _aZDB-2-SCS | ||
999 | _c416836 |