Coherence and Consistency in Domains (Extended Outline)

[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1988-07-05 DOI:10.1109/LICS.1988.5129

Carl A. Gunter, A. Jung

{"title":"Coherence and Consistency in Domains (Extended Outline)","authors":"Carl A. Gunter, A. Jung","doi":"10.1109/LICS.1988.5129","DOIUrl":null,"url":null,"abstract":"Almost all of the categories normally used as a mathematical foundation for denotational semantics satisfy a condition known as consistent completeness. The goal of this paper is to explore the possibility of using a different condition that of coherence which has its origins in topology and logic. In particular, we concentrate on those posets whose principal ideals are algebraic lattices and whose topologies are coherent. These form a cartesian closed category which has fixed points for domain equations. It is shown that a \"universal domain\" exists. Since the construction of this domain seems to be of general significance, a categorical treatment is provided and its relationship to other applications discussed. Comments University of Pennsylvania Department of Computer and Information Science Technical Report No. MSCIS-88-20. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/616 COHERENCE AND CONSISTENCY IN DOMAINS (EXTENDED OUTLINE) Carl A. Gunter Achim Jung MS-CIS-88-20 LlNC LAB 106 Department of Computer and Information Science School of Engineering and Applied Science University of Pennsylvania Philadelphia, PA 191 04","PeriodicalId":6322,"journal":{"name":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","volume":"266 1","pages":"309-317"},"PeriodicalIF":0.0000,"publicationDate":"1988-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.1988.5129","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 16

Abstract

Almost all of the categories normally used as a mathematical foundation for denotational semantics satisfy a condition known as consistent completeness. The goal of this paper is to explore the possibility of using a different condition that of coherence which has its origins in topology and logic. In particular, we concentrate on those posets whose principal ideals are algebraic lattices and whose topologies are coherent. These form a cartesian closed category which has fixed points for domain equations. It is shown that a "universal domain" exists. Since the construction of this domain seems to be of general significance, a categorical treatment is provided and its relationship to other applications discussed. Comments University of Pennsylvania Department of Computer and Information Science Technical Report No. MSCIS-88-20. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/616 COHERENCE AND CONSISTENCY IN DOMAINS (EXTENDED OUTLINE) Carl A. Gunter Achim Jung MS-CIS-88-20 LlNC LAB 106 Department of Computer and Information Science School of Engineering and Applied Science University of Pennsylvania Philadelphia, PA 191 04

查看原文本刊更多论文

领域的连贯性和一致性(扩展大纲)

几乎所有通常用作指称语义数学基础的范畴都满足一个称为一致完备性的条件。本文的目的是探讨在拓扑和逻辑中使用不同的相干条件的可能性。特别地，我们集中于那些主理想是代数格且拓扑是相干的偏序集。这就形成了一个笛卡尔闭范畴，它对域方程具有不动点。证明了“普遍域”的存在。由于该领域的构建似乎具有普遍意义，因此提供了分类处理并讨论了其与其他应用的关系。评论宾夕法尼亚大学计算机与信息科学系技术报告编号摩根士丹利资本国际(msci) - 88 - 20。本技术报告可在ScholarlyCommons获取:http://repository.upenn.edu/cis_reports/616 COHERENCE AND CONSISTENCY IN DOMAINS (EXTENDED OUTLINE) Carl A. Gunter Achim Jung MS-CIS-88-20 LlNC LAB 106计算机与信息科学系宾夕法尼亚大学费城工程与应用科学学院，PA 191 2004

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science

自引率

0.00%

发文量