Colloquium on Trees in Algebra and Programming最新文献

筛选
英文 中文
Grammar-Based Data-Flow Analysis to Stop Deforestation 基于语法的数据流分析阻止森林砍伐
Colloquium on Trees in Algebra and Programming Pub Date : 1994-04-11 DOI: 10.1007/BFb0017492
M. Sørensen
{"title":"Grammar-Based Data-Flow Analysis to Stop Deforestation","authors":"M. Sørensen","doi":"10.1007/BFb0017492","DOIUrl":"https://doi.org/10.1007/BFb0017492","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123006213","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}
引用次数: 35
Compilative Constructive Negation in Constraint Logic Programs 约束逻辑程序中的编译建构否定
Colloquium on Trees in Algebra and Programming Pub Date : 1994-04-11 DOI: 10.1007/BFb0017473
P. Bruscoli, Francesca Levi, G. Levi, M. Meo
{"title":"Compilative Constructive Negation in Constraint Logic Programs","authors":"P. Bruscoli, Francesca Levi, G. Levi, M. Meo","doi":"10.1007/BFb0017473","DOIUrl":"https://doi.org/10.1007/BFb0017473","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127047838","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}
引用次数: 28
A Lower Bound on the Growth of Functions Computed by Tree Transductions 由树转导计算的函数生长的下界
Colloquium on Trees in Algebra and Programming Pub Date : 1994-04-11 DOI: 10.1007/BFb0017476
F. Drewes
{"title":"A Lower Bound on the Growth of Functions Computed by Tree Transductions","authors":"F. Drewes","doi":"10.1007/BFb0017476","DOIUrl":"https://doi.org/10.1007/BFb0017476","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114676095","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}
引用次数: 6
Generalizations of the Periodicity Theorem of Fine and Wilf Fine和Wilf的周期性定理的推广
Colloquium on Trees in Algebra and Programming Pub Date : 1994-04-11 DOI: 10.1007/BFb0017478
R. Giancarlo, F. Mignosi
{"title":"Generalizations of the Periodicity Theorem of Fine and Wilf","authors":"R. Giancarlo, F. Mignosi","doi":"10.1007/BFb0017478","DOIUrl":"https://doi.org/10.1007/BFb0017478","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121334485","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}
引用次数: 22
Graph Grammars and Tree Transducers 图语法和树转换器
Colloquium on Trees in Algebra and Programming Pub Date : 1994-04-11 DOI: 10.1007/BFb0017471
J. Engelfriet
{"title":"Graph Grammars and Tree Transducers","authors":"J. Engelfriet","doi":"10.1007/BFb0017471","DOIUrl":"https://doi.org/10.1007/BFb0017471","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127282902","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}
引用次数: 39
A Rank Hierarchy for Determinsitic Tree-Walking Transducers 确定性树行换能器的秩层次结构
Colloquium on Trees in Algebra and Programming Pub Date : 1994-04-11 DOI: 10.1007/BFb0017490
Owen Rambow, G. Satta
{"title":"A Rank Hierarchy for Determinsitic Tree-Walking Transducers","authors":"Owen Rambow, G. Satta","doi":"10.1007/BFb0017490","DOIUrl":"https://doi.org/10.1007/BFb0017490","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114683340","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}
引用次数: 3
Graphs and Decidable Transductions Based on Edge Constraints (Extended Abstract) 基于边缘约束的图和可判定转导(扩展摘要)
Colloquium on Trees in Algebra and Programming Pub Date : 1994-04-11 DOI: 10.1007/BFb0017482
Nils Klarlund, M. I. Schwartzbach
{"title":"Graphs and Decidable Transductions Based on Edge Constraints (Extended Abstract)","authors":"Nils Klarlund, M. I. Schwartzbach","doi":"10.1007/BFb0017482","DOIUrl":"https://doi.org/10.1007/BFb0017482","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128238019","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}
引用次数: 6
On the Modularity of Confluence of Constructor-Sharing Term Rewriting Systems 构造者共享术语改写系统合流的模块化研究
Colloquium on Trees in Algebra and Programming Pub Date : 1994-04-11 DOI: 10.1007/BFb0017487
Enno Ohlebusch
{"title":"On the Modularity of Confluence of Constructor-Sharing Term Rewriting Systems","authors":"Enno Ohlebusch","doi":"10.1007/BFb0017487","DOIUrl":"https://doi.org/10.1007/BFb0017487","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133405799","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}
引用次数: 26
A New Linear Algorithm for Modular Decomposition 一种新的线性模分解算法
Colloquium on Trees in Algebra and Programming Pub Date : 1994-04-11 DOI: 10.1007/BFb0017474
Alain Cournier, M. Habib
{"title":"A New Linear Algorithm for Modular Decomposition","authors":"Alain Cournier, M. Habib","doi":"10.1007/BFb0017474","DOIUrl":"https://doi.org/10.1007/BFb0017474","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130340631","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}
引用次数: 236
Flobal Program Analysis in Constraint Form 约束形式的全局规划分析
Colloquium on Trees in Algebra and Programming Pub Date : 1994-04-11 DOI: 10.1007/BFb0017488
J. Palsberg
{"title":"Flobal Program Analysis in Constraint Form","authors":"J. Palsberg","doi":"10.1007/BFb0017488","DOIUrl":"https://doi.org/10.1007/BFb0017488","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"33 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134542154","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}
引用次数: 21
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学术官方微信