policies, either expressed or implied, of the NSF, NAFSA, or the U.S. government.

this paper we show that the two approaches are equivalent for a

A domain representation of a topological space X is a function, usually a quotient map, from a subset of a domain onto X . Several different classes of domain representations are introduced and studied. It is investigated when it is possible to build domain representations from existing ones. It is, for example, discussed whether there exists a natural way to build a domain representation of a product of topological spaces from given domain representations of the factors. It is shown that any T 0 topological space has a domain representation. These domain representations are very large. However, smaller domain representations are also constructed for large classes of spaces. For example, each second countable regular Hausdorff space has a domain representation with a countable base. Domain representations of functions and function spaces are also studied.

. We show that dependent sums and dependent products of continuous parametrizations on domains with dense, codense, and natural totalities agree with dependent sums and dependent products in equilogical spaces, and thus also in the realizability topos RT(P!). Keywords: continuous functionals, dependent type theory, domain theory, equilogical spaces. 1 Introduction Recently there has been a lot of interest in understanding notions of totality for domains [3, 23, 4, 18, 21]. There are several reasons for this. Totality is the semantic analogue of termination, and one is naturally interested in understanding not only termination properties of programs but also how notions of program equivalence depend on assumptions regarding termination [21]. Another reason for studying totality on domains is to obtain generalizations of the nite-type hierarchy of total continuous functionals by Kleene and Kreisel [11], see [8] and [19] for good accounts of this subject. Ershov [7] showed how the Klee...

A definition of a typed language is said to be "intrinsic" if it assigns meanings to typings rather than arbitrary phrases, so that ill-typed phrases are meaningless. In contrast, a definition is said to be "extrinsic " if all phrases have meanings that are independent of their typings, while typings represent properties of these meanings. For a simply typed lambda calculus, extended with recursion, subtypes, and named products, we give an intrinsic denotational semantics and a denotational semantics of the underlying untyped language. We then establish a logical relations theorem between these two semantics, and show that the logical relations can be "bracketed" by retractions between the domains of the two semantics. From these results, we derive an extrinsic semantics that uses partial equivalence relations.

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.

Abstract. We compare the definability of total functionals over the reals in two functional-programming approaches to exact real-number datatype of real numbers; and the intensional approach, in which one encodes real numbers using ordinary datatypes. We show that the type hierarchies coincide up to second-order types, and we relate this fact to an analogous comparison of type hierarchies over the external and internal real numbers in Dana Scott’s category of equilogical spaces. We do not know whether similar coincidences hold at third-order types. However, we relate this question to a purely topological conjecture about the Kleene-Kreisel continuous functionals over the natural numbers. Finally, although it is known that, in the extensional approach, parallel primitives are necessary for programming total first-order functions, we demonstrate that, in the intensional approach, such primitives are not needed for second-order types and below. 1

In this paper I compare two well studied approaches to topological semantics| the domain-theoretic approach, exemplied by the category of countably based equilogical spaces, Equ, and Type Two Eectivity, exemplied by the category of Baire space representations, Rep(B ). These two categories are both locally cartesian closed extensions of countably based T 0 -spaces. A natural question to ask is how they are related.

Abstract not found

It was already known that the category of T 0 topological spaces is not itself cartesian closed, but can be embedded into the cartesian closed categories FIL of filter spaces and EQU of equilogical spaces where the latter embeds into the cartesian closed category ASSM of assemblies over algebraic lattices. Here, we first clarify the notion of filter space---there are at least three versions FIL a ' FIL b ' FIL c in the literature. We establish adjunctions between FIL a and ASSM and between FIL c and ASSM, and show that FIL b and FIL c are equivalent to reflective full subcategories of ASSM. The corresponding categories FIL b 0 and FIL c 0 of T 0 spaces are equivalent to full subcategories of EQU. Keywords: Categorical models and logics, domain theory and applications Author's address: Reinhold Heckmann, FB 14 -- Informatik, Universitat des Saarlandes, Postfach 151150, D-66041 Saarbrucken, Germany Phone: +49 681 302 2454 Fax: +49 681 302 3065 e-mail: heckmann@cs.un...