Results 1 
2 of
2
Notions of computability at higher types I
 In Logic Colloquium 2000
, 2005
"... We discuss the conceptual problem of identifying the natural notions of computability at higher types (over the natural numbers). We argue for an eclectic approach, in which one considers a wide range of possible approaches to defining higher type computability and then looks for regularities. As a ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
We discuss the conceptual problem of identifying the natural notions of computability at higher types (over the natural numbers). We argue for an eclectic approach, in which one considers a wide range of possible approaches to defining higher type computability and then looks for regularities. As a first step in this programme, we give an extended survey of the di#erent strands of research on higher type computability to date, bringing together material from recursion theory, constructive logic and computer science. The paper thus serves as a reasonably complete overview of the literature on higher type computability. Two sequel papers will be devoted to developing a more systematic account of the material reviewed here.
Partial Morphisms in Categories of Effective Objects
, 1996
"... This paper is divided in two parts. In the rst one we analyse in great generality data types in relation to partial morphisms. We introduce partial function spaces, partial cartesian closed categories and complete objects, motivate their introduction and show some of their properties. In the seco ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper is divided in two parts. In the rst one we analyse in great generality data types in relation to partial morphisms. We introduce partial function spaces, partial cartesian closed categories and complete objects, motivate their introduction and show some of their properties. In the second part we dene the (partial) cartesian closed category GEN of generalized numbered sets, prove that it is a good extension of the category of numbered sets and show how it is related to the recursive topos. Introduction By data type one usually means a set of objects of the same kind, suitable for manipulation by a computer program. Of course, computers actually manipulate formal representations of objects. The purpose of the mathematical semantics of programming languages, however, is to characterize data types (and functions on them) in a way which is independent of any specic representation mechanism. So the objects one deals with are mostly elements of structures borrowed fro...