{"title":"Fully abstract denotational semantics for flat Concurrent Prolog","authors":"R. Gerth, M. Codish, Y. Lichtenstein, E. Shapiro","doi":"10.1109/LICS.1988.5130","DOIUrl":null,"url":null,"abstract":"A denotational, hence, compositional semantics for a subset of Concurrent Prolog is developed and related to an operational semantics. The denotational semantics makes divergence and the resultant substitutions of finite computations together with the termination mode-success, failure, or deadlock-observable. Relative to this notion of observation it is proved that the denotational semantics is fully abstract in the sense that it records the minimal amount of extra information beyond the observables to make it compositional. Full abstraction is an important property because it quantifies the information that one needs in order to reason about individual program-parts independently. This is believed to be the first such result in the area of concurrent logic programming.<<ETX>>","PeriodicalId":425186,"journal":{"name":"[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.1988.5130","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 31
Abstract
A denotational, hence, compositional semantics for a subset of Concurrent Prolog is developed and related to an operational semantics. The denotational semantics makes divergence and the resultant substitutions of finite computations together with the termination mode-success, failure, or deadlock-observable. Relative to this notion of observation it is proved that the denotational semantics is fully abstract in the sense that it records the minimal amount of extra information beyond the observables to make it compositional. Full abstraction is an important property because it quantifies the information that one needs in order to reason about individual program-parts independently. This is believed to be the first such result in the area of concurrent logic programming.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
![[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
扫码关注我们
