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

International Conference on Mathematics of Program Construction最新文献

筛选
英文 中文
Folding over Neural Networks 神经网络的折叠
International Conference on Mathematics of Program Construction Pub Date : 2022-07-03 DOI: 10.1007/978-3-031-16912-0_5
Minh Nguyen, Nicolas Wu
{"title":"Folding over Neural Networks","authors":"Minh Nguyen, Nicolas Wu","doi":"10.1007/978-3-031-16912-0_5","DOIUrl":"https://doi.org/10.1007/978-3-031-16912-0_5","url":null,"abstract":"","PeriodicalId":388034,"journal":{"name":"International Conference on Mathematics of Program Construction","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132903522","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
Semantic preservation for a type directed translation scheme of Featherweight Go 羽量级围棋一种类型导向翻译方案的语义保存
International Conference on Mathematics of Program Construction Pub Date : 2022-06-20 DOI: 10.48550/arXiv.2206.09980
Martin Sulzmann, Stefan Wehr
{"title":"Semantic preservation for a type directed translation scheme of Featherweight Go","authors":"Martin Sulzmann, Stefan Wehr","doi":"10.48550/arXiv.2206.09980","DOIUrl":"https://doi.org/10.48550/arXiv.2206.09980","url":null,"abstract":". Featherweight Go (FG) is a minimal core calculus that includes essential Go features such as overloaded methods and interface types. The most straightforward semantic description of the dynamic behavior of FG programs is to resolve method calls based on run-time type information. A more efficient approach is to apply a type-directed translation scheme where interface-values are replaced by dictionaries that contain concrete method definitions. Thus, method calls can be resolved by a simple lookup of the method definition in the dictionary. Establishing that the target program obtained via the type-directed translation scheme preserves the semantics of the original FG program is an important task. To establish this property we employ logical relations that are indexed by types to relate source and target programs. We provide rigorous proofs and give a detailed discussion of the many subtle corners that we have encountered including the need for a step index due to recursive interfaces and method definitions.","PeriodicalId":388034,"journal":{"name":"International Conference on Mathematics of Program Construction","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122441592","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}
引用次数: 2
Fantastic Morphisms and Where to Find Them: A Guide to Recursion Schemes 奇妙的态射和在哪里找到它们:递归方案指南
International Conference on Mathematics of Program Construction Pub Date : 2022-02-28 DOI: 10.1007/978-3-031-16912-0_9
Zhixuan Yang, Nicolas Wu
{"title":"Fantastic Morphisms and Where to Find Them: A Guide to Recursion Schemes","authors":"Zhixuan Yang, Nicolas Wu","doi":"10.1007/978-3-031-16912-0_9","DOIUrl":"https://doi.org/10.1007/978-3-031-16912-0_9","url":null,"abstract":"","PeriodicalId":388034,"journal":{"name":"International Conference on Mathematics of Program Construction","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125328966","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
How to Calculate with Nondeterministic Functions 如何用不确定性函数进行计算
International Conference on Mathematics of Program Construction Pub Date : 2019-10-07 DOI: 10.1007/978-3-030-33636-3_6
R. Bird, Florian Rabe
{"title":"How to Calculate with Nondeterministic Functions","authors":"R. Bird, Florian Rabe","doi":"10.1007/978-3-030-33636-3_6","DOIUrl":"https://doi.org/10.1007/978-3-030-33636-3_6","url":null,"abstract":"","PeriodicalId":388034,"journal":{"name":"International Conference on Mathematics of Program Construction","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117002225","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
Setoid Type Theory - A Syntactic Translation Setoid类型理论-句法翻译
International Conference on Mathematics of Program Construction Pub Date : 2019-10-07 DOI: 10.1007/978-3-030-33636-3_7
Thorsten Altenkirch, S. Boulier, A. Kaposi, Nicolas Tabareau
{"title":"Setoid Type Theory - A Syntactic Translation","authors":"Thorsten Altenkirch, S. Boulier, A. Kaposi, Nicolas Tabareau","doi":"10.1007/978-3-030-33636-3_7","DOIUrl":"https://doi.org/10.1007/978-3-030-33636-3_7","url":null,"abstract":"","PeriodicalId":388034,"journal":{"name":"International Conference on Mathematics of Program Construction","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128236840","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}
引用次数: 14
Cylindric Kleene Lattices for Program Construction 用于程序构建的圆柱形Kleene格
International Conference on Mathematics of Program Construction Pub Date : 2019-10-07 DOI: 10.1007/978-3-030-33636-3_8
Brijesh Dongol, I. Hayes, L. Meinicke, G. Struth
{"title":"Cylindric Kleene Lattices for Program Construction","authors":"Brijesh Dongol, I. Hayes, L. Meinicke, G. Struth","doi":"10.1007/978-3-030-33636-3_8","DOIUrl":"https://doi.org/10.1007/978-3-030-33636-3_8","url":null,"abstract":"","PeriodicalId":388034,"journal":{"name":"International Conference on Mathematics of Program Construction","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131048698","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
Certification of Breadth-First Algorithms by Extraction 基于提取的宽度优先算法的认证
International Conference on Mathematics of Program Construction Pub Date : 2019-10-07 DOI: 10.1007/978-3-030-33636-3_3
Dominique Larchey-Wendling, R. Matthes
{"title":"Certification of Breadth-First Algorithms by Extraction","authors":"Dominique Larchey-Wendling, R. Matthes","doi":"10.1007/978-3-030-33636-3_3","DOIUrl":"https://doi.org/10.1007/978-3-030-33636-3_3","url":null,"abstract":"","PeriodicalId":388034,"journal":{"name":"International Conference on Mathematics of Program Construction","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127963388","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
An Analysis of Repeated Graph Search 重复图搜索的分析
International Conference on Mathematics of Program Construction Pub Date : 2019-10-07 DOI: 10.1007/978-3-030-33636-3_11
R. Backhouse
{"title":"An Analysis of Repeated Graph Search","authors":"R. Backhouse","doi":"10.1007/978-3-030-33636-3_11","DOIUrl":"https://doi.org/10.1007/978-3-030-33636-3_11","url":null,"abstract":"","PeriodicalId":388034,"journal":{"name":"International Conference on Mathematics of Program Construction","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116088975","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
Coding with Asymmetric Numeral Systems 非对称数字系统编码
International Conference on Mathematics of Program Construction Pub Date : 2019-10-07 DOI: 10.1007/978-3-030-33636-3_16
J. Gibbons
{"title":"Coding with Asymmetric Numeral Systems","authors":"J. Gibbons","doi":"10.1007/978-3-030-33636-3_16","DOIUrl":"https://doi.org/10.1007/978-3-030-33636-3_16","url":null,"abstract":"","PeriodicalId":388034,"journal":{"name":"International Conference on Mathematics of Program Construction","volume":"233 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116157193","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
Unraveling Recursion: Compiling an IR with Recursion to System F 解递归:用递归编译一个系统F的IR
International Conference on Mathematics of Program Construction Pub Date : 2019-10-07 DOI: 10.1007/978-3-030-33636-3_15
M. P. Jones, Vasilis Gkoumas, Roman Kireev, K. Mackenzie, Chad Nester, P. Wadler
{"title":"Unraveling Recursion: Compiling an IR with Recursion to System F","authors":"M. P. Jones, Vasilis Gkoumas, Roman Kireev, K. Mackenzie, Chad Nester, P. Wadler","doi":"10.1007/978-3-030-33636-3_15","DOIUrl":"https://doi.org/10.1007/978-3-030-33636-3_15","url":null,"abstract":"","PeriodicalId":388034,"journal":{"name":"International Conference on Mathematics of Program Construction","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127392550","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
下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信