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...
| Main Authors: | Longley, John (Author), Normann, Dag (Author) |
|---|---|
| Corporate Author: | SpringerLink (Online service) |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2015.
|
| Edition: | 1st ed. 2015. |
| Series: | Theory and Applications of Computability, In cooperation with the association Computability in Europe,
|
| Subjects: | |
| Online Access: | Full Text via HEAL-Link |
Similar Items
-
Theorem Proving in Higher Order Logics 22nd International Conference, TPHOLs 2009, Munich, Germany, August 17-20, 2009. Proceedings /
Published: (2009) -
Theorem Proving in Higher Order Logics 18th International Conference, TPHOLs 2005, Oxford, UK, August 22-25, 2005. Proceedings /
Published: (2005) -
Theorem Proving in Higher Order Logics 20th International Conference, TPHOLs 2007, Kaiserslautern, Germany, September 10-13, 2007. Proceedings /
Published: (2007) -
The Foundations of Computability Theory
by: Robič, Borut
Published: (2015) -
Turing Computability Theory and Applications /
by: Soare, Robert I.
Published: (2016)