Higher-Order Computability

Higher-Order Computability

by John Longley, Dag Normann

Hardcover(1st ed. 2015)

$139.99
View All Available Formats & Editions
Eligible for FREE SHIPPING
  • Want it by Friday, October 26?   Order by 12:00 PM Eastern and choose Expedited Shipping at checkout.

Overview

Higher-Order Computability by John Longley, Dag Normann

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

Product Details

ISBN-13: 9783662479919
Publisher: Springer Berlin Heidelberg
Publication date: 11/09/2015
Series: Theory and Applications of Computability
Edition description: 1st ed. 2015
Pages: 571
Product dimensions: 6.10(w) x 9.25(h) x (d)

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.

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews