Results 1  10
of
13
Topological and Limitspace subcategories of Countablybased Equilogical Spaces
, 2001
"... this paper we show that the two approaches are equivalent for a ..."
Abstract

Cited by 22 (4 self)
 Add to MetaCart
this paper we show that the two approaches are equivalent for a
Comparing functional paradigms for exact realnumber computation
 in Proceedings ICALP 2002, Springer LNCS 2380
, 2002
"... Abstract. We compare the definability of total functionals over the reals in two functionalprogramming approaches to exact realnumber 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 ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
Abstract. We compare the definability of total functionals over the reals in two functionalprogramming approaches to exact realnumber 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 secondorder 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 thirdorder types. However, we relate this question to a purely topological conjecture about the KleeneKreisel continuous functionals over the natural numbers. Finally, although it is known that, in the extensional approach, parallel primitives are necessary for programming total firstorder functions, we demonstrate that, in the intensional approach, such primitives are not needed for secondorder types and below. 1
Constructive Data Refinement in Typed Lambda Calculus
, 2000
"... . A new treatment of data refinement in typed lambda calculus is proposed, based on prelogical relations [HS99] rather than logical relations as in [Ten94], and incorporating a constructive element. Constructive data refinement is shown to have desirable properties, and a substantial example of ..."
Abstract

Cited by 12 (7 self)
 Add to MetaCart
. A new treatment of data refinement in typed lambda calculus is proposed, based on prelogical relations [HS99] rather than logical relations as in [Ten94], and incorporating a constructive element. Constructive data refinement is shown to have desirable properties, and a substantial example of refinement is presented. 1 Introduction Various treatments of data refinement in the context of typed lambda calculus, beginning with Tennent's in [Ten94], have used logical relations to formalize the intuitive notion of refinement. This work has its roots in [Hoa72], which proposes that the correctness of a concrete version of an abstract program be verified using an invariant on the domain of concrete values together with a function mapping concrete values (that satisfy the invariant) to abstract values. In algebraic terms, what is required is a homomorphism from a subalgebra of the concrete algebra to the abstract algebra. A strictly more general method is to take a homomorphic relatio...
Reducibility of Domain Representations and CantorWeihrauch Domain Representations
, 2006
"... We introduce a notion of reducibility of representations of topological spaces and study some basic properties of this notion for domain representations. A representation reduces to another if its representing map factors through the other representation. Reductions form a preorder on representatio ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
We introduce a notion of reducibility of representations of topological spaces and study some basic properties of this notion for domain representations. A representation reduces to another if its representing map factors through the other representation. Reductions form a preorder on representations. A spectrum is a class of representations divided by the equivalence relation induced by reductions. We establish some basic properties of spectra, such as, nontriviality. Equivalent representations represent the same set of functions on the represented space. Within a class of representations, a representation is universal if all representations in the class reduce to it. We show that notions of admissibility, considered both for domains and within Weihrauch’s TTE, are universality concepts in the appropriate spectra. Viewing TTE representations as domain representations, the reduction notion here is a natural generalisation of the one from TTE. To illustrate the framework, we consider some domain representations of real numbers and show that the usual interval domain representation, which is universal among dense representations, does not reduce to various Cantor domain representations. On the other hand, however, we show that a substructure of the interval domain more suitable for efficient computation of operations is equivalent to the usual interval domain with respect to reducibility. 1.
Admissible Domain Representations of Topological Spaces
 Department of Mathematics, Uppsala University
, 2005
"... In this paper we consider admissible domain representations of topological spaces. A domain representation D of a space X is λadmissible if, in principle, all other λbased domain representations E of X can be reduced to D via a continuous function from E to D. We present a characterisation theorem ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
In this paper we consider admissible domain representations of topological spaces. A domain representation D of a space X is λadmissible if, in principle, all other λbased domain representations E of X can be reduced to D via a continuous function from E to D. We present a characterisation theorem of when a topological space has a λadmissible and κbased domain representation. We also prove that there is a natural cartesian closed category of countably based and countably admissible domain representations. These results are generalisations of [Sch02]. 1
Comparing hierarchies of total functionals
 Logical Methods in Computer Science
