[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science最新文献_第7页

Monadic second-order logic and hypergraph orientation 一元二阶逻辑和超图取向

[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1993-06-19 DOI: 10.1109/LICS.1993.287589

B. Courcelle

引用次数: 3

Database query languages embedded in the typed lambda calculus 数据库查询语言嵌入在类型化lambda演算中

[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1993-06-19 DOI: 10.1109/LICS.1993.287575

Gerd G. Hillebrand, P. Kanellakis, Harry G. Mairson

引用次数: 33

A Compositional Proof System for Dynamic Process Creation 动态过程创建的组合证明系统

[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1991-07-15 DOI: 10.1109/LICS.1991.151663

F. S. Boer

引用次数: 7

0-1 Laws for Infinitary Logics (Preliminary Report) 无穷逻辑的0-1定律(初步报告)

[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1990-01-01 DOI: 10.1109/LICS.1990.113742

Phokion G. Kolaitis, Moshe Y. Vardi

引用次数: 2

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":"https://doi.org/10.1109/LICS.1988.5129","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.0,"publicationDate":"1988-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76774881","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 16

Combining Algebra and Higher-Order Types 代数与高阶类型的组合

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

V. Tannen

{"title":"Combining Algebra and Higher-Order Types","authors":"V. Tannen","doi":"10.1109/LICS.1988.5103","DOIUrl":"https://doi.org/10.1109/LICS.1988.5103","url":null,"abstract":"We study the higher-order rewrite/equational proof systems obtained by adding the simply typed lambda calculus to algebraic rewrite/equational proof systems. We show that if a many-sorted algebraic rewrite system has the Church-Rosser property, then the corresponding higher-order rewrite system which adds simply typed s-reduction has the Church-Rosser property too. This result is relevant to parallel implementations of functional programming languages. We also show that provability in the higher-order equational proof system obtained by adding the simply typed s and η axioms to some many-sorted algebraic proof system is effectively reducible to provability in that algebraic proof system. This effective reduction also establishes transformations between higher-order and algebraic equational proofs, transformations which can be useful in automated deduction. Comments University of Pennsylvania Department of Computer and Information Science Technical Report No. MSCIS-88-21. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/617 COMBINING ALGEBRA AND HIGHER-ORDER TYPES Val Breazu-Tannen MS-CIS-88-21 LlNC LAB 107 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":"156 2","pages":"82-90"},"PeriodicalIF":0.0,"publicationDate":"1988-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91450187","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 17