Results 1 -
3 of
3
Axioms and (Counter)examples in Synthetic Domain Theory
- Annals of Pure and Applied Logic
, 1998
"... this paper we adopt the most popular choice, the internal logic of an elementary topos (with nno), also chosen, e.g., in [23, 8, 26]. The principal benefits are that models of the logic (toposes) are ubiquitous, and the methods for constructing and analysing them are very well-established. For the p ..."
Abstract
-
Cited by 8 (7 self)
- Add to MetaCart
this paper we adopt the most popular choice, the internal logic of an elementary topos (with nno), also chosen, e.g., in [23, 8, 26]. The principal benefits are that models of the logic (toposes) are ubiquitous, and the methods for constructing and analysing them are very well-established. For the purposes of the axiomatic part of this paper, we believe that it would also be
Type Theory via Exact Categories (Extended Abstract)
- In Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science LICS '98
, 1998
"... Partial equivalence relations (and categories of these) are a standard tool in semantics of type theories and programming languages, since they often provide a cartesian closed category with extended definability. Using the theory of exact categories, we give a category-theoretic explanation of why ..."
Abstract
-
Cited by 7 (0 self)
- Add to MetaCart
Partial equivalence relations (and categories of these) are a standard tool in semantics of type theories and programming languages, since they often provide a cartesian closed category with extended definability. Using the theory of exact categories, we give a category-theoretic explanation of why the construction of a category of partial equivalence relations often produces a cartesian closed category. We show how several familiar examples of categories of partial equivalence relations fit into the general framework. 1 Introduction Partial equivalence relations (and categories of these) are a standard tool in semantics of programming languages, see e.g. [2, 5, 7, 9, 15, 17, 20, 22, 35] and [6, 29] for extensive surveys. They are usefully applied to give proofs of correctness and adequacy since they often provide a cartesian closed category with additional properties. Take for instance a partial equivalence relation on the set of natural numbers: a binary relation R ` N\ThetaN on th...
Domains in H
"... We give various internal descriptions of the category !-Cpo of !-complete posets and !-continuous functions in the model H of Synthetic Domain Theory introduced in [8]. It follows that the !-cpos lie between the two extreme synthetic notions of domain given by repleteness and well-completeness. Int ..."
Abstract
- Add to MetaCart
We give various internal descriptions of the category !-Cpo of !-complete posets and !-continuous functions in the model H of Synthetic Domain Theory introduced in [8]. It follows that the !-cpos lie between the two extreme synthetic notions of domain given by repleteness and well-completeness. Introduction Synthetic Domain Theory aims at giving a few simple axioms to be added to an intuitionistic set theory in order to obtain domain-like sets. The idea at the core of this study was proposed by Dana Scott in the late 70's: domains should be certain "sets" in a mathematical universe where domain theory would be available. In particular, domains would come with intrinsic notions of approximation and passage to the limit with respect to which all functions will be continuous. Various suggestions for the notion of domain (typically within a set-theoretic universe given by an elementary topos with natural numbers object [17]) appeared in the literature, e.g. in [11, 26, 10, 23, 20, 16]. A...

