Pub Date : 2022-07-03DOI: 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}
Pub Date : 2022-06-20DOI: 10.48550/arXiv.2206.09980
Martin Sulzmann, Stefan Wehr
. 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.
{"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}
Pub Date : 2022-02-28DOI: 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}
Pub Date : 2019-10-07DOI: 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}
Pub Date : 2019-10-07DOI: 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}
Pub Date : 2019-10-07DOI: 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}
Pub Date : 2019-10-07DOI: 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}
Pub Date : 2019-10-07DOI: 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}
Pub Date : 2019-10-07DOI: 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}
Pub Date : 2019-10-07DOI: 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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：