Proceedings of the 18th ACM SIGPLAN international conference on Functional programming最新文献_第5页

Experience report: functional programming of mHealth applications 经验报告:移动健康应用的函数式编程

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming Pub Date : 2013-09-25 DOI: 10.1145/2500365.2500615

C. Petersen, M. Görges, D. Dunsmuir, J. Ansermino, G. Dumont

引用次数: 24

The bedrock structured programming system: combining generative metaprogramming and hoare logic in an extensible program verifier 基础结构化编程系统:在可扩展的程序验证器中结合生成元编程和hoare逻辑

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming Pub Date : 2013-09-25 DOI: 10.1145/2500365.2500592

A. Chlipala

{"title":"The bedrock structured programming system: combining generative metaprogramming and hoare logic in an extensible program verifier","authors":"A. Chlipala","doi":"10.1145/2500365.2500592","DOIUrl":"https://doi.org/10.1145/2500365.2500592","url":null,"abstract":"We report on the design and implementation of an extensible programming language and its intrinsic support for formal verification. Our language is targeted at low-level programming of infrastructure like operating systems and runtime systems. It is based on a cross-platform core combining characteristics of assembly languages and compiler intermediate languages. From this foundation, we take literally the saying that C is a \"macro assembly language\": we introduce an expressive notion of certified low-level macros, sufficient to build up the usual features of C and beyond as macros with no special support in the core. Furthermore, our macros have integrated support for strongest postcondition calculation and verification condition generation, so that we can provide a high-productivity formal verification environment within Coq for programs composed from any combination of macros. Our macro interface is expressive enough to support features that low-level programs usually only access through external tools with no formal guarantees, such as declarative parsing or SQL-inspired querying. The abstraction level of these macros only imposes a compile-time cost, via the execution of functional Coq programs that compute programs in our intermediate language; but the run-time cost is not substantially greater than for more conventional C code. We describe our experiences constructing a full C-like language stack using macros, with some experiments on the verifiability and performance of individual programs running on that stack.","PeriodicalId":20504,"journal":{"name":"Proceedings of the 18th ACM SIGPLAN international conference on Functional programming","volume":"20 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2013-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84933973","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}

引用次数: 108

Calculating threesomes, with blame 算计三人行，带着责备

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming Pub Date : 2013-09-25 DOI: 10.1145/2500365.2500603

Ronald Garcia

引用次数: 31

Functional geometry and the Traité de Lutherie: functional pearl 功能几何与卢瑟里特征:功能珍珠

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming Pub Date : 2013-09-25 DOI: 10.1145/2500365.2500617

Harry G. Mairson

{"title":"Functional geometry and the Traité de Lutherie: functional pearl","authors":"Harry G. Mairson","doi":"10.1145/2500365.2500617","DOIUrl":"https://doi.org/10.1145/2500365.2500617","url":null,"abstract":"We describe a functional programming approach to the design of outlines of eighteenth-century string instruments. The approach is based on the research described in François Denis's book, Traité de lutherie. The programming vernacular for Denis's instructions, which we call functional geometry, is meant to reiterate the historically justified language and techniques of this musical instrument design. The programming metaphor is entirely Euclidean, involving straightedge and compass constructions, with few (if any) numbers, and no Cartesian equations or grid. As such, it is also an interesting approach to teaching programming and mathematics without numerical calculation or equational reasoning. The advantage of this language-based, functional approach to lutherie is founded in the abstract characterization of common patterns in instrument design. These patterns include not only the abstraction of common straightedge and compass constructions, but of higher-order conceptualization of the instrument design process. We also discuss the role of arithmetic, geometric, harmonic, and subharmonic proportions, and the use of their rational approximants.","PeriodicalId":20504,"journal":{"name":"Proceedings of the 18th ACM SIGPLAN international conference on Functional programming","volume":"47 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2013-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88565047","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}

引用次数: 4

System FC with explicit kind equality 具有显式类相等的系统FC

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming Pub Date : 2013-09-25 DOI: 10.1145/2500365.2500599

Stephanie Weirich, Justin Hsu, R. Eisenberg

引用次数: 49

Optimising purely functional GPU programs 优化纯功能GPU程序

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming Pub Date : 2013-09-25 DOI: 10.1145/2500365.2500595

T. L. McDonell

引用次数: 97

A nanopass framework for commercial compiler development 用于商业编译器开发的纳米框架

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming Pub Date : 2013-09-25 DOI: 10.1145/2500365.2500618

Andrew W. Keep, R. Dybvig

{"title":"A nanopass framework for commercial compiler development","authors":"Andrew W. Keep, R. Dybvig","doi":"10.1145/2500365.2500618","DOIUrl":"https://doi.org/10.1145/2500365.2500618","url":null,"abstract":"Contemporary compilers must typically handle sophisticated high-level source languages, generate efficient code for multiple hardware architectures and operating systems, and support source-level debugging, profiling, and other program development tools. As a result, compilers tend to be among the most complex of software systems. Nanopass frameworks are designed to help manage this complexity. A nanopass compiler is comprised of many single-task passes with formally defined intermediate languages. The perceived downside of a nanopass compiler is that the extra passes will lead to substantially longer compilation times. To determine whether this is the case, we have created a plug replacement for the commercial Chez Scheme compiler, implemented using an updated nanopass framework, and we have compared the speed of the new compiler and the code it generates against the original compiler for a large set of benchmark programs. This paper describes the updated nanopass framework, the new compiler, and the results of our experiments. The compiler produces faster code than the original, averaging 15-27% depending on architecture and optimization level, due to a more sophisticated but slower register allocator and improvements to several optimizations. Compilation times average well within a factor of two of the original compiler, despite the slower register allocator and the replacement of five passes of the original 10 with over 50 nanopasses.","PeriodicalId":20504,"journal":{"name":"Proceedings of the 18th ACM SIGPLAN international conference on Functional programming","volume":"7 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2013-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83220427","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}

引用次数: 28

Verified decision procedures for MSO on words based on derivatives of regular expressions 验证了基于正则表达式导数的词的MSO决策程序

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming Pub Date : 2013-09-25 DOI: 10.1145/2500365.2500612

Dmitriy Traytel, T. Nipkow

{"title":"Verified decision procedures for MSO on words based on derivatives of regular expressions","authors":"Dmitriy Traytel, T. Nipkow","doi":"10.1145/2500365.2500612","DOIUrl":"https://doi.org/10.1145/2500365.2500612","url":null,"abstract":"Monadic second-order logic on finite words (MSO) is a decidable yet expressive logic into which many decision problems can be encoded. Since MSO formulas correspond to regular languages, equivalence of MSO formulas can be reduced to the equivalence of some regular structures (e.g. automata). This paper presents a verified functional decision procedure for MSO formulas that is not based on automata but on regular expressions. Functional languages are ideally suited for this task: regular expressions are data types and functions on them are defined by pattern matching and recursion and are verified by structural induction. Decision procedures for regular expression equivalence have been formalized before, usually based on Brzozowski derivatives. Yet, for a straightforward embedding of MSO formulas into regular expressions an extension of regular expressions with a projection operation is required. We prove total correctness and completeness of an equivalence checker for regular expressions extended in that way. We also define a language-preserving translation of formulas into regular expressions with respect to two different semantics of MSO. Our results have been formalized and verified in the theorem prover Isabelle. Using Isabelle's code generation facility, this yields purely functional, formally verified programs that decide equivalence of MSO formulas.","PeriodicalId":20504,"journal":{"name":"Proceedings of the 18th ACM SIGPLAN international conference on Functional programming","volume":"7 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2013-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89975260","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

Productive coprogramming with guarded recursion 带保护递归的高效协同编程

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming Pub Date : 2013-09-25 DOI: 10.1145/2500365.2500597

R. Atkey, Conor McBride

{"title":"Productive coprogramming with guarded recursion","authors":"R. Atkey, Conor McBride","doi":"10.1145/2500365.2500597","DOIUrl":"https://doi.org/10.1145/2500365.2500597","url":null,"abstract":"Total functional programming offers the beguiling vision that, just by virtue of the compiler accepting a program, we are guaranteed that it will always terminate. In the case of programs that are not intended to terminate, e.g., servers, we are guaranteed that programs will always be productive. Productivity means that, even if a program generates an infinite amount of data, each piece will be generated in finite time. The theoretical underpinning for productive programming with infinite output is provided by the category theoretic notion of final coalgebras. Hence, we speak of coprogramming with non-well-founded codata, as a dual to programming with well-founded data like finite lists and trees. Systems that offer facilities for productive coprogramming, such as the proof assistants Coq and Agda, currently do so through syntactic guardedness checkers. Syntactic guardedness checkers ensure that all self-recursive calls are guarded by a use of a constructor. Such a check ensures productivity. Unfortunately, these syntactic checks are not compositional, and severely complicate coprogramming. Guarded recursion, originally due to Nakano, is tantalising as a basis for a flexible and compositional type-based approach to coprogramming. However, as we show, by itself, guarded recursion is not suitable for coprogramming due to the fact that there is no way to make finite observations on pieces of infinite data. In this paper, we introduce the concept of clock variables that index Nakano's guarded recursion. Clock variables allow us to \"close over\" the generation of infinite data, and to make finite observations, something that is not possible with guarded recursion alone.","PeriodicalId":20504,"journal":{"name":"Proceedings of the 18th ACM SIGPLAN international conference on Functional programming","volume":"6 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2013-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74045946","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}

引用次数: 88

Functional reactive programming with liveness guarantees 具有活动性保证的函数式响应式编程

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming Pub Date : 2013-09-25 DOI: 10.1145/2500365.2500584

A. Jeffrey

引用次数: 12