Computing with Functionals—Computability Theory or Computer Science?

Dag Normann · Bulletin of Symbolic Logic · 2006

Abstract We review some of the history of the computability theory of functionals of higher types, and we will demonstrate how contributions from logic and theoretical computer science have shaped this still active subject.

Read the paper · More papers on PaperTik