, 2005
"... In this paper, we will address a problem raised by Bauer, Escardó and Simpson. We define two hierarchies of total, continuous functionals over the reals based on domain theory, one based on an “extensional ” representation of the reals and the other on an “intensional ” representation. The problem i ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
In this paper, we will address a problem raised by Bauer, Escardó and Simpson. We define two hierarchies of total, continuous functionals over the reals based on domain theory, one based on an “extensional ” representation of the reals and the other on an “intensional ” representation. The problem is if these two hierarchies coincide. We will show that this coincidence problem is equivalent to the statement that the topology on the KleeneKreisel continuous functionals of a fixed type induced by all continuous functions into the reals is zerodimensional for each type. As a tool of independent interest, we will construct topological embeddings of the KleeneKreisel functionals into both the extensional and the intensional hierarchy at each type. The embeddings will be hierarchy embeddings as well in the sense that they are the inclusion maps at type 0 and respect application at higher types. 1
The Largest Topological Subcategory of Countablybased Equilogical Spaces
, 1998
"... There are two main approaches to obtaining "topological" cartesianclosed categories. Under one approach, one restricts to a full subcategory of topological spaces that happens to be cartesian closed  for example, the category of sequential spaces. Under the other, one generalises the notion of s ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
There are two main approaches to obtaining "topological" cartesianclosed categories. Under one approach, one restricts to a full subcategory of topological spaces that happens to be cartesian closed  for example, the category of sequential spaces. Under the other, one generalises the notion of space  for example, to Scott's notion of equilogical space. In this paper we show that the two approaches are equivalent for a large class of objects. We first observe that the category of countablybased equilogical spaces has, in a precisely defined sense, a largest full subcategory that can be simultaneously viewed as a full subcategory of topological spaces. This category consists of certain "!projecting" topological quotients of countablybased topological spaces, and contains, in particular, all countablybased spaces. We show that this category is cartesian closed with its structure inherited, on the one hand, from the category of sequential spaces, and, on the other, from the cate...
Exact Real Number Computations Relative to Hereditary Total Functions
 Theoretical Computer Science
, 2000
"... We show that the continuous existential quantifier is not definable in Escard6's RealPCF from all functionals equivalent to a given total one in a uniform way. ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We show that the continuous existential quantifier is not definable in Escard6's RealPCF from all functionals equivalent to a given total one in a uniform way.
Streams, Stream Transformers and Domain Representations
 Prospects for Hardware Foundations, Lecture Notes in Computer Science
, 1998
"... We present a general theory for the computation of stream transformers of the form F: (R B) (T A), where time T and R, and data A and B, are discrete or continuous. We show how methods for representing topological algebras by algebraic domains can be applied to transformations of continuous ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We present a general theory for the computation of stream transformers of the form F: (R B) (T A), where time T and R, and data A and B, are discrete or continuous. We show how methods for representing topological algebras by algebraic domains can be applied to transformations of continuous streams. A stream transformer is continuous in the compactopen topology on continuous streams if and only if it has a continuous lifting to a standard algebraic domain representation of such streams. We also examine the important problem of representing discontinuous streams, such as signals T A, where time T is continuous and data A is discrete.
Applications of the KleeneKreisel Density Theorem to Theoretical Computer Science
, 2006
"... The KleeneKreisel density theorem is one of the tools used to investigate the denotational semantics of programs involving higher types. We give a brief introduction to the classical density theorem, then show how this may be generalized to set theoretical models for algorithms accepting real numbe ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The KleeneKreisel density theorem is one of the tools used to investigate the denotational semantics of programs involving higher types. We give a brief introduction to the classical density theorem, then show how this may be generalized to set theoretical models for algorithms accepting real numbers as inputs and finally survey some recent applications of this generalization. 1