Skip to main content
Book cover

Higher-Order Computability

  • Book
  • © 2015

Overview

  • Valuable for researchers in mathematical logic and theoretical computer science
  • Consolidates work carried out in this domain since the 1950s
  • Asks what ‘computability’ means for data more complex than natural numbers

Part of the book series: Theory and Applications of Computability (THEOAPPLCOM)

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 179.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 179.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (13 chapters)

  1. Background and General Theory

  2. Particular Models

Keywords

About this book

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

Reviews

“This book is a true tour de force. The content is both mathematics and computer science; it is simultaneously an introductory textbook for students, a tutorial for seasoned researchers, a reference work, and a research monograph; ... The references to the literature are thorough. The writing is technical mathematics, and is good by that standard: there is ample intuitive explanation, and it is overall readable.” (Robert S. Lubarsky, Mathematical Reviews, April 2018)

Authors and Affiliations

  • Informatics Forum, School of Informatics, Edinburgh, United Kingdom

    John Longley

  • Dept. of Mathematics, The University of Oslo, Oslo, Norway

    Dag Normann

Bibliographic Information

  • Book Title: Higher-Order Computability

  • Authors: John Longley, Dag Normann

  • Series Title: Theory and Applications of Computability

  • DOI: https://doi.org/10.1007/978-3-662-47992-6

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Computer Science, Computer Science (R0)

  • Copyright Information: Springer-Verlag Berlin Heidelberg 2015

  • Hardcover ISBN: 978-3-662-47991-9Published: 17 November 2015

  • Softcover ISBN: 978-3-662-51711-6Published: 23 August 2016

  • eBook ISBN: 978-3-662-47992-6Published: 06 November 2015

  • Series ISSN: 2190-619X

  • Series E-ISSN: 2190-6203

  • Edition Number: 1

  • Number of Pages: XVI, 571

  • Number of Illustrations: 2 illustrations in colour

  • Topics: Theory of Computation, Mathematics of Computing

Publish with us