在Agda中使用通用树进行计算

Proceedings of the 7th ACM SIGPLAN International Workshop on Type-Driven Development Pub Date : 2022-09-06 DOI:10.1145/3546196.3550165

Stephen Dolan

{"title":"在Agda中使用通用树进行计算","authors":"Stephen Dolan","doi":"10.1145/3546196.3550165","DOIUrl":null,"url":null,"abstract":"Dependently-typed programming languages offer powerful new means of abstraction, allowing the programmer to work generically across data structures. However, using the standard generic encoding of tree-like data structures (the W-types), we soon notice a caveat: the computational behaviour of W-types does not quite match their first-order counterparts. Here, we show how a tweak to the definition of W-types avoids this caveat, making the generic definition work just as well as the direct one.","PeriodicalId":417117,"journal":{"name":"Proceedings of the 7th ACM SIGPLAN International Workshop on Type-Driven Development","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Computing with generic trees in Agda\",\"authors\":\"Stephen Dolan\",\"doi\":\"10.1145/3546196.3550165\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Dependently-typed programming languages offer powerful new means of abstraction, allowing the programmer to work generically across data structures. However, using the standard generic encoding of tree-like data structures (the W-types), we soon notice a caveat: the computational behaviour of W-types does not quite match their first-order counterparts. Here, we show how a tweak to the definition of W-types avoids this caveat, making the generic definition work just as well as the direct one.\",\"PeriodicalId\":417117,\"journal\":{\"name\":\"Proceedings of the 7th ACM SIGPLAN International Workshop on Type-Driven Development\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-09-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 7th ACM SIGPLAN International Workshop on Type-Driven Development\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3546196.3550165\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 7th ACM SIGPLAN International Workshop on Type-Driven Development","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3546196.3550165","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

依赖类型编程语言提供了强大的新抽象方法，允许程序员跨数据结构进行通用工作。然而，使用树状数据结构(w类型)的标准泛型编码，我们很快注意到一个警告:w类型的计算行为并不完全匹配它们的一阶对应。这里，我们将展示对w类型定义的调整如何避免这种警告，使泛型定义与直接定义一样有效。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Computing with generic trees in Agda

Dependently-typed programming languages offer powerful new means of abstraction, allowing the programmer to work generically across data structures. However, using the standard generic encoding of tree-like data structures (the W-types), we soon notice a caveat: the computational behaviour of W-types does not quite match their first-order counterparts. Here, we show how a tweak to the definition of W-types avoids this caveat, making the generic definition work just as well as the direct one.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the 7th ACM SIGPLAN International Workshop on Type-Driven Development

自引率

0.00%

发文量