发布求助
文献互助 智能选刊 最新文献

Software Science and Engineering最新文献

筛选
英文 中文
On Operational Semantics of Congruence Relation Defined in Algebraic Language ASL/ 代数语言ASL/中同余关系的操作语义
Software Science and Engineering Pub Date : 1988-04-01 DOI: 10.1142/9789814360128_0004
H. Seki, K. Taniguchi, T. Kasami
{"title":"On Operational Semantics of Congruence Relation Defined in Algebraic Language ASL/","authors":"H. Seki, K. Taniguchi, T. Kasami","doi":"10.1142/9789814360128_0004","DOIUrl":"https://doi.org/10.1142/9789814360128_0004","url":null,"abstract":"An algebraic specification (or text) specifies a congruence relation on a set of expressions. In algebraic language $ASL/*$ , a pair $(G, AX)$ is called a text, where $G$ is a context-free grammar and $AX$ is a set of axioms. A text $t=(G, AX)$ specifies the set $E_{G}$ of expressions generated by $G$ and the least congruence relation on $E_{G}$ satisfying all the axioms in $AX$ , where ‘congruency’ is defined based on the syntax (phrase structure) of the expressions. In general, for a text $t$ in $ASL/*$ , the condition, (A) $e$ is congruent with $e’$ in $t$ , is not logically equivalent to the condition, (B) $e’$ is obtained from $e$ by rewriting $e$ when the axioms in $t$ are regarded as ‘bidirectional‘ rewrite rules. We present a sufficient condition for a text $t$ under which (A) and (B) are equivalent for any pair of expressions $e$ and $e’$ , which means that the congruence relation specified by $t$ is simply defined operationally.","PeriodicalId":313959,"journal":{"name":"Software Science and Engineering","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122086117","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}
引用次数: 0
Metis: A Term Rewriting System Generator: An Inference Engine for Equations and Inequations 一个术语重写系统生成器:一个方程和不等式的推理引擎
Software Science and Engineering Pub Date : 1987-04-01 DOI: 10.1142/9789814360128_0001
Akihiko Ohsuga, K. Sakai
{"title":"Metis: A Term Rewriting System Generator: An Inference Engine for Equations and Inequations","authors":"Akihiko Ohsuga, K. Sakai","doi":"10.1142/9789814360128_0001","DOIUrl":"https://doi.org/10.1142/9789814360128_0001","url":null,"abstract":"The TRS (term rewriting system) Working Group of ICOT has been studying applications of TRSs to the intelligent programming system. As a result, we have implemented a TRS generator called Metis, an experimental tool with the many functions required for such a system. This paper describes the features of Metis and several experiments with it.","PeriodicalId":313959,"journal":{"name":"Software Science and Engineering","volume":"22 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121670668","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}
引用次数: 5
Dataflow Computing Mechanism For Logic Program and Extraction of Functional from It 逻辑程序的数据流计算机制及其函数提取
Software Science and Engineering Pub Date : 1900-01-01 DOI: 10.1142/9789814360128_0005
S. Yamasaki
{"title":"Dataflow Computing Mechanism For Logic Program and Extraction of Functional from It","authors":"S. Yamasaki","doi":"10.1142/9789814360128_0005","DOIUrl":"https://doi.org/10.1142/9789814360128_0005","url":null,"abstract":"","PeriodicalId":313959,"journal":{"name":"Software Science and Engineering","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123283876","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}
引用次数: 0
Distributed Garbage Collection Using Group Reference Counting 使用组引用计数的分布式垃圾收集
Software Science and Engineering Pub Date : 1900-01-01 DOI: 10.1142/9789814360128_0011
Yuuji Ichisugi, A. Yonezawa
{"title":"Distributed Garbage Collection Using Group Reference Counting","authors":"Yuuji Ichisugi, A. Yonezawa","doi":"10.1142/9789814360128_0011","DOIUrl":"https://doi.org/10.1142/9789814360128_0011","url":null,"abstract":"","PeriodicalId":313959,"journal":{"name":"Software Science and Engineering","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124480402","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}
引用次数: 13
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信