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

Colloquium on Trees in Algebra and Programming最新文献

筛选
英文 中文
On Higher Order Recursive Program Schemes 关于高阶递归规划方案
Colloquium on Trees in Algebra and Programming Pub Date : 1994-04-11 DOI: 10.1007/BFb0017481
Z. Khasidashvili
{"title":"On Higher Order Recursive Program Schemes","authors":"Z. Khasidashvili","doi":"10.1007/BFb0017481","DOIUrl":"https://doi.org/10.1007/BFb0017481","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"331 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":"123102817","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}
引用次数: 19
Type Preorders 类型预订
Colloquium on Trees in Algebra and Programming Pub Date : 1994-04-11 DOI: 10.1007/BFb0017472
F. Alessi
{"title":"Type Preorders","authors":"F. Alessi","doi":"10.1007/BFb0017472","DOIUrl":"https://doi.org/10.1007/BFb0017472","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"37 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":"123516828","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}
引用次数: 10
On the First-Order Equivalence of Call-by-Name and Call-by-Value 论按名调用和按值调用的一阶等价性
Colloquium on Trees in Algebra and Programming Pub Date : 1994-04-11 DOI: 10.1007/BFb0017486
T. Noll
{"title":"On the First-Order Equivalence of Call-by-Name and Call-by-Value","authors":"T. Noll","doi":"10.1007/BFb0017486","DOIUrl":"https://doi.org/10.1007/BFb0017486","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"31 6 (Supplementary 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":"114505611","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
Nondeterministic Automata with Concurrency Relations and Domains 具有并发关系和域的不确定性自动机
Colloquium on Trees in Algebra and Programming Pub Date : 1994-04-11 DOI: 10.1007/BFb0017483
D. Kuske
{"title":"Nondeterministic Automata with Concurrency Relations and Domains","authors":"D. Kuske","doi":"10.1007/BFb0017483","DOIUrl":"https://doi.org/10.1007/BFb0017483","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"14 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":"128686050","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
Probabilistic Analysis of an Election Algorithm in a Tree 树中选举算法的概率分析
Colloquium on Trees in Algebra and Programming Pub Date : 1994-04-11 DOI: 10.1007/BFb0017485
Y. Métivier, N. Saheb-Djahromi
{"title":"Probabilistic Analysis of an Election Algorithm in a Tree","authors":"Y. Métivier, N. Saheb-Djahromi","doi":"10.1007/BFb0017485","DOIUrl":"https://doi.org/10.1007/BFb0017485","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"10 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":"123144301","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}
引用次数: 10
Algebraic and Combinatorial Properties of Simple, Coloured Walks 简单彩色行走的代数和组合性质
Colloquium on Trees in Algebra and Programming Pub Date : 1994-04-11 DOI: 10.1007/BFb0017484
D. Merlini, R. Sprugnoli, M. Verri
{"title":"Algebraic and Combinatorial Properties of Simple, Coloured Walks","authors":"D. Merlini, R. Sprugnoli, M. Verri","doi":"10.1007/BFb0017484","DOIUrl":"https://doi.org/10.1007/BFb0017484","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"66 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":"121940602","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}
引用次数: 15
Some Results on Top-Context-Free Tree Languages 关于顶部上下文无关的树语言的一些结果
Colloquium on Trees in Algebra and Programming Pub Date : 1994-04-11 DOI: 10.1007/BFb0017480
D. Hofbauer, Maria Huber, G. Kucherov
{"title":"Some Results on Top-Context-Free Tree Languages","authors":"D. Hofbauer, Maria Huber, G. Kucherov","doi":"10.1007/BFb0017480","DOIUrl":"https://doi.org/10.1007/BFb0017480","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"4 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":"128525601","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
Probabilistic Domains 概率域
Colloquium on Trees in Algebra and Programming Pub Date : 1994-04-11 DOI: 10.1007/BFb0017479
Reinhold Heckmann
{"title":"Probabilistic Domains","authors":"Reinhold Heckmann","doi":"10.1007/BFb0017479","DOIUrl":"https://doi.org/10.1007/BFb0017479","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"31 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":"123082835","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}
引用次数: 38
On the Decidability of Model Checking for Several µ-calculi and Petri Nets 几种微微积分网和Petri网模型检验的可判定性
Colloquium on Trees in Algebra and Programming Pub Date : 1994-04-11 DOI: 10.1007/BFb0017477
J. Esparza
{"title":"On the Decidability of Model Checking for Several µ-calculi and Petri Nets","authors":"J. Esparza","doi":"10.1007/BFb0017477","DOIUrl":"https://doi.org/10.1007/BFb0017477","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"56 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":"123895834","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}
引用次数: 89
Ordering Constraints on Trees 树的排序约束
Colloquium on Trees in Algebra and Programming Pub Date : 1994-04-11 DOI: 10.1007/BFb0017470
Hubert Comon-Lundh, R. Treinen
{"title":"Ordering Constraints on Trees","authors":"Hubert Comon-Lundh, R. Treinen","doi":"10.1007/BFb0017470","DOIUrl":"https://doi.org/10.1007/BFb0017470","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"45 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":"133583767","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}
引用次数: 42
首页 上一页 下一页 尾页
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学术官方微信