نتایج جستجو برای: fuzzy dcpo

تعداد نتایج: 89792  

Journal: :Annals of Pure and Applied Logic 2009

Journal: :Mathematical Structures in Computer Science 1996
Adrian Fiech

We establish sufficient and necessary conditions for a natural sink to be a colimit in DCPO. Based on these conditions we show how to construct a colimit for any functor F from a small category „ into the category DCPO. This demonstrates that the category DCPO is cocomplete. We also investigate under what conditions the colimit object is algebraic. 0 Introduction Colimits play an important role...

Journal: :The Journal of Logic and Algebraic Programming 2013

In this paper, some categorical properties of the category { Pre-Dcpo} of all pre-dcpos; pre-ordered sets which are also pre-directed complete, with pre-continuous maps between them is considered. In particular, we characterize products and coproducts in this category. Furthermore, we show that this category is neither complete nor cocomplete. Also, epimorphisms and monomorphisms in {Pre-Dcpo} ...

Journal: :CoRR 2012
Klaus Keimel

G. Plotkin and the author [13] have worked out the equivalence between state transformer semantics and predicate transformer semantics in a domain theoretical setting for programs combining nondeterminism and probability. Works of C. Morgan and co-authors [20], Keimel, Rosenbusch and Streicher [14, 15], already go in the same direction using only discrete state spaces. In fact, Keimel and Plotk...

2018
Wolfgang Thron

Given a poset P , the set Γ(P ) of all Scott closed sets ordered by inclusion forms a complete lattice. A subcategory C of Posd (the category of posets and Scott-continuous maps) is said to be Γ-faithful if for any posets P and Q in C, Γ(P ) ∼= Γ(Q) implies P ∼= Q. It is known that the category of all continuous dcpos and the category of bounded complete dcpos are Γ-faithful, while Posd is not....

Journal: :Logical Methods in Computer Science 2018
Weng Kin Ho Jean Goubault-Larrecq Achim Jung Xiaoyong Xi

Given a poset P , the set, Γ(P), of all Scott closed sets ordered by inclusion forms a complete lattice. A subcategory C of Pos d (the category of posets and Scott-continuous maps) is said to be Γ-faithful if for any posets P and Q in C, Γ(P) ∼ = Γ(Q) implies P ∼ = Q. It is known that the category of all continuous dcpos and the category of bounded complete dcpos are Γ-faithful, while Pos d is ...

Journal: :Mathematical Structures in Computer Science 2004
Keye Martin

We show that a measurement μ on a continuous dcpo D extends to a measurement μ̄ on the convex powerdomain CD iff it is a Lebesgue measurement. In particular, kerμ must be metrizable in its relative Scott topology. Moreover, the space ker μ̄ in its relative Scott topology is homeomorphic to the Vietoris hyperspace of kerμ, i.e., the space of nonempty compact subsets of kerμ in its Vietoris topolog...

2017
Bert Lindenhovius Michael Mislove Vladimir Zamdzhiev

Rios and Selinger have recently proposed a categorical model for the quantum programming language Proto-Quipper-M, which is an important fragment of the Quipper language. In this work, we describe an extension to their categorical model with the additional property that it is DCPOenriched, bringing us closer to modeling general recursion in the language. Similar to their model, our model exhibi...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید