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

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Longley, John (Autor), Normann, Dag (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2015.
Edición:1st ed. 2015.
Colección:Theory and Applications of Computability, In cooperation with the association Computability in Europe,
Temas:
Computer science.
Computer science-Mathematics.
Theory of Computation.
Mathematics of Computing.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • 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.

Ejemplares similares