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

筛选
英文 中文
Parametricity and Proving Free Theorems for Functional-Logic Languages 函数逻辑语言的参数化和自由定理证明
Stefan Mehner, D. Seidel, Lutz Straßburger, J. Voigtländer
{"title":"Parametricity and Proving Free Theorems for Functional-Logic Languages","authors":"Stefan Mehner, D. Seidel, Lutz Straßburger, J. Voigtländer","doi":"10.1145/2643135.2643147","DOIUrl":"https://doi.org/10.1145/2643135.2643147","url":null,"abstract":"The goal of this paper is to provide the required foundations for establishing free theorems -- statements about program equivalence, guaranteed by polymorphic types -- for the functional-logic programming language Curry. For the sake of presentation we restrict ourselves to a language fragment that we call CuMin, and that has the characteristic features of Curry (both functional and logic). We present a new denotational semantics based on partially ordered sets without limits. We then introduce an intermediate language called SaLT that is essentially a lambda-calculus extended with an abstract set type, and again give a denotational semantics. We show that the standard (logical relations) techniques can be applied to obtain a general parametricity theorem for SaLT and derive free theorems from it. Via a translation from CuMin to SaLT that fits the respective semantics, we then derive free theorems for CuMin.","PeriodicalId":448247,"journal":{"name":"ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming","volume":"1 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":"123076971","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}
引用次数: 9
Structure-Preserving Compilation: Efficient Integration of Functional DSLs into Legacy Systems 保留结构的编译:功能性dsl与遗留系统的有效集成
J. Kranz, A. Simon
{"title":"Structure-Preserving Compilation: Efficient Integration of Functional DSLs into Legacy Systems","authors":"J. Kranz, A. Simon","doi":"10.1145/2643135.2643157","DOIUrl":"https://doi.org/10.1145/2643135.2643157","url":null,"abstract":"We present a translation scheme from a pure functional domain-specific language (DSL) to C. The over-arching idea of this scheme is to preserve the structure of the input program as much as possible. This includes, among other things, to refrain from inlining user-written functions and to retain variable names as much as possible. We apply this translation scheme to GDSL, a DSL used for the specification of decoders for machine instructions. GDSL offers non-trivial language features such as monadic actions that our translation scheme maps one-to-one to C statements, resulting in code that closely resembles hand-written C code. Indeed, it is feasible to debug and profile the program at the C level and to interface the generated code with existing C code without marshaling data. Our translation scheme is therefore an attractive starting point for a light-weight DSL since no other language-specific tools besides the compiler are necessary. Moreover, the generated code is amenable to compiler optimizations found in off-the-shelf C compilers. This is illustrated by the performance achieved by a decoder for x86 machine instructions implemented in GDSL which is as fast as a production-quality decoding library shipped by Intel.","PeriodicalId":448247,"journal":{"name":"ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming","volume":"15 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":"117191607","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
Continuations, Processes, and Sharing 延续、过程和共享
P. Downen, Luke Maurer, Z. M. Ariola, Daniele Varacca
{"title":"Continuations, Processes, and Sharing","authors":"P. Downen, Luke Maurer, Z. M. Ariola, Daniele Varacca","doi":"10.1145/2643135.2643155","DOIUrl":"https://doi.org/10.1145/2643135.2643155","url":null,"abstract":"Continuation-passing style (CPS) transforms have long been important tools in the study of programming. They have been shown to correspond to abstract machines and, when combined with a naming transform that expresses shared values, they enjoy a direct correspondence with encodings into process calculi such as the π-calculus. We present our notion of correctness and discuss the sufficient conditions that guarantee the correctness of transforms. We then consider the call-by-value, call-by-name and call-by-need evaluation strategies for the λ-calculus and present their CPS transforms, abstract machines, π-encodings, and proofs of correctness. Our analysis covers a uniform CPS transform, which differentiates the three evaluation strategies only by the treatment of function calls. This leads to a new CPS transform for call-by-need requiring a less expressive form of side effect, which we call constructive update.","PeriodicalId":448247,"journal":{"name":"ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming","volume":"12 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":"126507801","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
On the Preciseness of Subtyping in Session Types 论会话类型中子类型的精确性
Tzu-Chun Chen, M. Dezani-Ciancaglini, A. Scalas, N. Yoshida
{"title":"On the Preciseness of Subtyping in Session Types","authors":"Tzu-Chun Chen, M. Dezani-Ciancaglini, A. Scalas, N. Yoshida","doi":"10.1145/2643135.2643138","DOIUrl":"https://doi.org/10.1145/2643135.2643138","url":null,"abstract":"Subtyping in concurrency has been extensively studied since early 1990s as one of the most interesting issues in type theory. The correctness of subtyping relations has been usually provided as the soundness for type safety. The converse direction, the completeness, has been largely ignored in spite of its usefulness to define the greatest subtyping relation ensuring type safety. This paper formalises preciseness (i.e. both soundness and completeness) of subtyping for mobile processes and studies it for the synchronous and the asynchronous session calculi. We first prove that the well-known session subtyping, the branching-selection subtyping, is sound and complete for the synchronous calculus. Next we show that in the asynchronous calculus, this subtyping is incomplete for type-safety: that is, there exist session types T and S such that T can safely be considered as a subtype of S, but T ≤ S is not derivable by the subtyping. We then propose an asynchronous subtyping system which is sound and complete for the asynchronous calculus. The method gives a general guidance to design rigorous channel-based subtypings respecting desired safety properties.","PeriodicalId":448247,"journal":{"name":"ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming","volume":"49 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":"124916668","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}
引用次数: 54
Theories of Homomorphic Encryption, Unification, and the Finite Variant Property 同态加密、统一和有限变性质的理论
Fan Yang, Santiago Escobar, C. Meadows, J. Meseguer, P. Narendran
{"title":"Theories of Homomorphic Encryption, Unification, and the Finite Variant Property","authors":"Fan Yang, Santiago Escobar, C. Meadows, J. Meseguer, P. Narendran","doi":"10.1145/2643135.2643154","DOIUrl":"https://doi.org/10.1145/2643135.2643154","url":null,"abstract":"Recent advances in the automated analysis of cryptographic protocols have aroused new interest in the practical application of unification modulo theories, especially theories that describe the algebraic properties of cryptosystems. However, this application requires unification algorithms that can be easily implemented and easily extended to combinations of different theories of interest. In practice this has meant that most tools use a version of a technique known as variant unification. This requires, among other things, that the theory be decomposable into a set of axioms B and a set of rewrite rules R such that R has the finite variant property with respect to B. Most theories that arise in cryptographic protocols have decompositions suitable for variant unification, but there is one major exception: the theory that describes encryption that is homomorphic over an Abelian group.\u0000 In this paper we address this problem by studying various approximations of homomorphic encryption over an Abelian group. We construct a hierarchy of increasingly richer theories, taking advantage of new results that allow us to automatically verify that their decompositions have the finite variant property. This new verification procedure also allows us to construct a rough metric of the complexity of a theory with respect to variant unification, or variant complexity. We specify different versions of protocols using the different theories, and analyze them in the Maude-NPA cryptographic protocol analysis tool to assess their behavior. This gives us greater understanding of how the theories behave in actual application, and suggests possible techniques for improving performance.","PeriodicalId":448247,"journal":{"name":"ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming","volume":"27 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":"131941229","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}
引用次数: 11
On the Declarative Structure of Quantum Concepts: States and Observables (Distilled Tutorial) 论量子概念的陈述性结构:状态和可观察对象(摘要教程)
J. Karczmarczuk
{"title":"On the Declarative Structure of Quantum Concepts: States and Observables (Distilled Tutorial)","authors":"J. Karczmarczuk","doi":"10.1145/2643135.2643162","DOIUrl":"https://doi.org/10.1145/2643135.2643162","url":null,"abstract":"This tutorial documents our opinion that quantum concepts are declarative in nature, and that using imperative programming for quantum computation is a conceptual mismatch. We show how to construct a purely functional framework that describes a methodologically more correct (in our opinion) model of quantum entities. We refrain from representing explicitly, as data structures, such objects as states which cannot be analysed without being destroyed. We suggest that a declarative, purely functional approach gives formal tools that are more adequate for reasoning about the computational sense/contents of quantum entities, and in general of several mathematical constructs considered abstract. We show that this approach can be used in practice, and we suggest that it also can shed some light on the sense of the linearity -- the geometric property of vector spaces -- within the quantum framework.","PeriodicalId":448247,"journal":{"name":"ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126225167","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}
引用次数: 0
Database Queries that Explain their Work 解释其工作的数据库查询
J. Cheney, Amal J. Ahmed, Umut A. Acar
{"title":"Database Queries that Explain their Work","authors":"J. Cheney, Amal J. Ahmed, Umut A. Acar","doi":"10.1145/2643135.2643143","DOIUrl":"https://doi.org/10.1145/2643135.2643143","url":null,"abstract":"Provenance for database queries or scientific workflows is often motivated as providing explanation, increasing understanding of the underlying data sources and processes used to compute the query, and reproducibility, the capability to recompute the results on different inputs, possibly specialized to a part of the output. Many provenance systems claim to provide such capabilities; however, most lack formal definitions or guarantees of these properties, while others provide formal guarantees only for relatively limited classes of changes. Building on recent work on provenance traces and slicing for functional programming languages, we introduce a detailed tracing model of provenance for multiset-valued Nested Relational Calculus, define trace slicing algorithms that extract subtraces needed to explain or recompute specific parts of the output, and define query slicing and differencing techniques that support explanation. We state and prove correctness properties for these techniques and present a proof-of-concept implementation in Haskell.","PeriodicalId":448247,"journal":{"name":"ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming","volume":"187 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123514125","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}
引用次数: 16
A semantics for weakly encapsulated search in functional logic programs 函数逻辑程序中弱封装搜索的语义
Jan Christiansen, M. Hanus, Fabian Reck, D. Seidel
{"title":"A semantics for weakly encapsulated search in functional logic programs","authors":"Jan Christiansen, M. Hanus, Fabian Reck, D. Seidel","doi":"10.1145/2505879.2505896","DOIUrl":"https://doi.org/10.1145/2505879.2505896","url":null,"abstract":"Encapsulated search is a key feature of (functional) logic languages. It allows the programmer to access and process different results of a non-deterministic computation within a program. Unfortunately, due to advanced operational features (lazy evaluation, partial values, infinite structures), there is no straightforward definition of the semantics of encapsulated search in functional logic languages. As a consequence, various proposals and implementations are available but a rigorous definition covering all semantical aspects does not exist. In this paper, we analyze the requirements of encapsulated search in a functional logic language like Curry and provide a comprehensive definition that covers weak encapsulation, a modular form of encapsulation, as well as nested applications of search operators. We set up a denotational semantics that distinguishes non-termination and different levels of failures in a computation. The semantics is also the basis of a practical implementation of search operators in the functional logic language Curry.","PeriodicalId":448247,"journal":{"name":"ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114654613","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}
引用次数: 10
Decentralized execution of constraint handling rules for ensembles 集合约束处理规则的分散执行
E. Lam, I. Cervesato
{"title":"Decentralized execution of constraint handling rules for ensembles","authors":"E. Lam, I. Cervesato","doi":"10.1145/2505879.2505892","DOIUrl":"https://doi.org/10.1145/2505879.2505892","url":null,"abstract":"CHR is a declarative, concurrent and committed choice rule-based constraint programming language. In this paper, we adapt CHR to provide a decentralized execution model for parallel and distributed programs. Specifically, we consider an execution model consisting of an ensemble of computing entities, each with its own constraint store and each capable of communicating with its neighbors. We extend CHR into CHR<sup><i>e</i></sup>, in which rules are executed at a location and are allowed to access the constraint store of its immediate neighbors. We give an operational semantics for CHR<sup><i>e</i></sup>, denoted <i>ω</i><sub>0</sub><sup><i>e</i></sup>, that defines incremental and asynchronous decentralized rewriting for the class of CHR<sup><i>e</i></sup> rules characterized by purely local matching (0-neighbor restricted rules). We show the soundness of the <i>ω</i><sub>0</sub><sup><i>e</i></sup> semantics with respect to the abstract CHR semantics. We then give a safe encoding of the more general 1-neighbor restricted rules as 0-neighbor restricted rules, and discuss how this encoding can be generalized to all CHR<sup><i>e</i></sup> programs.","PeriodicalId":448247,"journal":{"name":"ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128114075","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}
引用次数: 7
A synthetic operational account of call-by-need evaluation 按需评估的综合业务帐户
O. Danvy, Ian Zerny
{"title":"A synthetic operational account of call-by-need evaluation","authors":"O. Danvy, Ian Zerny","doi":"10.1145/2505879.2505898","DOIUrl":"https://doi.org/10.1145/2505879.2505898","url":null,"abstract":"We present the first operational account of call by need that connects syntactic theory and implementation practice. Syntactic theory: the storeless operational semantics using syntax rewriting to account for demand-driven computation and for caching intermediate results. Implementational practice: the store-based operational technique using memo-thunks to implement demand-driven computation and to cache intermediate results for subsequent sharing. The implementational practice was initiated by Landin and Wadsworth and is prevalent today to implement lazy programming languages such as Haskell. The syntactic theory was initiated by Ariola, Felleisen, Maraist, Odersky and Wadler and is prevalent today to reason equationally about lazy programs, on par with Barendregt et al.'s term graphs. Nobody knows, however, how the theory of call by need compares to the practice of call by need: all that is known is that the theory of call by need agrees with the theory of call by name, and that the practice of call by need optimizes the practice of call by name.\u0000 Our operational account takes the form of three new calculi for lazy evaluation of lambda-terms and our synthesis takes the form of three lock-step equivalences. The first calculus is a hereditarily compressed variant of Ariola et al.'s call-by-need lambda-calculus and makes \"neededness\" syntactically explicit. The second calculus distinguishes between strict bindings (which are induced by demand-driven computation) and non-strict bindings (which are used for caching intermediate results). The third calculus uses memo-thunks and an algebraic store. The first calculus syntactically corresponds to a storeless abstract machine, the second to an abstract machine with local stores, and the third to a lazy Krivine machine, i.e., a traditional store-based abstract machine implementing lazy evaluation. The machines are intensionally compatible with extensional reasoning about lazy programs and they are lock-step equivalent. Each machine functionally corresponds to a natural semantics for call by need in the style of Launchbury, though for non-preprocessed λ-terms.\u0000 Our results reveal a genuine and principled unity of computational theory and computational practice, one that readily applies to variations on the general theme of call by need.","PeriodicalId":448247,"journal":{"name":"ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming","volume":"269 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132925638","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书