Proceedings of the 11th ACM SIGPLAN International Symposium on Haskell最新文献_第2页

Improving typeclass relations by being open 通过开放来改善类型类关系

Proceedings of the 11th ACM SIGPLAN International Symposium on Haskell Pub Date : 2018-09-17 DOI: 10.1145/3242744.3242751

Guido Martínez, Mauro Jaskelioff, G. D. Luca

{"title":"Improving typeclass relations by being open","authors":"Guido Martínez, Mauro Jaskelioff, G. D. Luca","doi":"10.1145/3242744.3242751","DOIUrl":"https://doi.org/10.1145/3242744.3242751","url":null,"abstract":"Mathematical concepts such as monads, functors, monoids, and semigroups are expressed in Haskell as typeclasses. Therefore, in order to exploit relations such as “every monad is a functor”, and “every monoid is a semigroup”, we need to be able to also express relations between typeclasses. Currently, the only way to do so is using superclasses. However, superclasses can be problematic due to their closed nature. Adding a superclass implies modifying the subclass’ definition, which is either impossible if one does not own such code, or painful as it requires cascading changes and the introduction of boilerplate throughout the codebase. In this article, we introduce class morphisms, a way to relate classes in an open fashion, without changing class definitions. We show how class morphisms improve the expressivity, conciseness, and maintainability of code. Further, we show how to implement them while maintaining canonicity and coherence, two key properties of the Haskell type system. Extending a typechecker with class morphisms amounts to adding an elaboration phase and is an unintrusive change. We back this claim with a prototype extension of GHC.","PeriodicalId":318201,"journal":{"name":"Proceedings of the 11th ACM SIGPLAN International Symposium on Haskell","volume":"315 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128350095","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

The Thoralf plugin: for your fancy type needs Thoralf插件:用于您的花哨类型需求

Proceedings of the 11th ACM SIGPLAN International Symposium on Haskell Pub Date : 2018-09-17 DOI: 10.1145/3242744.3242754

D. Otwani, R. Eisenberg

引用次数: 5

Theorem proving for all: equational reasoning in liquid Haskell (functional pearl) 对所有人的定理证明:液体Haskell(泛函珍珠)中的等式推理

Proceedings of the 11th ACM SIGPLAN International Symposium on Haskell Pub Date : 2018-09-17 DOI: 10.1145/3242744.3242756

Niki Vazou, Joachim Breitner, Rose Kunkel, David Van Horn, G. Hutton

引用次数: 20

Branching processes for QuickCheck generators QuickCheck生成器的分支进程

Proceedings of the 11th ACM SIGPLAN International Symposium on Haskell Pub Date : 2018-08-04 DOI: 10.1145/3242744.3242747

Agustín Mista, Alejandro Russo, John Hughes

引用次数: 14

Coherent explicit dictionary application for Haskell Haskell的连贯显式字典应用程序

Proceedings of the 11th ACM SIGPLAN International Symposium on Haskell Pub Date : 2018-07-30 DOI: 10.1145/3242744.3242752

T. Winant, Dominique Devriese

{"title":"Coherent explicit dictionary application for Haskell","authors":"T. Winant, Dominique Devriese","doi":"10.1145/3242744.3242752","DOIUrl":"https://doi.org/10.1145/3242744.3242752","url":null,"abstract":"Type classes are one of Haskell's most popular features and extend its type system with ad-hoc polymorphism. Since their conception, there were useful features that could not be offered because of the desire to offer two correctness properties: coherence and global uniqueness of instances. Coherence essentially guarantees that program semantics are independent from type-checker internals. Global uniqueness of instances is relied upon by libraries for enforcing, for example, that a single order relation is used for all manipulations of an ordered binary tree. The features that could not be offered include explicit dictionary application and local instances, which would be highly useful in practice. In this paper, we propose a new design for offering explicit dictionary application, without compromising coherence and global uniqueness. We introduce a novel criterion based on GHC's type argument roles to decide when a dictionary application is safe with respect to global uniqueness of instances. We preserve coherence by detecting potential sources of incoherence, and prove it formally. Moreover, our solution makes it possible to use local dictionaries. In addition to developing our ideas formally, we have implemented a working prototype in GHC.","PeriodicalId":318201,"journal":{"name":"Proceedings of the 11th ACM SIGPLAN International Symposium on Haskell","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114278448","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

Type variables in patterns 在模式中输入变量

Proceedings of the 11th ACM SIGPLAN International Symposium on Haskell Pub Date : 2018-06-09 DOI: 10.1145/3242744.3242753

R. Eisenberg, Joachim Breitner, S. Jones

引用次数: 9

A promise checked is a promise kept: inspection testing 兑现承诺:检查测试

Proceedings of the 11th ACM SIGPLAN International Symposium on Haskell Pub Date : 2018-03-19 DOI: 10.1145/3242744.3242748

Joachim Breitner

引用次数: 8