Results 1  10
of
33
Equilogical Spaces
, 1998
"... It is well known that one can build models of full higherorder dependent type theory (also called the calculus of constructions) using partial equivalence relations (PERs) and assemblies over a partial combinatory algebra (PCA). But the idea of categories of PERs and ERs (total equivalence relation ..."
Abstract

Cited by 31 (12 self)
 Add to MetaCart
It is well known that one can build models of full higherorder dependent type theory (also called the calculus of constructions) using partial equivalence relations (PERs) and assemblies over a partial combinatory algebra (PCA). But the idea of categories of PERs and ERs (total equivalence relations) can be applied to other structures as well. In particular, we can easily dene the category of ERs and equivalencepreserving continuous mappings over the standard category Top 0 of topological T 0 spaces; we call these spaces (a topological space together with an ER) equilogical spaces and the resulting category Equ. We show that this categoryin contradistinction to Top 0 is a cartesian closed category. The direct proof outlined here uses the equivalence of the category Equ to the category PEqu of PERs over algebraic lattices (a full subcategory of Top 0 that is well known to be cartesian closed from domain theory). In another paper with Carboni and Rosolini (cited herein) a more abstract categorical generalization shows why many such categories are cartesian closed. The category Equ obviously contains Top 0 as a full subcategory, and it naturally contains many other well known subcategories. In particular, we show why, as a consequence of work of Ershov, Berger, and others, the KleeneKreisel hierarchy of countable functionals of nite types can be naturally constructed in Equ from the natural numbers object N by repeated use in Equ of exponentiation and binary products. We also develop for Equ notions of modest sets (a category equivalent to Equ) and assemblies to explain why a model of dependent type theory is obtained. We make some comparisons of this model to other, known models. 1
A Relationship between Equilogical Spaces and Type Two Effectivity
"... In this paper I compare two well studied approaches to topological semantics the domaintheoretic 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 ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
In this paper I compare two well studied approaches to topological semantics the domaintheoretic 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.
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 14 (3 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
Computability Over the Partial Continuous Functionals
, 1998
"... We show that to every recursive total continuous functional there is a representative of in the hierearchy of partial continuous funcriohals such that is S1  S9 computable over the hierarchy of partial continuous functionals. Equivalently, the representative will be PCFdefinable over the parti ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
We show that to every recursive total continuous functional there is a representative of in the hierearchy of partial continuous funcriohals such that is S1  S9 computable over the hierarchy of partial continuous functionals. Equivalently, the representative will be PCFdefinable over the partial continuous functionals, where PCF is Plotkin's programming language for computable functionals.
Continuous Functionals of Dependent Types and Equilogical Spaces
, 2000
"... . 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, depen ..."
Abstract

Cited by 12 (8 self)
 Add to MetaCart
. 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 nitetype 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...
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.
The Meaning of Types  From Intrinsic to Extrinsic Semantics
 Department of Computer Science, University of Aarhus
, 2000
"... A definition of a typed language is said to be "intrinsic" if it assigns meanings to typings rather than arbitrary phrases, so that illtyped phrases are meaningless. In contrast, a definition is said to be "extrinsic " if all phrases have meanings that are independent of their typings, while typing ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
A definition of a typed language is said to be "intrinsic" if it assigns meanings to typings rather than arbitrary phrases, so that illtyped 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.
Continuous Functionals of Dependent and Transfinite Types
, 1995
"... this paper we study some extensions of the KleeneKreisel continuous functionals [7, 8] and show that most of the constructions and results, in particular the crucial density theorem, carry over from nite to dependent and transnite types. Following an approach of Ershov we dene the continuous functi ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
this paper we study some extensions of the KleeneKreisel continuous functionals [7, 8] and show that most of the constructions and results, in particular the crucial density theorem, carry over from nite to dependent and transnite types. Following an approach of Ershov we dene the continuous functionals as the total elements in a hierarchy of ErshovScottdomains of partial continuous functionals. In this setting the density theorem says that the total functionals are topologically dense in the partial ones, i.e. every nite (compact) functional has a total extension. We will extend this theorem from function spaces to dependent products and sums and universes. The key to the proof is the introduction of a suitable notion of density and associated with it a notion of codensity for dependent domains with totality. We show that the universe obtained by closing a given family of basic domains with totality under some quantiers has a dense and codense totality provided the totalities on the basic domains are dense and codense and the quantiers preserve density and codensity. In particular we can show that the quantiers and have this preservation property and hence, for example, the closure of the integers and the booleans (which are dense and codense) under and has a dense and codense totality. We also discuss extensions of the density theorem to iterated universes, i.e. universes closed under universe operators. From our results we derive a dependent continuous choice principle and a simple ordertheoretic characterization of extensional equality for total objects. Finally we survey two further applications of density: Waagb's extension of the KreiselLacombeShoeneldTheorem showing the coincidence of the hereditarily eectively continuous hierarchy...
Density and Choice for Total Continuous Functionals
 About and Around Georg Kreisel
, 1996
"... this paper is to give complete proofs of the density theorem and the choice principle for total continuous functionals in the natural and concrete context of the partial continuous functionals [Ers77], essentially by specializing more general treatments in the literature. The proofs obtained are rel ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
this paper is to give complete proofs of the density theorem and the choice principle for total continuous functionals in the natural and concrete context of the partial continuous functionals [Ers77], essentially by specializing more general treatments in the literature. The proofs obtained are relatively short and hopefully perspicious, and may contribute to redirect attention to the fundamental questions Kreisel originally was interested in. Obviously this work owes much to other sources. In particular I have made use of work by Scott [Sco82] (whose notion of an information system is taken as a basis to introduce domains), Roscoe [Ros87], Larsen and Winskel [LW84] and Berger [Ber93]. The paper is organized as follows. Section 1 treats information systems, and in section 2 it is shown that the partial orders defined by them are exactly the (Scott) domains with countable basis. Section 3 gives a characterization of the continuous functions between domains, in terms of approximable mappings. In section 4 cartesian products and function spaces of domains and information systems are introduced. In section 5 the partial and total continuous functionals are defined. Section 6 finally contains the proofs of the two theorems above; it will be clear that the same proofs also yield effective versions of these theorems.
Recursion on the partial continuous functionals
 Logic Colloquium ’05
, 2006
"... We describe a constructive theory of computable functionals, based on the partial continuous functionals as their intendend domain. Such a task had long ago been started by Dana Scott [28], under the wellknown abbreviation ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
We describe a constructive theory of computable functionals, based on the partial continuous functionals as their intendend domain. Such a task had long ago been started by Dana Scott [28], under the wellknown abbreviation