Results 1  10
of
11
Hereditarily Sequential Functionals
 In Proceedings of the Symposium on Logical Foundations of Computer Science: Logic at St. Petersburg, Lecture notes in Computer Science
, 1994
"... In order to define models of simply typed functional programming languages being closer to the operational semantics of these languages, the notions of sequentiality, stability and seriality were introduced. These works originated from the definability problem for PCF, posed in [Sco72], and the full ..."
Abstract

Cited by 71 (0 self)
 Add to MetaCart
In order to define models of simply typed functional programming languages being closer to the operational semantics of these languages, the notions of sequentiality, stability and seriality were introduced. These works originated from the definability problem for PCF, posed in [Sco72], and the full abstraction problem for PCF, raised in [Plo77]. The presented computation model, forming the class of hereditarily sequential functionals, is based on a game in which each play describes the interaction between a functional and its arguments during a computation. This approach is influenced by the work of Kleene [Kle78], Gandy [Gan67], Kahn and Plotkin [KP78], Berry and Curien [BC82, Cur86, Cur92], and Cartwright and Felleisen [CF92]. We characterize the computable elements in this model in two different ways: (a) by recursiveness requirements for the game, and (b) as definability with the schemata (S1) (S8), (S11), which is related to definability in PCF. It turns out that both definitio...
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
(Show Context)
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.
Partial Continuous Functions and Admissible Domain Representations
 the Journal of Logic and Computation
, 2007
"... It is well known that to be able to represent continuous functions between domain representable spaces it is critical that the domain representations of the spaces we consider are dense. In this article we show how to develop a representation theory over a category of domains with morphisms partial ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
It is well known that to be able to represent continuous functions between domain representable spaces it is critical that the domain representations of the spaces we consider are dense. In this article we show how to develop a representation theory over a category of domains with morphisms partial continuous functions. The raison d’être for introducing partial continuous functions is that by passing to partial maps, we are free to consider totalities which are not dense. We show that the category of admissibly representable spaces with morphisms functions which are representable by a partial continuous function is Cartesian closed. Finally, we consider the question of effectivity. Key words. Domain theory, domain representations, computability theory, computable analysis. 1
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 3 (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...
The Real Number Structure is Effectively Categorical
, 1997
"... On countable structures computability is usually introduced via numberings. For uncountable structures whose cardinality does not exceed the cardinality of the continuum the same can be done via representations. Which representations are appropriate for doing real number computations? We show tha ..."
Abstract
 Add to MetaCart
On countable structures computability is usually introduced via numberings. For uncountable structures whose cardinality does not exceed the cardinality of the continuum the same can be done via representations. Which representations are appropriate for doing real number computations? We show that with respect to computable equivalence there is one and only one equivalence class of representations of the real numbers which make the basic operations computable. This characterizes the real numbers in terms of the theory of effective algebras or computable structures, and is reflected by observations made in real number computer arithmetic. We also give further evidence for the wellknown nonappropriateness of the representation to some base b by proving that strictly less functions are computable with respect to these representations than with respect to a standard representation of the real numbers. Furthermore we consider basic constructions of representations and the countab...
Computability on topological spaces . . .
, 1997
"... Our aim in this thesis is to study a uniform method to introduce computability on large, usually uncountable, mathematical structures. The method we choose is domain representations using ScottErshov domains. Domain theory is a theory of approximations and incorporates a natural computability theor ..."
Abstract
 Add to MetaCart
Our aim in this thesis is to study a uniform method to introduce computability on large, usually uncountable, mathematical structures. The method we choose is domain representations using ScottErshov domains. Domain theory is a theory of approximations and incorporates a natural computability theory. This provides us with a uniform way to introduce computability on structures that have computable domain representations, by computations on the approximations of the structure. It is shown that large classes of topological spaces have satisfactory domain representations. In particular, all metric spaces are domain representable. It is also shown that the space of compact subsets of a complete metric space can be given a domain representation uniformly from a domain representation of the metric space. Several other classes of topological spaces are shown to have domain representations, although not all of them are suitable for introducing computability. Domain
Two Categories of Effective Continuous Cpos
"... This paper presents two categories of effective continuous cpos. We define a new criterion on the basis of a cpo as to make the resulting category of consistently complete continuous cpos cartesian closed. We also generalise the definition of a complete set, used as a definition of effective bifinit ..."
Abstract
 Add to MetaCart
(Show Context)
This paper presents two categories of effective continuous cpos. We define a new criterion on the basis of a cpo as to make the resulting category of consistently complete continuous cpos cartesian closed. We also generalise the definition of a complete set, used as a definition of effective bifinite domains in [HSH02], and investigate what closure results that can be obtained. 1