Higher-Order Computability

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 ha...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριοι συγγραφείς: Longley, John (Συγγραφέας), Normann, Dag (Συγγραφέας)
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2015.
Έκδοση:1st ed. 2015.
Σειρά:Theory and Applications of Computability, In cooperation with the association Computability in Europe,
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 03505nam a22005055i 4500
001 978-3-662-47992-6
003 DE-He213
005 20151218091135.0
007 cr nn 008mamaa
008 151106s2015 gw | s |||| 0|eng d
020 |a 9783662479926  |9 978-3-662-47992-6 
024 7 |a 10.1007/978-3-662-47992-6  |2 doi 
040 |d GrThAP 
050 4 |a QA75.5-76.95 
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 004.0151  |2 23 
100 1 |a Longley, John.  |e author. 
245 1 0 |a Higher-Order Computability  |h [electronic resource] /  |c by John Longley, Dag Normann. 
250 |a 1st ed. 2015. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2015. 
300 |a XVI, 571 p. 2 illus. in color.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
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 0 |a Computer science. 
650 0 |a Computers. 
650 0 |a Computer science  |x Mathematics. 
650 1 4 |a Computer Science. 
650 2 4 |a Theory of Computation. 
650 2 4 |a Mathematics of Computing. 
700 1 |a Normann, Dag.  |e author. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783662479919 
830 0 |a Theory and Applications of Computability, In cooperation with the association Computability in Europe,  |x 2190-619X 
856 4 0 |u http://dx.doi.org/10.1007/978-3-662-47992-6  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
950 |a Computer Science (Springer-11645)