Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming最新文献_第3页

All sorts of permutations (functional pearl) 各种排列(功能珍珠)

Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming Pub Date : 2016-09-04 DOI: 10.1145/2951913.2951949

Jan Christiansen, Nikita Danilenko, Sandra Dylus

引用次数: 3

Oh Lord, please don't let contracts be misunderstood (functional pearl) 哦，上帝，请不要让合同被误解(功能珍珠)

Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming Pub Date : 2016-09-04 DOI: 10.1145/2951913.2951930

Christos Dimoulas, Max S. New, R. Findler, M. Felleisen

引用次数: 10

Dag-calculus: a calculus for parallel computation dag微积分:一种并行计算的微积分

Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming Pub Date : 2016-09-04 DOI: 10.1145/2951913.2951946

Umut A. Acar, A. Charguéraud, Mike Rainey, Filip Sieczkowski

{"title":"Dag-calculus: a calculus for parallel computation","authors":"Umut A. Acar, A. Charguéraud, Mike Rainey, Filip Sieczkowski","doi":"10.1145/2951913.2951946","DOIUrl":"https://doi.org/10.1145/2951913.2951946","url":null,"abstract":"Increasing availability of multicore systems has led to greater focus on the design and implementation of languages for writing parallel programs. Such languages support various abstractions for parallelism, such as fork-join, async-finish, futures. While they may seem similar, these abstractions lead to different semantics, language design and implementation decisions, and can significantly impact the performance of end-user applications. In this paper, we consider the question of whether it would be possible to unify various paradigms of parallel computing. To this end, we propose a calculus, called dag calculus, that can encode fork-join, async-finish, and futures, and possibly others. We describe dag calculus and its semantics, establish translations from the aforementioned paradigms into dag calculus. These translations establish that dag calculus is sufficiently powerful for encoding programs written in prevailing paradigms of parallelism. We present concurrent algorithms and data structures for realizing dag calculus on multicore hardware and prove that the proposed techniques are consistent with the semantics. Finally, we present an implementation of the calculus and evaluate it empirically by comparing its performance to highly optimized code from prior work. The results show that the calculus is expressive and that it competes well with, and sometimes outperforms, the state of the art.","PeriodicalId":336660,"journal":{"name":"Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131386281","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}

引用次数: 10

A functional programmer's guide to homotopy type theory 函数式程序员的同伦类型理论指南

Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming Pub Date : 2016-09-04 DOI: 10.1145/2951913.2976748

Daniel R. Licata

{"title":"A functional programmer's guide to homotopy type theory","authors":"Daniel R. Licata","doi":"10.1145/2951913.2976748","DOIUrl":"https://doi.org/10.1145/2951913.2976748","url":null,"abstract":"Dependent type theories are functional programming languages with types rich enough to do computer-checked mathematics and software verification. Homotopy type theory is a recent area of work that connects dependent type theory to the mathematical disciplines of homotopy theory and higher-dimensional category theory. From a programming point of view, these connections have revealed that all types in dependent type theory support a certain generic program that had not previously been exploited. Specifically, each type can be equipped with computationally relevant witnesses of equality of elements of that type, and all types support a generic program that transports elements along these equalities. One mechanism for equipping types with non-trivial witnesses of equality is Voevodsky’s univalence axiom, which implies that equality of types themselves is witnessed by type isomorphism. Another is higher inductive types, an extended datatype schema that allows identifications between different datatype constructors. While these new mechanisms were originally formulated as axiomatic extensions of type theory, recent work has investigated their computational meaning, leading to the development of new programming languages that better support them. In this talk, I will illustrate what univalence and higher inductive types mean in programming terms. I will also discuss how studying some related semantic settings can reveal additional structure on types; for example, moving from groupoids (categories where all maps are invertible) to general categories yields an account of coercions instead of equalities. Overall, I hope to convey some of the beauty and richness of these connections between disciplines, which we are just beginning to understand.","PeriodicalId":336660,"journal":{"name":"Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115713251","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

Ghostbuster: a tool for simplifying and converting GADTs Ghostbuster:一个简化和转换gadt的工具

Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming Pub Date : 2016-09-04 DOI: 10.1145/2951913.2951914

T. L. McDonell, Timothy A. K. Zakian, M. Cimini, Ryan Newton

{"title":"Ghostbuster: a tool for simplifying and converting GADTs","authors":"T. L. McDonell, Timothy A. K. Zakian, M. Cimini, Ryan Newton","doi":"10.1145/2951913.2951914","DOIUrl":"https://doi.org/10.1145/2951913.2951914","url":null,"abstract":"Generalized Algebraic Dataypes, or simply GADTs, can encode non-trivial properties in the types of the constructors. Once such properties are encoded in a datatype, however, all code manipulating that datatype must provide proof that it maintains these properties in order to typecheck. In this paper, we take a step towards gradualizing these obligations. We introduce a tool, Ghostbuster, that produces simplified versions of GADTs which elide selected type parameters, thereby weakening the guarantees of the simplified datatype in exchange for reducing the obligations necessary to manipulate it. Like ornaments, these simplified datatypes preserve the recursive structure of the original, but unlike ornaments we focus on information-preserving bidirectional transformations. Ghostbuster generates type-safe conversion functions between the original and simplified datatypes, which we prove are the identity function when composed. We evaluate a prototype tool for Haskell against thousands of GADTs found on the Hackage package database, generating simpler Haskell'98 datatypes and round-trip conversion functions between the two.","PeriodicalId":336660,"journal":{"name":"Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132269512","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}

引用次数: 5

Queueing and glueing for optimal partitioning (functional pearl) 最优分区的排队和粘合(功能珍珠)

Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming Pub Date : 2016-09-04 DOI: 10.1145/2951913.2951923

Shin-Cheng Mu, Yu-Hsi Chiang, Yu-Han Lyu

引用次数: 0

Context-free session types 无关上下文的会话类型

Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming Pub Date : 2016-09-04 DOI: 10.1145/2951913.2951926

Peter Thiemann, V. Vasconcelos

引用次数: 42

Automatically disproving fair termination of higher-order functional programs 自动证明高阶函数程序的公平终止

Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming Pub Date : 2016-09-04 DOI: 10.1145/2951913.2951919

Keiichi Watanabe, Ryosuke Sato, Takeshi Tsukada, N. Kobayashi

引用次数: 6

String diagrams for free monads (functional pearl) 自由单子的字符串图(功能珍珠)

Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming Pub Date : 2016-09-04 DOI: 10.1145/2951913.2951947

Maciej Piróg, Nicolas Wu

引用次数: 4

A new verified compiler backend for CakeML 一个新的经过验证的CakeML编译器后端

Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming Pub Date : 2016-09-04 DOI: 10.1145/2951913.2951924

Yong Kiam Tan, Magnus O. Myreen, Ramana Kumar, A. Fox, Scott Owens, Michael Norrish

引用次数: 71