ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming最新文献

Issues in ethical data management 道德数据管理的问题

ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming Pub Date : 2017-10-09 DOI: 10.1145/3131851.3131854

S. Abiteboul

引用次数: 3

Experimental Evaluation of a State-Of-The-Art Grounder 一个最先进的滚地球的实验评价

ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming Pub Date : 2014-09-08 DOI: 10.1145/2643135.2643149

J. Jansen, Ingmar Dasseville, Jo Devriendt, Gerda Janssens

{"title":"Experimental Evaluation of a State-Of-The-Art Grounder","authors":"J. Jansen, Ingmar Dasseville, Jo Devriendt, Gerda Janssens","doi":"10.1145/2643135.2643149","DOIUrl":"https://doi.org/10.1145/2643135.2643149","url":null,"abstract":"Many state-of-the-art declarative systems use a ground-and-solve approach, where the problem statement, expressed in a high-level language, is first grounded into a low-level representation. Next, a solver is used to search a solution for the low-level representation. In order to prevent a combinatorial blowup of the grounding, many intelligent techniques have been developed. In this paper we study in detail three such techniques (Lifted Unit Propagation, Grounding With Bounds, and Reduced Grounding) to get a better insight in their individual merits and their interactions. Our experiments take as benchmarks all the NP problems of the previous Answer Set Programming (ASP) competitions. The experiments are performed with IDP3 and all tools needed to run them are made publicly available. The first experiment discusses the impact of the three techniques on the \"efficiency\" of the grounding step, and on each other. In a second set of experiments we show that a reduction in the grounding size as a result of the application of these grounding techniques does not reduce the search space. We give an in-depth analysis of our results and discuss what this means for the development of grounding techniques for declarative systems.","PeriodicalId":448247,"journal":{"name":"ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming","volume":"292 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121087461","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

Lazier Imperative Programming 更懒的命令式编程

ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming Pub Date : 2014-09-08 DOI: 10.1145/2643135.2643159

Rémi Douence, Nicolas Tabareau

{"title":"Lazier Imperative Programming","authors":"Rémi Douence, Nicolas Tabareau","doi":"10.1145/2643135.2643159","DOIUrl":"https://doi.org/10.1145/2643135.2643159","url":null,"abstract":"Laziness is a powerful concept in functional programming that enables reusing general functions in a specific context, while keeping performance close to the efficiency of dedicated definitions. Lazy evaluation can be used in imperative programming too. Twenty years ago, John Launchbury was already advocating for lazy imperative programming, but the level of laziness of his framework remained limited: a single effect can trigger numerous delayed computations, even if those are not required for the correctness of the evaluation. Twenty years after, the picture has not changed. In this article, we propose an Haskell framework to specify computational effects of imperative programs as well as their dependencies. Our framework is based on the operational monad transformer which encapsulates an algebraic presentation of effectful operations. A lazy monad transformer is then in charge of delaying non-necessary computations by maintaining a trace of imperative closures. We present a semantics of a call-by-need λ-calculus extended with imperative strict and lazy features and prove the correctness of our approach. While originally motivated by a less rigid use of foreign functions, we show that our approach is fruitful for a simple scenario based on sorted mutable arrays. Furthermore, we can take advantage of equations between algebraic operations to dynamically optimize imperative computations composition.","PeriodicalId":448247,"journal":{"name":"ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128150647","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

Bidirectional Elaboration of Dependently Typed Programs 依赖类型程序的双向精化

ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming Pub Date : 2014-09-08 DOI: 10.1145/2643135.2643153

Francisco Ferreira, B. Pientka

{"title":"Bidirectional Elaboration of Dependently Typed Programs","authors":"Francisco Ferreira, B. Pientka","doi":"10.1145/2643135.2643153","DOIUrl":"https://doi.org/10.1145/2643135.2643153","url":null,"abstract":"Dependently typed programming languages allow programmers to express a rich set of invariants and verify them statically via type checking. To make programming with dependent types practical, dependently typed systems provide a compact language for programmers where one can omit some arguments, called implicit, which can be inferred. This source language is then usually elaborated into a core language where type checking and fundamental properties such as normalization are well understood. Unfortunately, this elaboration is rarely specified and in general is ill-understood. This makes it not only difficult for programmers to understand why a given program fails to type check, but also is one of the reasons that implementing dependently typed programming systems remains a black art known only to a few.\u0000 In this paper, we specify the design of a source language for a dependently typed programming language where we separate the language of programs from the language of types and terms occurring in types. Total functions in our language correspond directly to first-order inductive proofs over a specific index domain. We then give a bi-directional elaboration algorithm to translate source terms where implicit arguments can be omitted to a fully explicit core language and prove soundness of our elaboration. Our framework provides post-hoc explanation for elaboration found in the programming and proof environment, Beluga.","PeriodicalId":448247,"journal":{"name":"ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125458021","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}

引用次数: 12

Declarative Software Development: Distilled Tutorial 声明式软件开发:精炼教程

ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming Pub Date : 2014-09-08 DOI: 10.1145/2643135.2643163

R. Lämmel, A. Varanovich, Martin Leinberger, Thomas Schmorleiz, J. Favre

引用次数: 3

A Type Theoretic Specification of Partial Evaluation 部分求值的一种类型理论规范

ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming Pub Date : 2014-09-08 DOI: 10.1145/2643135.2643146

K. Asai, L. Fennell, Peter Thiemann, Yang Zhang

引用次数: 3

Bijective Collection Encodings and Boolean Operations with Hereditarily Binary Natural Numbers 具有遗传二进制自然数的双目标集合编码和布尔运算

ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming Pub Date : 2014-09-08 DOI: 10.1145/2643135.2643139

Paul Tarau

引用次数: 5

BiFluX: A Bidirectional Functional Update Language for XML BiFluX:用于XML的双向函数更新语言

ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming Pub Date : 2014-09-08 DOI: 10.1145/2643135.2643141

Hugo Pacheco, Tao Zan, Zhenjiang Hu

{"title":"BiFluX: A Bidirectional Functional Update Language for XML","authors":"Hugo Pacheco, Tao Zan, Zhenjiang Hu","doi":"10.1145/2643135.2643141","DOIUrl":"https://doi.org/10.1145/2643135.2643141","url":null,"abstract":"Different XML formats are widely used for data exchange and processing, being often necessary to mutually convert between them. Standard XML transformation languages, like XSLT or XQuery, are unsatisfactory for this purpose since they require writing a separate transformation for each direction. Existing bidirectional transformation languages mean to cover this gap, by allowing programmers to write a single program that denotes both transformations. However, they often 1) induce a more cumbersome programming style than their traditionally unidirectional relatives, to establish the link between source and target formats, and 2) offer limited configurability, by making implicit assumptions about how modifications to both formats should be translated that may not be easy to predict.\u0000 This paper proposes a bidirectional XML update language called BIFLUX (BIdirectional FunctionaL Updates for XML), inspired by the FLUX XML update language. Our language adopts a novel bidirectional programming by update paradigm, where a program succinctly and precisely describes how to update a source document with a target document, in an intuitive way, such that there is a unique \"inverse\" source query for each update program. BIFLUX extends FLUX with bidirectional actions that describe the connection between source and target formats. We introduce a core BIFLUX language, with a clear and well-behaved bidirectional semantics and a decidable static type system based on regular expression types.","PeriodicalId":448247,"journal":{"name":"ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133563617","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

Proofs in continuation-passing style: normalization of Gödel's System T extended with sums and delimited control operators: Distilled Tutorial 连续传递风格的证明:用和和分隔控制算子扩展的Gödel系统T的规范化:精炼教程

ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming Pub Date : 2014-09-08 DOI: 10.1145/2643135.2643161

Danko Ilik

引用次数: 0

On Combining Backward and Forward Chaining in Constraint Logic Programming 约束逻辑规划中前后链结合的研究

ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming Pub Date : 2014-09-08 DOI: 10.1145/2643135.2643144

Rémy Haemmerlé

引用次数: 3