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

Sequent calculus as a compiler intermediate language 作为编译器中间语言的顺序演算

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

P. Downen, Luke Maurer, Z. M. Ariola, Simon Peyton Jones

引用次数: 14

Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming 第21届ACM SIGPLAN函数式编程国际会议论文集

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

Jacques Garrigue, G. Keller, Eijiro Sumii

引用次数: 3

Deriving a probability density calculator (functional pearl) 概率密度计算器的推导(功能珍珠)

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

W. Ismail, Chung-chieh Shan

引用次数: 5

Hierarchical memory management for parallel programs 并行程序的分层内存管理

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

R. Raghunathan, Stefan K. Muller, Umut A. Acar, G. Blelloch

{"title":"Hierarchical memory management for parallel programs","authors":"R. Raghunathan, Stefan K. Muller, Umut A. Acar, G. Blelloch","doi":"10.1145/2951913.2951935","DOIUrl":"https://doi.org/10.1145/2951913.2951935","url":null,"abstract":"An important feature of functional programs is that they are parallel by default. Implementing an efficient parallel functional language, however, is a major challenge, in part because the high rate of allocation and freeing associated with functional programs requires an efficient and scalable memory manager. In this paper, we present a technique for parallel memory management for strict functional languages with nested parallelism. At the highest level of abstraction, the approach consists of a technique to organize memory as a hierarchy of heaps, and an algorithm for performing automatic memory reclamation by taking advantage of a disentanglement property of parallel functional programs. More specifically, the idea is to assign to each parallel task its own heap in memory and organize the heaps in a hierarchy/tree that mirrors the hierarchy of tasks. We present a nested-parallel calculus that specifies hierarchical heaps and prove in this calculus a disentanglement property, which prohibits a task from accessing objects allocated by another task that might execute in parallel. Leveraging the disentanglement property, we present a garbage collection technique that can operate on any subtree in the memory hierarchy concurrently as other tasks (and/or other collections) proceed in parallel. We prove the safety of this collector by formalizing it in the context of our parallel calculus. In addition, we describe how the proposed techniques can be implemented on modern shared-memory machines and present a prototype implementation as an extension to MLton, a high-performance compiler for the Standard ML language. Finally, we evaluate the performance of this implementation on a number of parallel benchmarks.","PeriodicalId":336660,"journal":{"name":"Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming","volume":"22 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":"128374383","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}

引用次数: 35

Refinement through restraint: bringing down the cost of verification 通过约束来改进:降低验证的成本

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

Liam O'Connor, Zilin Chen, C. Rizkallah, Sidney Amani, Japheth Lim, Toby C. Murray, Yutaka Nagashima, Thomas Sewell, G. Klein

{"title":"Refinement through restraint: bringing down the cost of verification","authors":"Liam O'Connor, Zilin Chen, C. Rizkallah, Sidney Amani, Japheth Lim, Toby C. Murray, Yutaka Nagashima, Thomas Sewell, G. Klein","doi":"10.1145/2951913.2951940","DOIUrl":"https://doi.org/10.1145/2951913.2951940","url":null,"abstract":"We present a framework aimed at significantly reducing the cost of verifying certain classes of systems software, such as file systems. Our framework allows for equational reasoning about systems code written in our new language, Cogent. Cogent is a restricted, polymorphic, higher-order, and purely functional language with linear types and without the need for a trusted runtime or garbage collector. Linear types allow us to assign two semantics to the language: one imperative, suitable for efficient C code generation; and one functional, suitable for equational reasoning and verification. As Cogent is a restricted language, it is designed to easily interoperate with existing C functions and to connect to existing C verification frameworks. Our framework is based on certifying compilation: For a well-typed Cogent program, our compiler produces C code, a high-level shallow embedding of its semantics in Isabelle/HOL, and a proof that the C code correctly refines this embedding. Thus one can reason about the full semantics of real-world systems code productively and equationally, while retaining the interoperability and leanness of C. The compiler certificate is a series of language-level proofs and per-program translation validation phases, combined into one coherent top-level theorem in Isabelle/HOL.","PeriodicalId":336660,"journal":{"name":"Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming","volume":"13 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":"127762832","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}

引用次数: 39

Think like a vertex, behave like a function! a functional DSL for vertex-centric big graph processing 像顶点一样思考，像函数一样行动!一个以顶点为中心的大图处理的功能性DSL

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

Kento Emoto, Kiminori Matsuzaki, Zhenjiang Hu, Akimasa Morihata, H. Iwasaki

{"title":"Think like a vertex, behave like a function! a functional DSL for vertex-centric big graph processing","authors":"Kento Emoto, Kiminori Matsuzaki, Zhenjiang Hu, Akimasa Morihata, H. Iwasaki","doi":"10.1145/2951913.2951938","DOIUrl":"https://doi.org/10.1145/2951913.2951938","url":null,"abstract":"The vertex-centric programming model, known as “think like a vertex”, is being used more and more to support various big graph processing methods through iterative supersteps that execute in parallel a user-defined vertex program over each vertex of a graph. However, the imperative and message-passing style of existing systems makes defining a vertex program unintuitive. In this paper, we show that one can benefit more from “Thinking like a vertex” by “Behaving like a function” rather than “Acting like a procedure” with full use of side effects and explicit control of message passing, state, and termination. We propose a functional approach to vertex-centric graph processing in which the computation at every vertex is abstracted as a higher-order function and present Fregel, a new domain-specific language. Fregel has clear functional semantics, supports declarative description of vertex computation, and can be automatically translated into Pregel, an emerging imperative-style distributed graph processing framework, and thereby achieve promising performance. Experimental results for several typical examples show the promise of this functional approach.","PeriodicalId":336660,"journal":{"name":"Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming","volume":"6 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113962033","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}

引用次数: 14

A type theory for incremental computational complexity with control flow changes 控制流变化时增量计算复杂度的类型理论

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

Ezgi Çiçek, Zoe Paraskevopoulou, D. Garg

{"title":"A type theory for incremental computational complexity with control flow changes","authors":"Ezgi Çiçek, Zoe Paraskevopoulou, D. Garg","doi":"10.1145/2951913.2951950","DOIUrl":"https://doi.org/10.1145/2951913.2951950","url":null,"abstract":"Incremental computation aims to speed up re-runs of a program after its inputs have been modified slightly. It works by recording a trace of the program's first run and propagating changes through the trace in incremental runs, trying to re-use as much of the original trace as possible. The recent work CostIt is a type and effect system to establish the time complexity of incremental runs of a program, as a function of input changes. However, CostIt is limited in two ways. First, it prohibits input changes that influence control flow. This makes it impossible to type programs that, for instance, branch on inputs that may change. Second, the soundness of CostIt is proved relative to an abstract cost semantics, but it is unclear how the semantics can be realized. In this paper, we address both these limitations. We present DuCostIt, a re-design of CostIt, that combines reasoning about costs of change propagation and costs of from-scratch evaluation. The latter lifts the restriction on control flow changes. To obtain the type system, we refine Flow Caml, a type system for information flow analysis, with cost effects. Additionally, we inherit from CostIt index refinements to track data structure sizes and a co-monadic type. Using a combination of binary and unary step-indexed logical relations, we prove DuCostIt's cost analysis sound relative to not only an abstract cost semantics, but also a concrete semantics, which is obtained by translation to an ML-like language.","PeriodicalId":336660,"journal":{"name":"Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming","volume":"154 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":"114931685","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}

引用次数: 16

Indexed codata types 索引协数据类型

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

D. Thibodeau, Andrew Cave, B. Pientka

引用次数: 9

An abstract memory functor for verified C static analyzers 经过验证的C静态分析器的抽象内存函子

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

Sandrine Blazy, Vincent Laporte, David Pichardie

引用次数: 5

A glimpse of Hopjs Hopjs的一瞥

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

M. Serrano, Vincent Prunet

引用次数: 43