找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Domain Theory, Logic and Computation; Proceedings of the 2 G Q Zhang,J. Lawson,M.-K. Luo Conference proceedings 2003 Springer Science+Busin

[复制链接]
查看: 8806|回复: 45
发表于 2025-3-21 16:53:38 | 显示全部楼层 |阅读模式
书目名称Domain Theory, Logic and Computation
副标题Proceedings of the 2
编辑G Q Zhang,J. Lawson,M.-K. Luo
视频video
丛书名称Semantics Structures in Computation
图书封面Titlebook: Domain Theory, Logic and Computation; Proceedings of the 2 G Q Zhang,J. Lawson,M.-K. Luo Conference proceedings 2003 Springer Science+Busin
描述Domains are mathematical structures for information and approximation; they combine order-theoretic, logical, and topological ideas and provide a natural framework for modelling and reasoning about computation. The theory of domains has proved to be a useful tool for programming languages and other areas of computer science, and for applications in mathematics. .Included in this proceedings volume are selected papers of original research presented at the 2nd International Symposium on Domain Theory in Chengdu, China. With authors from France, Germany, Great Britain, Ireland, Mexico, and China, the papers cover the latest research in these sub-areas: domains and computation, topology and convergence, domains, lattices, and continuity, and representations of domains as event and logical structures. .Researchers and students in theoretical computer science should find this a valuable source of reference. The survey papers at the beginning should be of particular interest to those who wish to gain an understanding of some general ideas and techniques in this area.
出版日期Conference proceedings 2003
关键词Area; Congruence; Lattice; Mathematica; Natural; Volume; algorithms; data structures; logic; programming lang
版次1
doihttps://doi.org/10.1007/978-94-017-1291-0
isbn_softcover978-90-481-6523-0
isbn_ebook978-94-017-1291-0
copyrightSpringer Science+Business Media Dordrecht 2003
The information of publication is updating

书目名称Domain Theory, Logic and Computation影响因子(影响力)




书目名称Domain Theory, Logic and Computation影响因子(影响力)学科排名




书目名称Domain Theory, Logic and Computation网络公开度




书目名称Domain Theory, Logic and Computation网络公开度学科排名




书目名称Domain Theory, Logic and Computation被引频次




书目名称Domain Theory, Logic and Computation被引频次学科排名




书目名称Domain Theory, Logic and Computation年度引用




书目名称Domain Theory, Logic and Computation年度引用学科排名




书目名称Domain Theory, Logic and Computation读者反馈




书目名称Domain Theory, Logic and Computation读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:40:02 | 显示全部楼层
发表于 2025-3-22 02:49:08 | 显示全部楼层
发表于 2025-3-22 05:47:59 | 显示全部楼层
发表于 2025-3-22 11:04:32 | 显示全部楼层
External Characterizations of Continuous sL-domains,po . is a continuous sL-domain if and only if [. → .] is a continuous dcpo (resp: sL-domain) for all compact and core compact spaces .. This characterization solves Problem 532 posed by J. D. Lawson and M. W. Mislove in the book [J. Van Mill, G. M. Reed (Editors), Open Problems in Topology, Elsevier
发表于 2025-3-22 16:10:51 | 显示全部楼层
发表于 2025-3-22 18:05:35 | 显示全部楼层
On Minimal Event and Concrete Data Structures,n equivalence relations on the prime intervals of the domains we can associate different event structures and cds to a given domain, respectively. By introducing reductions we show the existence of a greatest event structure and cds as well as of minimal event structures and cds generating a given e
发表于 2025-3-22 21:55:07 | 显示全部楼层
A Note on Strongly Finite Sequent Structures,tion by demanding the existence of a distinguished element with the properties of a tautology. This is no restriction compared with Zhang’s approach, but has several advantages. Moreover, we show that the entailment relation of every strongly finite sequent structure can be derived from a preorder.
发表于 2025-3-23 04:14:32 | 显示全部楼层
Joakim Holmlund,Björn Nilsson,Johan Rönnbynd a dcpo . is meet-continuous when . or it is a semilattice with a .-topology, where . denote the topology generated by all the Scott-open filters of .. Moreover, under appropriate conditions, the category of dcpos with .-topology form a cartesian closed category.
发表于 2025-3-23 06:35:07 | 显示全部楼层
On Meet-Continuous Dcpos,nd a dcpo . is meet-continuous when . or it is a semilattice with a .-topology, where . denote the topology generated by all the Scott-open filters of .. Moreover, under appropriate conditions, the category of dcpos with .-topology form a cartesian closed category.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-19 00:44
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表