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

Colloquium on Trees in Algebra and Programming最新文献

筛选
英文 中文
Termination by Absence of Infinite Chains of Dependency Pairs 依赖对无穷链不存在的终止
Colloquium on Trees in Algebra and Programming Pub Date : 1996-04-22 DOI: 10.1007/3-540-61064-2_38
T. Arts
{"title":"Termination by Absence of Infinite Chains of Dependency Pairs","authors":"T. Arts","doi":"10.1007/3-540-61064-2_38","DOIUrl":"https://doi.org/10.1007/3-540-61064-2_38","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115413046","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}
引用次数: 12
Behavioural Satisfaction and Equivalence in Concrete Model Categories 具体模型类别中的行为满意与等价
Colloquium on Trees in Algebra and Programming Pub Date : 1996-04-22 DOI: 10.1007/3-540-61064-2_41
M. Bidoit, A. Tarlecki
{"title":"Behavioural Satisfaction and Equivalence in Concrete Model Categories","authors":"M. Bidoit, A. Tarlecki","doi":"10.1007/3-540-61064-2_41","DOIUrl":"https://doi.org/10.1007/3-540-61064-2_41","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"180 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121309996","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}
引用次数: 36
Subsumption Algorithms Based on Search Trees 基于搜索树的包容算法
Colloquium on Trees in Algebra and Programming Pub Date : 1996-04-22 DOI: 10.1007/3-540-61064-2_34
L. Bachmair, Ta Chen, C. Ramakrishnan, I. Ramakrishnan
{"title":"Subsumption Algorithms Based on Search Trees","authors":"L. Bachmair, Ta Chen, C. Ramakrishnan, I. Ramakrishnan","doi":"10.1007/3-540-61064-2_34","DOIUrl":"https://doi.org/10.1007/3-540-61064-2_34","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129409096","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
Final Semantics for a Higher Order Concurrent Language 一种高阶并发语言的最终语义
Colloquium on Trees in Algebra and Programming Pub Date : 1996-04-22 DOI: 10.1007/3-540-61064-2_32
Marina Lenisa
{"title":"Final Semantics for a Higher Order Concurrent Language","authors":"Marina Lenisa","doi":"10.1007/3-540-61064-2_32","DOIUrl":"https://doi.org/10.1007/3-540-61064-2_32","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132869034","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}
引用次数: 23
Confluence without Termination via Parallel Critical Pairs 通过平行临界对无终止的合流
Colloquium on Trees in Algebra and Programming Pub Date : 1996-04-22 DOI: 10.1007/3-540-61064-2_39
B. Gramlich
{"title":"Confluence without Termination via Parallel Critical Pairs","authors":"B. Gramlich","doi":"10.1007/3-540-61064-2_39","DOIUrl":"https://doi.org/10.1007/3-540-61064-2_39","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132244074","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}
引用次数: 31
Extraction of Concurrent Processes from Higher Dimensional Automata 高维自动机并发过程的提取
Colloquium on Trees in Algebra and Programming Pub Date : 1996-04-22 DOI: 10.1007/3-540-61064-2_30
Yukihide Takayama
{"title":"Extraction of Concurrent Processes from Higher Dimensional Automata","authors":"Yukihide Takayama","doi":"10.1007/3-540-61064-2_30","DOIUrl":"https://doi.org/10.1007/3-540-61064-2_30","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115599843","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
The Practice of Logical Frameworks 逻辑框架的实践
Colloquium on Trees in Algebra and Programming Pub Date : 1996-04-22 DOI: 10.1007/3-540-61064-2_33
F. Pfenning
{"title":"The Practice of Logical Frameworks","authors":"F. Pfenning","doi":"10.1007/3-540-61064-2_33","DOIUrl":"https://doi.org/10.1007/3-540-61064-2_33","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124555026","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}
引用次数: 54
Iterative Pairs and Multitape Automata 迭代对与多磁带自动机
Colloquium on Trees in Algebra and Programming Pub Date : 1996-04-22 DOI: 10.1007/3-540-61064-2_26
Maria Madonia, S. Varricchio
{"title":"Iterative Pairs and Multitape Automata","authors":"Maria Madonia, S. Varricchio","doi":"10.1007/3-540-61064-2_26","DOIUrl":"https://doi.org/10.1007/3-540-61064-2_26","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123002902","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}
引用次数: 1
Denotational, Causal, and Operational Determinism in Event Structures 事件结构中的指称决定论、因果决定论和操作决定论
Colloquium on Trees in Algebra and Programming Pub Date : 1995-09-01 DOI: 10.1007/3-540-61064-2_43
A. Rensink
{"title":"Denotational, Causal, and Operational Determinism in Event Structures","authors":"A. Rensink","doi":"10.1007/3-540-61064-2_43","DOIUrl":"https://doi.org/10.1007/3-540-61064-2_43","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"180 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122083106","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
A Pumping Lemma for Output Languages of Macro Tree Transducers 宏树换能器输出语言的抽运引理
Colloquium on Trees in Algebra and Programming Pub Date : 1995-08-01 DOI: 10.1007/3-540-61064-2_28
Armin Kühnemann
{"title":"A Pumping Lemma for Output Languages of Macro Tree Transducers","authors":"Armin Kühnemann","doi":"10.1007/3-540-61064-2_28","DOIUrl":"https://doi.org/10.1007/3-540-61064-2_28","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132794020","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}
引用次数: 4
首页 上一页 下一页 尾页
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学术官方微信