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

Environments and the complexity of abstract machines 环境和抽象机器的复杂性

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

Beniamino Accattoli, Bruno Barras

{"title":"Environments and the complexity of abstract machines","authors":"Beniamino Accattoli, Bruno Barras","doi":"10.1145/3131851.3131855","DOIUrl":"https://doi.org/10.1145/3131851.3131855","url":null,"abstract":"Abstract machines for functional languages rely on the notion of environment, a data structure storing the previously encountered and delayed beta-redexes. This paper provides a close analysis of the different approaches to define and implement environments. There are two main styles. The most common one is to have many local environments, one for every piece of code in the data structures of the machine. A minority of works instead uses a single global environment. Up to now, the two approaches have been considered equivalent, in particular at the level of the complexity of the overhead: they have both been used to obtain bilinear bounds, that is, linear in the number of beta steps and in the size of the initial term. We start by having a close look on global environments and how to implement them. Then we show that local environments admit implementations that are asymptotically faster than global environments, lowering the dependency from the size of the initial term from linear to logarithmic, thus improving the bounds in the literature. We then focus on a third style, split environments, that are in between local and global ones, and have the benefits of both. Finally, we provide a call-by-need machine with split environments for which we prove the new improved bounds on the overhead.","PeriodicalId":148157,"journal":{"name":"Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming","volume":"66 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":"131396806","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}

引用次数: 34

Accessing biological data as Prolog facts 访问作为Prolog事实的生物数据

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

N. Angelopoulos, J. Wielemaker

{"title":"Accessing biological data as Prolog facts","authors":"N. Angelopoulos, J. Wielemaker","doi":"10.1145/3131851.3131857","DOIUrl":"https://doi.org/10.1145/3131851.3131857","url":null,"abstract":"It has been argued before that Prolog is a strong candidate for research and code development in bioinformatics and computational biology. This position has been based on both the intrinsic strengths of Prolog and recent advances in its technologies. Here we strengthen the case for the deployment and penetration of Prolog into bioinformatics, by introducing bio_db, a comprehensive and extensible system for working with biological data. Our library packages high quality, publicly available biological databases that are routinely used in tasks such as: (a) the translation between biological products and (b) product-to-product interactions which can be visualised as graphs. This library allows easy access to these data in five formats: Prolog fact files, Prolog quick load files, Berkeley DB data files, RocksDB and SQLite databases. In addition, the library introduces two innovative features that are pertinent to data analytics in general. First, on-demand downloading of prepacked data files as well as reconstruction from latest data files from the curated databases are supported. Second, by employing code hot-swapping the library delivers the data: (a) transparently to the user and (b) in the familiar format of Prolog facts.","PeriodicalId":148157,"journal":{"name":"Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming","volume":"7 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":"134460449","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}

引用次数: 2

Characterization of strong normalizability for a sequent lambda calculus with co-control 具有共同控制的序列λ演算的强归一化性质

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

J. E. Santo, S. Ghilezan

引用次数: 2

Machine fusion: merging merges, more or less 机器融合:合并合并，或多或少

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

Amos Robinson, B. Lippmeier

引用次数: 0

Shrink fast correctly! 正确快速收缩!

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

Olivier Savary Bélanger, A. Appel

{"title":"Shrink fast correctly!","authors":"Olivier Savary Bélanger, A. Appel","doi":"10.1145/3131851.3131859","DOIUrl":"https://doi.org/10.1145/3131851.3131859","url":null,"abstract":"Function inlining, case-folding, projection-folding, and dead-variable elimination are important code transformations in virtually every functional-language compiler. When one of these reductions strictly reduces the size of the program (e.g., when the inlined function has only one applied occurrence), we call it a shrink reduction. Appel and Jim [1] introduced an algorithm to perform all shrink reductions (producing a shrink normal form) in quasilinear time. They proved confluence but not correctness. We have implemented this algorithm as part of an end-to-end verified compiler for Gallina, the specification language of the Coq theorem prover. We have given the first proofs of these properties: correctness with respect to contextual equivalence, reduction (in one pass) of all administrative redexes with one applied occurrence introduced by CPS conversion, and termination. The correctness and termination proofs are machine-checked in Coq. Because we use a pure functional language without imperative array update, our implementation is O(N log N) rather than O(N). Still, it's quite fast: we give performance results on some nontrivial benchmarks.","PeriodicalId":148157,"journal":{"name":"Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming","volume":"22 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":"115273994","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}

引用次数: 8

Function definitions for compound values in object-oriented languages 面向对象语言中复合值的函数定义

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

J. Chrzaszcz, Aleksy Schubert

引用次数: 1

Attribute grammars with set attributes and global constraints as a unifying framework for planning domain models 具有集合属性和全局约束的属性语法，作为规划领域模型的统一框架

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

R. Barták, A. Maillard

引用次数: 10

Selective unification in constraint logic programming 约束逻辑规划中的选择性统一

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

F. Mesnard, Étienne Payet, G. Vidal

引用次数: 4

Conditional narrowing modulo SMT and axioms 条件窄化模SMT及其公理

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

Luis Aguirre, N. Martí-Oliet, Miguel Palomino, I. Pita

引用次数: 4

Copattern matching and first-class observations in OCaml, with a macro OCaml中的模式匹配和一级观察，带有宏

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

Paul Laforgue, Yann Régis-Gianas

引用次数: 9