Colloquium on Trees in Algebra and Programming最新文献

筛选
英文 中文
Petri Nets as Models of Linear Logic Petri网作为线性逻辑模型
Colloquium on Trees in Algebra and Programming Pub Date : 1990-02-01 DOI: 10.1007/3-540-52590-4_46
Uffe Engberg, G. Winskel
{"title":"Petri Nets as Models of Linear Logic","authors":"Uffe Engberg, G. Winskel","doi":"10.1007/3-540-52590-4_46","DOIUrl":"https://doi.org/10.1007/3-540-52590-4_46","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132018839","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}
引用次数: 75
Infinite Values in Hierarchical Imperative Types 层次命令式类型中的无限值
Colloquium on Trees in Algebra and Programming Pub Date : 1989-09-01 DOI: 10.1007/3-540-52590-4_53
M. I. Schwartzbach
{"title":"Infinite Values in Hierarchical Imperative Types","authors":"M. I. Schwartzbach","doi":"10.1007/3-540-52590-4_53","DOIUrl":"https://doi.org/10.1007/3-540-52590-4_53","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114922427","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
Analysis of Dynamic Algorithms in D. E. Knuth's Model D. E. Knuth模型中的动态算法分析
Colloquium on Trees in Algebra and Programming Pub Date : 1988-03-21 DOI: 10.1007/BFb0026097
J. Françon, B. Randrianarimanana, R. Schott
{"title":"Analysis of Dynamic Algorithms in D. E. Knuth's Model","authors":"J. Françon, B. Randrianarimanana, R. Schott","doi":"10.1007/BFb0026097","DOIUrl":"https://doi.org/10.1007/BFb0026097","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121321385","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}
引用次数: 9
Regular Automata and Model Checking 常规自动机和模型检查
Colloquium on Trees in Algebra and Programming Pub Date : 1988-03-21 DOI: 10.1007/BFb0026107
Zdzislaw Habasinski
{"title":"Regular Automata and Model Checking","authors":"Zdzislaw Habasinski","doi":"10.1007/BFb0026107","DOIUrl":"https://doi.org/10.1007/BFb0026107","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129780881","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
Parameter-Reduction of Higher Level Grammars (Extended Abstract) 高级语法的参数约简(扩展摘要)
Colloquium on Trees in Algebra and Programming Pub Date : 1988-03-21 DOI: 10.1007/BFb0026096
H. Seidl
{"title":"Parameter-Reduction of Higher Level Grammars (Extended Abstract)","authors":"H. Seidl","doi":"10.1007/BFb0026096","DOIUrl":"https://doi.org/10.1007/BFb0026096","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123167501","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
Proving Systolic Arrays 证明收缩期数组
Colloquium on Trees in Algebra and Programming Pub Date : 1988-03-21 DOI: 10.1007/BFb0026104
E. P. Gribomont
{"title":"Proving Systolic Arrays","authors":"E. P. Gribomont","doi":"10.1007/BFb0026104","DOIUrl":"https://doi.org/10.1007/BFb0026104","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128965718","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
Unification in Primal Algebras 原始代数中的统一
Colloquium on Trees in Algebra and Programming Pub Date : 1988-03-21 DOI: 10.1007/BFb0026100
T. Nipkow
{"title":"Unification in Primal Algebras","authors":"T. Nipkow","doi":"10.1007/BFb0026100","DOIUrl":"https://doi.org/10.1007/BFb0026100","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"PP 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126684510","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}
引用次数: 9
On the Maximum Path Length of AVL Trees 论AVL树的最大路径长度
Colloquium on Trees in Algebra and Programming Pub Date : 1988-03-21 DOI: 10.1007/BFb0026093
R. Klein, D. Wood
{"title":"On the Maximum Path Length of AVL Trees","authors":"R. Klein, D. Wood","doi":"10.1007/BFb0026093","DOIUrl":"https://doi.org/10.1007/BFb0026093","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"227 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120940611","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}
引用次数: 7
A²CCS: A Simple Extension of CCS for Handling Atomic Actions CCS:用于处理原子动作的CCS的简单扩展
Colloquium on Trees in Algebra and Programming Pub Date : 1988-03-21 DOI: 10.1007/BFb0026109
R. Gorrieri, Sergio Marchetti, U. Montanari
{"title":"A²CCS: A Simple Extension of CCS for Handling Atomic Actions","authors":"R. Gorrieri, Sergio Marchetti, U. Montanari","doi":"10.1007/BFb0026109","DOIUrl":"https://doi.org/10.1007/BFb0026109","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121833527","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}
引用次数: 9
On Comleteness of Narrowing Strategies 论缩小策略的完全性
Colloquium on Trees in Algebra and Programming Pub Date : 1988-03-21 DOI: 10.1007/BFb0026098
R. Echahed
{"title":"On Comleteness of Narrowing Strategies","authors":"R. Echahed","doi":"10.1007/BFb0026098","DOIUrl":"https://doi.org/10.1007/BFb0026098","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131989029","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}
引用次数: 33
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学术官方微信