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

Full description

Bibliographic Details
Call Number:Libro Electrónico
Main Authors: Longley, John (Author), Normann, Dag (Author)
Corporate Author: SpringerLink (Online service)
Format: Electronic eBook
Language:Inglés
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:
Computer science.
Computer science-Mathematics.
Theory of Computation.
Mathematics of Computing.
Online Access:Texto Completo
Table of Contents:
  • 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.

Similar Items