標題: Titlebook: Domains and Processes; Proceedings of the 1 Klaus Keimel,Guo-Qiang Zhang,Yi-Xang Chen Conference proceedings 2001 Kluwer Academic Publisher [打印本頁] 作者: Awkward 時間: 2025-3-21 16:53
書目名稱Domains and Processes影響因子(影響力)
書目名稱Domains and Processes影響因子(影響力)學科排名
書目名稱Domains and Processes網(wǎng)絡公開度
書目名稱Domains and Processes網(wǎng)絡公開度學科排名
書目名稱Domains and Processes被引頻次
書目名稱Domains and Processes被引頻次學科排名
書目名稱Domains and Processes年度引用
書目名稱Domains and Processes年度引用學科排名
書目名稱Domains and Processes讀者反饋
書目名稱Domains and Processes讀者反饋學科排名
作者: Commonplace 時間: 2025-3-21 20:28 作者: encomiast 時間: 2025-3-22 00:28
https://doi.org/10.1007/978-3-322-82006-8definitions of strong ground bisimilarity and strong asynchronous ground bisimilarity closure under substitution is not explicitly required. Based upon this fact complete systems are given for both relations. The axiomatic systems are novel in that they use none of the prefix, choice and match combi作者: 替代品 時間: 2025-3-22 05:50
On The Equivalence of Some Approaches to Computability on the Real Line,nd/or the function has a computable extension to this domain..For defining the semantics of the language Real. PCF a full subcategory of the category of bounded-complete ω-continuous directed complete partial orders is introduced and it is defined when a domain in this category is effectively given.作者: 糾纏 時間: 2025-3-22 12:22
Semantics of Logic Programs and Representation of Smyth Powerdomain, or nondeterministic information systems. We show that the hyperresolution rule is sound and complete for sequent structures as well, making it possible to interpret a disjunctive logic program directly as a sequent structure.作者: 斷言 時間: 2025-3-22 15:28
Axiomatization Without Prefix Combinator,definitions of strong ground bisimilarity and strong asynchronous ground bisimilarity closure under substitution is not explicitly required. Based upon this fact complete systems are given for both relations. The axiomatic systems are novel in that they use none of the prefix, choice and match combi作者: 斷言 時間: 2025-3-22 18:13 作者: 背心 時間: 2025-3-22 22:08 作者: 束縛 時間: 2025-3-23 01:43
Encounters Between Topology and Domain Theory,c power domain The article attempts to develop the thesis that topological tools are useful for the investigation of order-theoretic structures arising in theoretical computer science and the latter in turn suggest new research directions in topology.作者: Chipmunk 時間: 2025-3-23 09:17
The Continuous Functionals of Finite Types Over the Reals, and that our construction is equivalent to the analogue construction in the category of limit spaces..In order to obtain this we will consider a restricted function space construction. We then show that this restriction, up to equivalence, does not restrict the class of total objects.作者: Perceive 時間: 2025-3-23 11:54 作者: 扔掉掐死你 時間: 2025-3-23 17:28 作者: 懶惰民族 時間: 2025-3-23 21:47
https://doi.org/10.1007/978-3-322-81147-9lt of this paper is that the category of FS domains (resp., F-FS domains) is the largest . full subcategory of the category of pointed continuous dcpo’s (resp., continuous dcpo’s), where a continuous dcpo . is a F-FS domain iff . is a finite amalgam of FS domains.作者: 惡名聲 時間: 2025-3-23 23:28
The Largest Topologically Cartesian Closed Categories of Domains as Topological Spaces,lt of this paper is that the category of FS domains (resp., F-FS domains) is the largest . full subcategory of the category of pointed continuous dcpo’s (resp., continuous dcpo’s), where a continuous dcpo . is a F-FS domain iff . is a finite amalgam of FS domains.作者: BLA 時間: 2025-3-24 05:38 作者: obviate 時間: 2025-3-24 09:56 作者: triptans 時間: 2025-3-24 12:34
Fallstudie 1: Chemie AG, Bereich Naturstoffe and that our construction is equivalent to the analogue construction in the category of limit spaces..In order to obtain this we will consider a restricted function space construction. We then show that this restriction, up to equivalence, does not restrict the class of total objects.作者: Decrepit 時間: 2025-3-24 17:59 作者: 侵害 時間: 2025-3-24 22:38
neue betriebswirtschaftliche forschung (nbf)also discussed, and five t-laws are given to lift the symbolic proof system for strong open bisimulation to a complete inference system for open observation congruence in the π-calculus with mismatching.作者: 可互換 時間: 2025-3-25 02:45
,Semantic Theory and Proof System of Open Bisimulation for the π-Calculus with Mismatching,also discussed, and five t-laws are given to lift the symbolic proof system for strong open bisimulation to a complete inference system for open observation congruence in the π-calculus with mismatching.作者: ANA 時間: 2025-3-25 06:26
Encounters Between Topology and Domain Theory,opics highlighted include locally compact spaces, spectral theory, round-ideal completions, ordered spaces, maximal-point spaces, and the probabilistic power domain The article attempts to develop the thesis that topological tools are useful for the investigation of order-theoretic structures arisin作者: 做事過頭 時間: 2025-3-25 07:58
U,-Admitting DCPOS Need not be Sober,. implies .?. for some . ? .. In this note, we construct an example of a ..-admitting dcpo which is not sober, thus giving a negative answer to an open problem posed by Heckmann in 1991. Moreover, we prove that for every locally compact dcpo, ..-admitting is equivalent to sober.作者: genesis 時間: 2025-3-25 12:03 作者: pericardium 時間: 2025-3-25 19:01
On The Equivalence of Some Approaches to Computability on the Real Line,research concentrates either on an application of Weihrauch’s Type Two Theory of Effectivity or on domain-theoretic approaches, in which case the partial objects appearing during computations are made explicit. A further, more analysis-oriented line of research is based on Grzegorczyk’s work. All th作者: Extort 時間: 2025-3-25 20:25
The Continuous Functionals of Finite Types Over the Reals,d the boolean values, under cartesian products and restricted function spaces. We show that the total objects will be dense in the respective domains, and that our construction is equivalent to the analogue construction in the category of limit spaces..In order to obtain this we will consider a rest作者: Mobile 時間: 2025-3-26 00:56
Normal Subsets in Abstract Bases,, the problem of definition and characterization of sub-domains in the category of continuous domains will be discussed. Then a dcpo class of abstract bases will be introduced and a fixed point theorem of continuous mappings on the class will be addressed. Finally, connections with other approaches 作者: Mettle 時間: 2025-3-26 05:44 作者: Parabola 時間: 2025-3-26 12:31 作者: depreciate 時間: 2025-3-26 16:17 作者: frivolous 時間: 2025-3-26 20:45
Axiomatization Without Prefix Combinator,concurrent computation without the use of prefix combinator. The atomic chi calculus studied in this paper is obtained from polyadic chi calculus by leaving out the prefix operator. This omission is impossible in the pi framework because it would render the input actions of pi useless. This paper fo作者: 母豬 時間: 2025-3-26 22:04
U,-Admitting DCPOS Need not be Sober,. implies .?. for some . ? .. In this note, we construct an example of a ..-admitting dcpo which is not sober, thus giving a negative answer to an open problem posed by Heckmann in 1991. Moreover, we prove that for every locally compact dcpo, ..-admitting is equivalent to sober.作者: 粗語 時間: 2025-3-27 03:22
Normal Subsets in Abstract Bases,, the problem of definition and characterization of sub-domains in the category of continuous domains will be discussed. Then a dcpo class of abstract bases will be introduced and a fixed point theorem of continuous mappings on the class will be addressed. Finally, connections with other approaches to domain equations will be discussed briefly.作者: Audiometry 時間: 2025-3-27 05:26 作者: 虛弱 時間: 2025-3-27 12:00
https://doi.org/10.1007/978-3-322-81404-3In this paper continuity for abstract semantics defined for lattices is generalized to the case of bc-domains, an equivalent characterization for semantics being continuous is given. Relation between continuity and compactness is given. Finally, application to fuzzy logic is discussed.作者: 俗艷 時間: 2025-3-27 14:32
The Lawson Topology on Quasicontinuous Domains,For a directed complete poset ., let λ(.) and σ(.) be the lower topology and the Lawson topology on . respectively. We constructively prove that if . is a quasicontinuous domain and all lower closed subsets in (., λ(.)) are closed in (., ω(.)),then (.,λ(P)) is strictly completely regular ordered space.作者: invade 時間: 2025-3-27 20:01
Compact Semantics on BC-Domains,In this paper continuity for abstract semantics defined for lattices is generalized to the case of bc-domains, an equivalent characterization for semantics being continuous is given. Relation between continuity and compactness is given. Finally, application to fuzzy logic is discussed.作者: caldron 時間: 2025-3-28 01:12
https://doi.org/10.1007/978-94-010-0654-5C programming language; Equivalence; computability; logic; proof; semantics作者: Facet-Joints 時間: 2025-3-28 03:33 作者: nerve-sparing 時間: 2025-3-28 07:53 作者: Priapism 時間: 2025-3-28 14:25 作者: Hemiparesis 時間: 2025-3-28 15:08
https://doi.org/10.1007/978-3-322-80796-0opics highlighted include locally compact spaces, spectral theory, round-ideal completions, ordered spaces, maximal-point spaces, and the probabilistic power domain The article attempts to develop the thesis that topological tools are useful for the investigation of order-theoretic structures arisin作者: 剝削 時間: 2025-3-28 21:51
Entwicklung von Kooperationsnetzwerken. implies .?. for some . ? .. In this note, we construct an example of a ..-admitting dcpo which is not sober, thus giving a negative answer to an open problem posed by Heckmann in 1991. Moreover, we prove that for every locally compact dcpo, ..-admitting is equivalent to sober.作者: 倔強不能 時間: 2025-3-29 00:25
https://doi.org/10.1007/978-3-322-81147-9ogical products and function spaces equipped with the Isbell topology. We prove that a full subcategory of . is . if and only if it is cartesian closed (by means of category) and the Isbell topology of function spaces coincides with the Scott topology (this is why we use the notion“.”).The main resu作者: 使尷尬 時間: 2025-3-29 03:32 作者: 設施 時間: 2025-3-29 07:37
Fallstudie 1: Chemie AG, Bereich Naturstoffed the boolean values, under cartesian products and restricted function spaces. We show that the total objects will be dense in the respective domains, and that our construction is equivalent to the analogue construction in the category of limit spaces..In order to obtain this we will consider a rest作者: cancellous-bone 時間: 2025-3-29 15:11 作者: PIZZA 時間: 2025-3-29 15:52 作者: 物質 時間: 2025-3-29 22:15 作者: rectocele 時間: 2025-3-30 01:15
neue betriebswirtschaftliche forschung (nbf)r, we give a full solution to this problem. First a reasonable definition of open bisimulation is presented and its equivalence and congruence are established. Then a symbolic version of open bisimulation is introduced and its soundness and completeness with respect to open bisimulation are proved. 作者: 漂泊 時間: 2025-3-30 06:53
