Higher-Order Computability

• Κύριοι συγγραφείς: 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,
• Θέματα: Computer science.; Computers.; Computer science > Mathematics.; Computer Science.; Theory of Computation.; Mathematics of Computing.

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

Πίνακας περιεχομένων:

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