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

模式匹配导向的证明书写语言

Companion Proceedings of the 4th International Conference on Art, Science, and Engineering of Programming Pub Date : 2020-03-23 DOI:10.1145/3397537.3398481
S. Egi
{"title":"模式匹配导向的证明书写语言","authors":"S. Egi","doi":"10.1145/3397537.3398481","DOIUrl":null,"url":null,"abstract":"This paper demonstrates how pattern matching for non-free data types can make proofs intuitive.","PeriodicalId":373173,"journal":{"name":"Companion Proceedings of the 4th International Conference on Art, Science, and Engineering of Programming","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Pattern-match-oriented proof writing language\",\"authors\":\"S. Egi\",\"doi\":\"10.1145/3397537.3398481\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper demonstrates how pattern matching for non-free data types can make proofs intuitive.\",\"PeriodicalId\":373173,\"journal\":{\"name\":\"Companion Proceedings of the 4th International Conference on Art, Science, and Engineering of Programming\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-03-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Companion Proceedings of the 4th International Conference on Art, Science, and Engineering of Programming\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3397537.3398481\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Companion Proceedings of the 4th International Conference on Art, Science, and Engineering of Programming","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3397537.3398481","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文演示了非自由数据类型的模式匹配如何使证明变得直观。
本文章由计算机程序翻译，如有差异，请以英文原文为准。
分享
查看原文 本刊更多论文
Pattern-match-oriented proof writing language
This paper demonstrates how pattern matching for non-free data types can make proofs intuitive.
求助全文
通过发布文献求助，成功后即可免费获取论文全文。 去求助
来源期刊
Companion Proceedings of the 4th International Conference on Art, Science, and Engineering of Programming
Companion Proceedings of the 4th International Conference on Art, Science, and Engineering of Programming
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信