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

Foundations of Software Science and Computation Structure最新文献

筛选
英文 中文
A Lambda-Free Higher-Order Recursive Path Order 无lambda的高阶递归路径阶
Foundations of Software Science and Computation Structure Pub Date : 2017-04-22 DOI: 10.1007/978-3-662-54458-7_27
J. Blanchette, Uwe Waldmann, D. Wand
{"title":"A Lambda-Free Higher-Order Recursive Path Order","authors":"J. Blanchette, Uwe Waldmann, D. Wand","doi":"10.1007/978-3-662-54458-7_27","DOIUrl":"https://doi.org/10.1007/978-3-662-54458-7_27","url":null,"abstract":"","PeriodicalId":330721,"journal":{"name":"Foundations of Software Science and Computation Structure","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127103481","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
A Truly Concurrent Game Model of the Asynchronous pi -Calculus 异步π -微积分的真正并发博弈模型
Foundations of Software Science and Computation Structure Pub Date : 2017-04-22 DOI: 10.1007/978-3-662-54458-7_23
K. Sakayori, Takeshi Tsukada
{"title":"A Truly Concurrent Game Model of the Asynchronous pi -Calculus","authors":"K. Sakayori, Takeshi Tsukada","doi":"10.1007/978-3-662-54458-7_23","DOIUrl":"https://doi.org/10.1007/978-3-662-54458-7_23","url":null,"abstract":"","PeriodicalId":330721,"journal":{"name":"Foundations of Software Science and Computation Structure","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115742933","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
Automated Constructivization of Proofs 自动构造证明
Foundations of Software Science and Computation Structure Pub Date : 2017-04-22 DOI: 10.1007/978-3-662-54458-7_28
Frédéric Gilbert
{"title":"Automated Constructivization of Proofs","authors":"Frédéric Gilbert","doi":"10.1007/978-3-662-54458-7_28","DOIUrl":"https://doi.org/10.1007/978-3-662-54458-7_28","url":null,"abstract":"","PeriodicalId":330721,"journal":{"name":"Foundations of Software Science and Computation Structure","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126748720","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
The Free Exponential Modality of Probabilistic Coherence Spaces 概率相干空间的自由指数模态
Foundations of Software Science and Computation Structure Pub Date : 2017-04-22 DOI: 10.1007/978-3-662-54458-7_2
Raphaëlle Crubillé, T. Ehrhard, Michele Pagani, C. Tasson
{"title":"The Free Exponential Modality of Probabilistic Coherence Spaces","authors":"Raphaëlle Crubillé, T. Ehrhard, Michele Pagani, C. Tasson","doi":"10.1007/978-3-662-54458-7_2","DOIUrl":"https://doi.org/10.1007/978-3-662-54458-7_2","url":null,"abstract":"","PeriodicalId":330721,"journal":{"name":"Foundations of Software Science and Computation Structure","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121546125","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
Coherence Spaces and Uniform Continuity 相干空间与一致连续性
Foundations of Software Science and Computation Structure Pub Date : 2017-04-22 DOI: 10.1007/978-3-662-54458-7_1
Keisaku Matsumoto
{"title":"Coherence Spaces and Uniform Continuity","authors":"Keisaku Matsumoto","doi":"10.1007/978-3-662-54458-7_1","DOIUrl":"https://doi.org/10.1007/978-3-662-54458-7_1","url":null,"abstract":"","PeriodicalId":330721,"journal":{"name":"Foundations of Software Science and Computation Structure","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115179313","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
Local Model Checking in a Logic for True Concurrency 为实现真正的并发性而在逻辑中进行本地模型检查
Foundations of Software Science and Computation Structure Pub Date : 2017-04-22 DOI: 10.1007/978-3-662-54458-7_24
Paolo Baldan, Tommaso Padoan
{"title":"Local Model Checking in a Logic for True Concurrency","authors":"Paolo Baldan, Tommaso Padoan","doi":"10.1007/978-3-662-54458-7_24","DOIUrl":"https://doi.org/10.1007/978-3-662-54458-7_24","url":null,"abstract":"","PeriodicalId":330721,"journal":{"name":"Foundations of Software Science and Computation Structure","volume":"228 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122852268","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
On the Undecidability of Asynchronous Session Subtyping 论异步会话子类型的不可判定性
Foundations of Software Science and Computation Structure Pub Date : 2017-04-22 DOI: 10.1007/978-3-662-54458-7_26
J. Lange, N. Yoshida
{"title":"On the Undecidability of Asynchronous Session Subtyping","authors":"J. Lange, N. Yoshida","doi":"10.1007/978-3-662-54458-7_26","DOIUrl":"https://doi.org/10.1007/978-3-662-54458-7_26","url":null,"abstract":"","PeriodicalId":330721,"journal":{"name":"Foundations of Software Science and Computation Structure","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122975967","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
Almost Every Simply Typed λ-Term Has a Long β-Reduction Sequence 几乎每个单型λ项都有一个较长的β-还原序列
Foundations of Software Science and Computation Structure Pub Date : 2017-04-22 DOI: 10.1007/978-3-662-54458-7_4
Ryoma Sin'ya, Kazuyuki Asada, N. Kobayashi, Takeshi Tsukada
{"title":"Almost Every Simply Typed λ-Term Has a Long β-Reduction Sequence","authors":"Ryoma Sin'ya, Kazuyuki Asada, N. Kobayashi, Takeshi Tsukada","doi":"10.1007/978-3-662-54458-7_4","DOIUrl":"https://doi.org/10.1007/978-3-662-54458-7_4","url":null,"abstract":"","PeriodicalId":330721,"journal":{"name":"Foundations of Software Science and Computation Structure","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124547091","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
Unifying Guarded and Unguarded Iteration 统一有保护迭代和无保护迭代
Foundations of Software Science and Computation Structure Pub Date : 2017-04-22 DOI: 10.1007/978-3-662-54458-7_30
S. Goncharov, Lutz Schröder, C. Rauch, Maciej Piróg
{"title":"Unifying Guarded and Unguarded Iteration","authors":"S. Goncharov, Lutz Schröder, C. Rauch, Maciej Piróg","doi":"10.1007/978-3-662-54458-7_30","DOIUrl":"https://doi.org/10.1007/978-3-662-54458-7_30","url":null,"abstract":"","PeriodicalId":330721,"journal":{"name":"Foundations of Software Science and Computation Structure","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116803840","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
Computing Continuous-Time Markov Chains as Transformers of Unbounded Observables 计算连续时间马尔可夫链作为无界可观测量的变形
Foundations of Software Science and Computation Structure Pub Date : 2017-04-22 DOI: 10.1007/978-3-662-54458-7_20
V. Danos, T. Heindel, I. Garnier, J. Simonsen
{"title":"Computing Continuous-Time Markov Chains as Transformers of Unbounded Observables","authors":"V. Danos, T. Heindel, I. Garnier, J. Simonsen","doi":"10.1007/978-3-662-54458-7_20","DOIUrl":"https://doi.org/10.1007/978-3-662-54458-7_20","url":null,"abstract":"","PeriodicalId":330721,"journal":{"name":"Foundations of Software Science and Computation Structure","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115445035","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
首页 上一页 下一页 尾页
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学术官方微信