Results 1 
2 of
2
An Axiomatisation of Computationally Adequate Domain Theoretic Models of FPC
, 1994
"... ..."
(Show Context)
Lifting as a KZdoctrine
 Proceedings of the 6 th International Conference, CTCS'95, volume 953 of Lecture Notes in Computer Science
, 1995
"... this paper, is the analysis of notions of approximation aiming at explaining and justifying (ordertheoretic) properties of categories of domains. For example, in [Fio94c, Fio94a], while studying the interaction between partiality and orderenrichment we considered contextual approximation which, in ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
this paper, is the analysis of notions of approximation aiming at explaining and justifying (ordertheoretic) properties of categories of domains. For example, in [Fio94c, Fio94a], while studying the interaction between partiality and orderenrichment we considered contextual approximation which, in the framework we were working in, coincided with the specialisation preorder . But in the applications carried out in [FP94, Fio94a] we had to work with an axiomatised notion of approximation, instead of the aforementioned one, for the following two reasons: first, the specialisation preorder is not appropriate in categories of domains and stable functions (see [Fio94c]) and, second, we do not know of nonordertheoretic axioms making the specialisation preorder !complete. To overcome these drawbacks another notion of approximation was to be considered. And, it was the second problem that motivated the intensional notion of approximation provided by the path relation. In fact, it is shown in [Fio94b] that under suitable axioms the path relation can be equipped with a canonical passagetothelimit operator appropriate for fixedpoint computations; stronger axioms make this operator be given by lubs of !chains