Text

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

---

Availability

No copy data

Detail Information

Series Title

-

Call Number

004 lon H

Publisher

: ., 2015

Collation

XVI, 571

Language

English

ISBN/ISSN

978-3-662-47991-9

Classification

004

Content Type

text

Media Type

computer

Carrier Type

online resource

Edition

-

Subject(s)

Theory of Computation

Specific Detail Info

-

Statement of Responsibility

John Longley , Dag Normann

Other Information

Cataloger

Khusnun

Source

-

Validator

-

Digital Object Identifier (DOI)

-

Journal Volume

-

Journal Issue

-

Subtitle

-

Parallel Title

-

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment