AbstractA definition of the notion of an effectively given continuous cpo is provided. The importance of the notion lies in the fact that we can readily characterize the computable (partial) functions of arbitrary finite type over an effectively given domain. We show that the definition given here is closed under several important domain constructions, namely sum, product, function space, powerdomain and inverse limits (the last two in a restricted form); this permits recursive domain equations to be solved effectively
Categorical models of the metalanguage FPC (a type theory with sums, products, exponentials and re...
AbstractIn recent years, there has been a considerable amount of work on using continuous domains in...
We present two characterisations of FS domains, using the upper and the lower power domain construc...
A definition of the notion of an effectively given continuous cpo is provided. The importance of the...
A definition of the notion of an effectively given continuous cpo is provided. The importance of the...
AbstractA definition of the notion of an effectively given continuous cpo is provided. The importanc...
AbstractThis paper presents two categories of effective continuous complete partial orders (cpos). W...
AbstractA completion via Frink ideals is used to define a convex powerdomain of an arbitrary continu...
This thesis consists of four papers in domain theory and a summary. The first two papers deal with t...
AbstractThe elements of a cpo (complete partial order) D̄ are ‘abstract’ objects in general.A concre...
AbstractThis paper is about mathematical problems in programming language semantics and their influe...
Achim Jung y Technische Hochschule Darmstadt and Imperial College of Science and Technology, Londo...
AbstractThe main result of this paper is a characterization of the space induced by Scott topology o...
AbstractThis paper extends the order-theoretic approach to computable analysis via continuous domain...
In this paper we address the problem of solving recursive domain equations using uncountable limits...
Categorical models of the metalanguage FPC (a type theory with sums, products, exponentials and re...
AbstractIn recent years, there has been a considerable amount of work on using continuous domains in...
We present two characterisations of FS domains, using the upper and the lower power domain construc...
A definition of the notion of an effectively given continuous cpo is provided. The importance of the...
A definition of the notion of an effectively given continuous cpo is provided. The importance of the...
AbstractA definition of the notion of an effectively given continuous cpo is provided. The importanc...
AbstractThis paper presents two categories of effective continuous complete partial orders (cpos). W...
AbstractA completion via Frink ideals is used to define a convex powerdomain of an arbitrary continu...
This thesis consists of four papers in domain theory and a summary. The first two papers deal with t...
AbstractThe elements of a cpo (complete partial order) D̄ are ‘abstract’ objects in general.A concre...
AbstractThis paper is about mathematical problems in programming language semantics and their influe...
Achim Jung y Technische Hochschule Darmstadt and Imperial College of Science and Technology, Londo...
AbstractThe main result of this paper is a characterization of the space induced by Scott topology o...
AbstractThis paper extends the order-theoretic approach to computable analysis via continuous domain...
In this paper we address the problem of solving recursive domain equations using uncountable limits...
Categorical models of the metalanguage FPC (a type theory with sums, products, exponentials and re...
AbstractIn recent years, there has been a considerable amount of work on using continuous domains in...
We present two characterisations of FS domains, using the upper and the lower power domain construc...