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

Colloquium on Trees in Algebra and Programming最新文献

筛选
英文 中文
Full Abstraction for Lambda Calculus with Resources and Convergence Testing Lambda微积分的完全抽象及其收敛性检验
Colloquium on Trees in Algebra and Programming Pub Date : 1996-04-22 DOI: 10.1007/3-540-61064-2_45
G. Boudol, Carolina Lavatelli
{"title":"Full Abstraction for Lambda Calculus with Resources and Convergence Testing","authors":"G. Boudol, Carolina Lavatelli","doi":"10.1007/3-540-61064-2_45","DOIUrl":"https://doi.org/10.1007/3-540-61064-2_45","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"1 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":"129558140","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
Efficient Longest and Infinite Reduction Paths in Untyped Lambda-Calculi 无类型λ -微积分的有效最长和无限约简路径
Colloquium on Trees in Algebra and Programming Pub Date : 1996-04-22 DOI: 10.1007/3-540-61064-2_44
M. Sørensen
{"title":"Efficient Longest and Infinite Reduction Paths in Untyped Lambda-Calculi","authors":"M. Sørensen","doi":"10.1007/3-540-61064-2_44","DOIUrl":"https://doi.org/10.1007/3-540-61064-2_44","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"47 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":"128934682","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
Diophantine Equations, Presburger Arithmetic and Finite Automata 丢番图方程，普雷斯伯格算法和有限自动机
Colloquium on Trees in Algebra and Programming Pub Date : 1996-04-22 DOI: 10.1007/3-540-61064-2_27
A. Boudet, Hubert Comon-Lundh
{"title":"Diophantine Equations, Presburger Arithmetic and Finite Automata","authors":"A. Boudet, Hubert Comon-Lundh","doi":"10.1007/3-540-61064-2_27","DOIUrl":"https://doi.org/10.1007/3-540-61064-2_27","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"23 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":"125368016","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}
引用次数: 115
An Ordinal Calculus for Proving Termination in Term Rewriting 项改写中证明终止的一个序数微积分
Colloquium on Trees in Algebra and Programming Pub Date : 1996-04-22 DOI: 10.1007/3-540-61064-2_40
E. Cichon, H. Touzet
{"title":"An Ordinal Calculus for Proving Termination in Term Rewriting","authors":"E. Cichon, H. Touzet","doi":"10.1007/3-540-61064-2_40","DOIUrl":"https://doi.org/10.1007/3-540-61064-2_40","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"73 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":"120950897","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
Relative Normalization in Deterministic Residual Structures 确定性残差结构的相对归一化
Colloquium on Trees in Algebra and Programming Pub Date : 1996-04-22 DOI: 10.1007/3-540-61064-2_37
J. Glauert, Z. Khasidashvili
{"title":"Relative Normalization in Deterministic Residual Structures","authors":"J. Glauert, Z. Khasidashvili","doi":"10.1007/3-540-61064-2_37","DOIUrl":"https://doi.org/10.1007/3-540-61064-2_37","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"1 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":"124213137","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
Untyped Lambda-Calculus with Input-Output 具有输入-输出的无类型lambda演算
Colloquium on Trees in Algebra and Programming Pub Date : 1996-04-22 DOI: 10.1007/3-540-61064-2_46
J. Tiuryn, M. Wand
{"title":"Untyped Lambda-Calculus with Input-Output","authors":"J. Tiuryn, M. Wand","doi":"10.1007/3-540-61064-2_46","DOIUrl":"https://doi.org/10.1007/3-540-61064-2_46","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"39 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":"131959024","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
Semantics of Interaction 交互语义
Colloquium on Trees in Algebra and Programming Pub Date : 1996-04-22 DOI: 10.1007/3-540-61064-2_24
S. Abramsky
{"title":"Semantics of Interaction","authors":"S. Abramsky","doi":"10.1007/3-540-61064-2_24","DOIUrl":"https://doi.org/10.1007/3-540-61064-2_24","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"44 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":"131288091","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}
引用次数: 98
The Area Determined by Underdiagonal Lattice Paths 由下对角点阵路径确定的面积
Colloquium on Trees in Algebra and Programming Pub Date : 1996-04-22 DOI: 10.1007/3-540-61064-2_29
D. Merlini, R. Sprugnoli, Cecilia Verri
{"title":"The Area Determined by Underdiagonal Lattice Paths","authors":"D. Merlini, R. Sprugnoli, Cecilia Verri","doi":"10.1007/3-540-61064-2_29","DOIUrl":"https://doi.org/10.1007/3-540-61064-2_29","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"44 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":"131426591","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}
引用次数: 24
The Kronecker Product and Local Computations in Graphs 图中的Kronecker积与局部计算
Colloquium on Trees in Algebra and Programming Pub Date : 1996-04-22 DOI: 10.1007/3-540-61064-2_25
A. Bottreau, Y. Métivier
{"title":"The Kronecker Product and Local Computations in Graphs","authors":"A. Bottreau, Y. Métivier","doi":"10.1007/3-540-61064-2_25","DOIUrl":"https://doi.org/10.1007/3-540-61064-2_25","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"441 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":"126994721","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
Interaction Nets and Term Rewriting Systems (Extended Abstract) 交互网络与术语重写系统(扩展摘要)
Colloquium on Trees in Algebra and Programming Pub Date : 1996-04-22 DOI: 10.1007/3-540-61064-2_35
M. Fernández, I. Mackie
{"title":"Interaction Nets and Term Rewriting Systems (Extended Abstract)","authors":"M. Fernández, I. Mackie","doi":"10.1007/3-540-61064-2_35","DOIUrl":"https://doi.org/10.1007/3-540-61064-2_35","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"27 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":"121605751","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学术官方微信