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

Allocation characterizes polyvariance: a unified methodology for polyvariant control-flow analysis 分配是多方差的特征:多变量控制流分析的统一方法

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

Thomas Gilray, Michael D. Adams, M. Might

{"title":"Allocation characterizes polyvariance: a unified methodology for polyvariant control-flow analysis","authors":"Thomas Gilray, Michael D. Adams, M. Might","doi":"10.1145/2951913.2951936","DOIUrl":"https://doi.org/10.1145/2951913.2951936","url":null,"abstract":"The polyvariance of a static analysis is the degree to which it structurally differentiates approximations of program values. Polyvariant techniques come in a number of different flavors that represent alternative heuristics for managing the trade-off an analysis strikes between precision and complexity. For example, call sensitivity supposes that values will tend to correlate with recent call sites, object sensitivity supposes that values will correlate with the allocation points of related objects, the Cartesian product algorithm supposes correlations between the values of arguments to the same function, and so forth. In this paper, we describe a unified methodology for implementing and understanding polyvariance in a higher-order setting (i.e., for control-flow analyses). We do this by extending the method of abstracting abstract machines (AAM), a systematic approach to producing an abstract interpretation of abstract-machine semantics. AAM eliminates recursion within a language’s semantics by passing around an explicit store, and thus places importance on the strategy an analysis uses for allocating abstract addresses within the abstract heap or store. We build on AAM by showing that the design space of possible abstract allocators exactly and uniquely corresponds to the design space of polyvariant strategies. This allows us to both unify and generalize polyvariance as tunings of a single function. Changes to the behavior of this function easily recapitulate classic styles of analysis and produce novel variations, combinations of techniques, and fundamentally new techniques.","PeriodicalId":336660,"journal":{"name":"Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming","volume":"41 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":"114700940","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}

引用次数: 24

Unifiers as equivalences: proof-relevant unification of dependently typed data 作为等价的统一器:证明相关的独立类型数据的统一

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

Jesper Cockx, Dominique Devriese, F. Piessens

{"title":"Unifiers as equivalences: proof-relevant unification of dependently typed data","authors":"Jesper Cockx, Dominique Devriese, F. Piessens","doi":"10.1145/2951913.2951917","DOIUrl":"https://doi.org/10.1145/2951913.2951917","url":null,"abstract":"Dependently typed languages such as Agda, Coq and Idris use a syntactic first-order unification algorithm to check definitions by dependent pattern matching. However, these algorithms don’t adequately consider the types of the terms being unified, leading to various unintended results. As a consequence, they require ad hoc restrictions to preserve soundness, but this makes them very hard to prove correct, modify, or extend. This paper proposes a framework for reasoning formally about unification in a dependently typed setting. In this framework, unification rules compute not just a unifier but also a corresponding correctness proof in the form of an equivalence between two sets of equations. By rephrasing the standard unification rules in a proof-relevant manner, they are guaranteed to preserve soundness of the theory. In addition, it enables us to safely add new rules that can exploit the dependencies between the types of equations. Using our framework, we reimplemented the unification algorithm used by Agda. As a result, we were able to replace previous ad hoc restrictions with formally verified unification rules, fixing a number of bugs in the process. We are convinced this will also enable the addition of new and interesting unification rules in the future, without compromising soundness along the way.","PeriodicalId":336660,"journal":{"name":"Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming","volume":"37 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":"114976232","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}

引用次数: 15

Farms, pipes, streams and reforestation: reasoning about structured parallel processes using types and hylomorphisms 农场、管道、溪流和重新造林:使用类型和同源推理结构化并行过程

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

David Castro, K. Hammond, Susmit Sarkar

{"title":"Farms, pipes, streams and reforestation: reasoning about structured parallel processes using types and hylomorphisms","authors":"David Castro, K. Hammond, Susmit Sarkar","doi":"10.1145/2951913.2951920","DOIUrl":"https://doi.org/10.1145/2951913.2951920","url":null,"abstract":"The increasing importance of parallelism has motivated the creation of better abstractions for writing parallel software, including structured parallelism using nested algorithmic skeletons. Such approaches provide high-level abstractions that avoid common problems, such as race conditions, and often allow strong cost models to be defined. However, choosing a combination of algorithmic skeletons that yields good parallel speedups for a program on some specific parallel architecture remains a difficult task. In order to achieve this, it is necessary to simultaneously reason both about the costs of different parallel structures and about the semantic equivalences between them. This paper presents a new type-based mechanism that enables strong static reasoning about these properties. We exploit well-known properties of a very general recursion pattern, hylomorphisms, and give a denotational semantics for structured parallel processes in terms of these hylomorphisms. Using our approach, it is possible to determine formally whether it is possible to introduce a desired parallel structure into a program without altering its functional behaviour, and also to choose a version of that parallel structure that minimises some given cost model.","PeriodicalId":336660,"journal":{"name":"Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming","volume":"138 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":"134400668","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

Elaborator reflection: extending Idris in Idris 阐释者反思:在伊德里斯中延伸伊德里斯

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

D. Christiansen, Edwin C. Brady

引用次数: 39

A fully concurrent garbage collector for functional programs on multicore processors 多核处理器上功能程序的完全并发垃圾收集器

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

Katsuhiro Ueno, A. Ohori

引用次数: 9

Compact bit encoding schemes for simply-typed lambda-terms 用于简单类型lambda项的紧凑位编码方案

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

Kotaro Takeda, N. Kobayashi, Kazuya Yaguchi, A. Shinohara

引用次数: 3

Partial type equivalences for verified dependent interoperability 经过验证的依赖互操作性的部分类型等价

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

Pierre-Évariste Dagand, Nicolas Tabareau, É. Tanter

{"title":"Partial type equivalences for verified dependent interoperability","authors":"Pierre-Évariste Dagand, Nicolas Tabareau, É. Tanter","doi":"10.1145/2951913.2951933","DOIUrl":"https://doi.org/10.1145/2951913.2951933","url":null,"abstract":"Full-spectrum dependent types promise to enable the development of correct-by-construction software. However, even certified software needs to interact with simply-typed or untyped programs, be it to perform system calls, or to use legacy libraries. Trading static guarantees for runtime checks, the dependent interoperability framework provides a mechanism by which simply-typed values can safely be coerced to dependent types and, conversely, dependently-typed programs can defensively be exported to a simply-typed application. In this paper, we give a semantic account of dependent interoperability. Our presentation relies on and is guided by a pervading notion of type equivalence, whose importance has been emphasized in recent work on homotopy type theory. Specifically, we develop the notion of partial type equivalences as a key foundation for dependent interoperability. Our framework is developed in Coq; it is thus constructive and verified in the strictest sense of the terms. Using our library, users can specify domain-specific partial equivalences between data structures. Our library then takes care of the (sometimes, heavy) lifting that leads to interoperable programs. It thus becomes possible, as we shall illustrate, to internalize and hand-tune the extraction of dependently-typed programs to interoperable OCaml programs within Coq itself.","PeriodicalId":336660,"journal":{"name":"Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming","volume":"2 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":"117151642","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}

引用次数: 13

Talking bananas: structural recursion for session types 会话类型的结构递归

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

S. Lindley, J. Garrett Morris

{"title":"Talking bananas: structural recursion for session types","authors":"S. Lindley, J. Garrett Morris","doi":"10.1145/2951913.2951921","DOIUrl":"https://doi.org/10.1145/2951913.2951921","url":null,"abstract":"Session types provide static guarantees that concurrent programs respect communication protocols. We give a novel account of recursive session types in the context of GV, a small concurrent extension of the linear λ-calculus. We extend GV with recursive types and catamorphisms, following the initial algebra semantics of recursion, and show that doing so naturally gives rise to recursive session types. We show that this principled approach to recursion resolves long-standing problems in the treatment of duality for recursive session types. We characterize the expressiveness of GV concurrency by giving a CPS translation to (non-concurrent) λ-calculus and proving that reduction in GV is simulated by full reduction in λ-calculus. This shows that GV remains terminating in the presence of positive recursive types, and that such arguments extend to other extensions of GV, such as polymorphism or non-linear types, by appeal to normalization results for sequential λ-calculi. We also show that GV remains deadlock free and deterministic in the presence of recursive types. Finally, we extend CP, a session-typed process calculus based on linear logic, with recursive types, and show that doing so preserves the connection between reduction in GV and cut elimination in CP.","PeriodicalId":336660,"journal":{"name":"Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming","volume":"110 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":"131492945","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}

引用次数: 67

Higher-order ghost state 高阶虚态

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

Ralf Jung, R. Krebbers, L. Birkedal, Derek Dreyer

引用次数: 112

Disjoint intersection types 不相交相交类型

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

B. C. D. S. Oliveira, Zhiyuan Shi, J. Alpuim

{"title":"Disjoint intersection types","authors":"B. C. D. S. Oliveira, Zhiyuan Shi, J. Alpuim","doi":"10.1145/2951913.2951945","DOIUrl":"https://doi.org/10.1145/2951913.2951945","url":null,"abstract":"Dunfield showed that a simply typed core calculus with intersection types and a merge operator is able to capture various programming language features. While his calculus is type-safe, it is not coherent: different derivations for the same expression can elaborate to expressions that evaluate to different values. The lack of coherence is an important disadvantage for adoption of his core calculus in implementations of programming languages, as the semantics of the programming language becomes implementation-dependent. This paper presents λ_i: a coherent and type-safe calculus with a form of intersection types and a merge operator. Coherence is achieved by ensuring that intersection types are disjoint and programs are sufficiently annotated to avoid type ambiguity. We propose a definition of disjointness where two types A and B are disjoint only if certain set of types are common supertypes of A and B. We investigate three different variants of λ_i, with three variants of disjointness. In the simplest variant, which does not allow ⊤ types, two types are disjoint if they do not share any common supertypes at all. The other two variants introduce ⊤ types and refine the notion of disjointness to allow two types to be disjoint when the only the set of common supertypes are top-like. The difference between the two variants with ⊤ types is on the definition of top-like types, which has an impact on which types are allowed on intersections. We present a type system that prevents intersection types that are not disjoint, as well as an algorithmic specifications to determine whether two types are disjoint for all three variants.","PeriodicalId":336660,"journal":{"name":"Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming","volume":"30 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":"122672894","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}

引用次数: 31