Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming最新文献_第2页

Alpha-renaming of higher-order meta-expressions 高阶元表达式的alpha重命名

Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming Pub Date : 2017-10-09 DOI: 10.1145/3131851.3131866

David Sabel

引用次数: 2

Causally consistent reversible choreographies: a monitors-as-memories approach 因果一致的可逆编排:监视器作为记忆的方法

Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming Pub Date : 2017-10-09 DOI: 10.1145/3131851.3131864

C. A. Mezzina, Jorge A. Pérez

引用次数: 18

Expressive and strongly type-safe code generation 表达性和强类型安全的代码生成

Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming Pub Date : 2017-10-09 DOI: 10.1145/3131851.3131872

T. Winant, Jesper Cockx, Dominique Devriese

{"title":"Expressive and strongly type-safe code generation","authors":"T. Winant, Jesper Cockx, Dominique Devriese","doi":"10.1145/3131851.3131872","DOIUrl":"https://doi.org/10.1145/3131851.3131872","url":null,"abstract":"Meta-programs are programs that generate other programs, but in weakly type-safe systems, type-checking a meta-program only establishes its own type safety, and generated programs need additional type-checking after generation. Strong type safety of a meta-program implies type safety of any generated object program, a property with important engineering benefits. Current strongly type-safe systems suffer from expressivity limitations and cannot support many meta-programs found in practice, for example automatic generation of lenses. To overcome this, we move away from the idea of staged meta-programming. Instead, we use an off-the-shelf dependently-typed language as the meta-language and a relatively standard, intrinsically well-typed representation of the object language. We scale this approach to practical meta-programming, by choosing a high-level, explicitly typed intermediate representation as the object language, rather than a surface programming language. We implement our approach as a library for the Glasgow Haskell Compiler (GHC) and evaluate it on several meta-programs, including a deriveLenses meta-program taken from a real-world Haskell lens library. Our evaluation demonstrates expressivity beyond the state of the art and applicability to real settings, at little cost in terms of code size.","PeriodicalId":148157,"journal":{"name":"Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121730152","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}

引用次数: 1

Theory learning with symmetry breaking 对称性破缺的理论学习

Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming Pub Date : 2017-10-09 DOI: 10.1145/3131851.3131861

J. M. Howe, E. Robbins, A. King

引用次数: 0

Defunctionalisation as modular closure conversion 作为模块闭包转换的去功能化

Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming Pub Date : 2017-10-09 DOI: 10.1145/3131851.3131868

Ulrich Schöpp

{"title":"Defunctionalisation as modular closure conversion","authors":"Ulrich Schöpp","doi":"10.1145/3131851.3131868","DOIUrl":"https://doi.org/10.1145/3131851.3131868","url":null,"abstract":"We study the problem of translating from call-by-value pcf to a first-order low-level language. Such translations are typically defined by induction on the structure of the source term. Each sub-term is translated to a low-level program fragment and the translation of the whole term is a composition of these fragments. It is desirable to follow this compositional approach also in reasoning about such translations, e.g. to show correctness of the translation by verifying the low-level fragments individually. In this paper, we define a defunctionalisation method in which the low-level program fragments are considered as little modules with a well-defined interface. We show correctness of the translation by decomposing it into a number of steps that each allows compositional reasoning. The main step is a typed closure conversion that translates pcf into a calculus based on interaction semantics. It takes into account low-level information, e.g. on closure representation and stack shape, that is obtained by global program analysis. We capture such information using an annotated type system for pcf and show that suitable annotations can be computed by type inference.","PeriodicalId":148157,"journal":{"name":"Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134411227","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}

引用次数: 3

A core calculus for provenance inspection 原产地检验的核心演算

Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming Pub Date : 2017-10-09 DOI: 10.1145/3131851.3131871

W. Ricciotti

引用次数: 5

Verifiable semantic difference languages 可验证语义差异语言

Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming Pub Date : 2017-10-09 DOI: 10.1145/3131851.3131870

Thibaut Girka, David Mentré, Yann Régis-Gianas

{"title":"Verifiable semantic difference languages","authors":"Thibaut Girka, David Mentré, Yann Régis-Gianas","doi":"10.1145/3131851.3131870","DOIUrl":"https://doi.org/10.1145/3131851.3131870","url":null,"abstract":"Program differences are usually represented as textual differences on source code with no regard to its syntax or its semantics. In this paper, we introduce semantic-aware difference languages. A difference denotes a relation between program reduction traces. A difference language for the toy imperative programming language Imp is given as an illustration. To certify software evolutions, we want to mechanically verify that a difference correctly relates two given programs. Product programs and correlating programs are effective proof techniques for relational reasoning. A product program simulates, in the same programming language as the compared programs, a well-chosen interleaving of their executions to highlight a specific relation between their reduction traces. While this approach enables the use of readily-available static analysis tools on the product program, it also has limitations: a product program will crash whenever one of the two programs under consideration crashes, thus making it unsuitable to characterize a patch fixing a safety issue. We replace product programs by correlating oracles which need not be expressed in the same programming language as the compared programs. This allows designing correlating oracle languages specific to certain classes of program changes and capable of relating crashing programs with non-crashing ones. Thanks to oracles, the primitive differences of our difference language on Imp can be assigned a verifiable semantics. Besides, each class of oracles comes with a specific proof scheme which simplifies relational reasoning for a well-specified class of relations. We also prove that our framework is at least as expressive as several Relational Hoare Logic variants by encoding them as correlating oracles, (re)proving soundness of those variants in the process. The entirety of the framework as well as its instantiations have been defined and proved correct using the Coq proof assistant.","PeriodicalId":148157,"journal":{"name":"Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114931198","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

Practical evaluation of the Lasp programming model at large scale: an experience report 大规模Lasp编程模型的实际评估:经验报告

Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming Pub Date : 2017-08-21 DOI: 10.1145/3131851.3131862

Christopher S. Meiklejohn, Vitor Enes, Junghun Yoo, Carlos Baquero, P. V. Roy, Annette Bieniusa

引用次数: 10

A verification technique for deterministic parallel programs 确定性并行程序的验证技术

Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming Pub Date : 2017-05-16 DOI: 10.1145/3131851.3131852

Saeed Darabi, S. Blom, M. Huisman

引用次数: 10

Programming by examples: applications, algorithms, and ambiguity resolution 示例编程:应用程序、算法和歧义解决

Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming Pub Date : 2016-06-27 DOI: 10.1145/3131851.3131853

Sumit Gulwani

{"title":"Programming by examples: applications, algorithms, and ambiguity resolution","authors":"Sumit Gulwani","doi":"10.1145/3131851.3131853","DOIUrl":"https://doi.org/10.1145/3131851.3131853","url":null,"abstract":"99% of computer users do not know programming and hence struggle with repetitive tasks. Programming by Examples (PBE) can revolutionize this landscape by enabling users to synthesize intended programs from example based specifications. A key technical challenge in PBE is to search for programs that are consistent with the examples provided by the user. Our efficient search methodology is based on two key ideas: (i) Restriction of the search space to an appropriate domain-specific language (ii) A divide-and-conquer based search paradigm that inductively reduces the problem of synthesizing a program with a certain top-level operator to simpler synthesis problems over its sub-programs by leveraging the operator's inverse semantics. Another challenge in PBE is to resolve the ambiguity in the example based specification. Our ambiguity resolution methodology leverages two complementary approaches: (a) machine learning based ranking techniques that can pick an intended program from among those that satisfy the specification, and (b) active-learning based user interaction models. I will illustrate these various concepts using Flash Fill, FlashExtract, and FlashRelate---PBE technologies for data manipulation domains. These technologies, which have been released inside various Microsoft products, are useful for data scientists who spend 80% of their time wrangling with data. The Microsoft PROSE SDK allows easy construction of such technologies.","PeriodicalId":148157,"journal":{"name":"Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121047754","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}

引用次数: 50