发布求助
文献互助 智能选刊 最新文献

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

筛选
英文 中文
Declarative interpretations of session-based concurrency 基于会话的并发性的声明性解释
Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming Pub Date : 2015-07-14 DOI: 10.1145/2790449.2790513
Mauricio Cano, C. Rueda, Hugo A. López, Jorge A. Pérez
{"title":"Declarative interpretations of session-based concurrency","authors":"Mauricio Cano, C. Rueda, Hugo A. López, Jorge A. Pérez","doi":"10.1145/2790449.2790513","DOIUrl":"https://doi.org/10.1145/2790449.2790513","url":null,"abstract":"Session-based concurrency is a type-based approach to the analysis of communication-intensive systems. Correct behavior in these systems may be specified in an operational or declarative style: the former defines how interactions are structured; the latter defines governing conditions. In this paper, we investigate the relationship between operational and declarative models of session-based concurrency. We propose two interpretations of session π-calculus processes as declarative processes in linear concurrent constraint programming (lcc). They offer a basis on which both operational and declarative requirements can be specified and reasoned about. By coupling our interpretations with a type system for lcc, we obtain robust declarative encodings of π-calculus mobility.","PeriodicalId":445788,"journal":{"name":"Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130985289","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
An algebraic view of space/belief and extrusion/utterance for concurrency/epistemic logic 并行/认知逻辑的空间/信念和挤压/话语的代数观点
Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming Pub Date : 2015-07-14 DOI: 10.1145/2790449.2790520
S. Haar, S. Perchy, C. Rueda, F. Valencia
{"title":"An algebraic view of space/belief and extrusion/utterance for concurrency/epistemic logic","authors":"S. Haar, S. Perchy, C. Rueda, F. Valencia","doi":"10.1145/2790449.2790520","DOIUrl":"https://doi.org/10.1145/2790449.2790520","url":null,"abstract":"We enrich spatial constraint systems with operators to specify information and processes moving from a space to another. We shall refer to these news structures as spatial constraint systems with extrusion. We shall investigate the properties of this new family of constraint systems and illustrate their applications. From a computational point of view the new operators provide for process/information extrusion, a central concept in formalisms for mobile communication. From an epistemic point of view extrusion corresponds to a notion we shall call utterance; a piece of information that an agent communicates to others but that may be inconsistent with the agent's beliefs. Utterances can then be used to express instances of epistemic notions, which are common place in social media, such as hoaxes or intentional lies. Spatial constraint systems with extrusion can be seen as complete Heyting algebras equipped with maps to account for spatial and epistemic specifications.","PeriodicalId":445788,"journal":{"name":"Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127121126","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}
引用次数: 22
Debugging of wrong and missing answers for datalog programs with constraint handling rules 具有约束处理规则的数据程序错误和缺失答案的调试
Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming Pub Date : 2015-07-14 DOI: 10.1145/2790449.2790522
R. Caballero, Y. García-Ruiz, F. Sáenz-Pérez
{"title":"Debugging of wrong and missing answers for datalog programs with constraint handling rules","authors":"R. Caballero, Y. García-Ruiz, F. Sáenz-Pérez","doi":"10.1145/2790449.2790522","DOIUrl":"https://doi.org/10.1145/2790449.2790522","url":null,"abstract":"This paper presents a proposal for debugging deductive database programs. Although inspired in the logic programming paradigm, these programs have the particularity of involving large sets of data. In this context, debugging tools employed usually in logic programs, such as traditional trace debuggers, become impractical. Our technique is based on the principles of algorithmic debugging but adapted to the particularities of the deductive database query language Datalog. The debugging process starts when the user detects an initial erroneous result. Then, the debugger asks questions about the validity/nonvalidity of some intermediate results until a bug is located. The debugger allows the user to report the existence of wrong or missing answers. This information is employed for simplifying the following questions using different forms of slicing. During the debugging process the information provided by the user or inferred by the debugger is stored in the form of constraints in a CHR program that combines all the data in order to detect the source of the error as soon as possible. The debugger has been implemented as part of the Datalog system DES.","PeriodicalId":445788,"journal":{"name":"Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming","volume":"50 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132570380","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
Improvements in a functional core language with call-by-need operational semantics 改进了功能核心语言的按需调用操作语义
Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming Pub Date : 2015-07-14 DOI: 10.1145/2790449.2790512
M. Schmidt-Schauß, David Sabel
{"title":"Improvements in a functional core language with call-by-need operational semantics","authors":"M. Schmidt-Schauß, David Sabel","doi":"10.1145/2790449.2790512","DOIUrl":"https://doi.org/10.1145/2790449.2790512","url":null,"abstract":"An improvement is a correct program transformation that optimizes the program, where the criterion is that the number of computation steps until a value is obtained is not increased in any context. This paper investigates improvements an untyped call-by-need lambdacalculus with letrec, case, constructors and seq. Besides showing that several local optimizations are improvements, the main result of the paper is a proof that common subexpression elimination is correct and an improvement, which proves a conjecture and thus closes a gap in the improvement theory of Moran and Sands. We also prove that several different length measures used for improvement in the call-by-need calculus of Moran and Sands and our calculus are equivalent.","PeriodicalId":445788,"journal":{"name":"Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133004061","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
Lasp: a language for distributed, coordination-free programming Lasp:一种用于分布式、无协调编程的语言
Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming Pub Date : 2015-07-14 DOI: 10.1145/2790449.2790525
Christopher S. Meiklejohn, P. V. Roy
{"title":"Lasp: a language for distributed, coordination-free programming","authors":"Christopher S. Meiklejohn, P. V. Roy","doi":"10.1145/2790449.2790525","DOIUrl":"https://doi.org/10.1145/2790449.2790525","url":null,"abstract":"We propose Lasp, a new programming model designed to simplify large-scale distributed programming. Lasp combines ideas from deterministic dataflow programming together with conflict-free replicated data types (CRDTs). This provides support for computations where not all participants are online together at a given moment. The initial design presented here provides powerful primitives for composing CRDTs, which lets us write long-lived fault-tolerant distributed applications with nonmonotonic behavior in a monotonic framework. Given reasonable models of node-to-node communications and node failures, we prove formally that a Lasp program can be considered as a functional program that supports functional reasoning and programming techniques. We have implemented Lasp as an Erlang library built on top of the Riak Core distributed systems framework. We have developed one nontrivial large-scale application, the advertisement counter scenario from the SyncFree research project. We plan to extend our current prototype into a general-purpose language in which synchronization is used as little as possible.","PeriodicalId":445788,"journal":{"name":"Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131003789","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}
引用次数: 71
Computation in focused intuitionistic logic 聚焦直觉逻辑中的计算
Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming Pub Date : 2015-07-14 DOI: 10.1145/2790449.2790528
Taus Brock-Nannestad, Nicolas Guenot, Daniel Gustafsson
{"title":"Computation in focused intuitionistic logic","authors":"Taus Brock-Nannestad, Nicolas Guenot, Daniel Gustafsson","doi":"10.1145/2790449.2790528","DOIUrl":"https://doi.org/10.1145/2790449.2790528","url":null,"abstract":"We investigate the control of evaluation strategies in a variant of the Λ-calculus derived through the Curry-Howard correspondence from LJF, a sequent calculus for intuitionistic logic implementing the focusing technique. The proof theory of focused intuitionistic logic yields a single calculus in which a number of known Λ-calculi appear as subsystems obtained by restricting types to a certain fragment of LJF. In particular, standard Λ-calculi as well as the call-by-push-value calculus are analysed using this framework, and we relate cut elimination for LJF to a new abstract machine subsuming well-known machines for these different strategies.","PeriodicalId":445788,"journal":{"name":"Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128907579","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
Automated verification of safety properties of declarative networking programs 自动验证声明式网络程序的安全属性
Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming Pub Date : 2015-07-14 DOI: 10.1145/2790449.2790516
Cheng Chen, L. Loh, Limin Jia, Wenchao Zhou, B. T. Loo
{"title":"Automated verification of safety properties of declarative networking programs","authors":"Cheng Chen, L. Loh, Limin Jia, Wenchao Zhou, B. T. Loo","doi":"10.1145/2790449.2790516","DOIUrl":"https://doi.org/10.1145/2790449.2790516","url":null,"abstract":"Networks are complex systems that unfortunately are ridden with errors. Such errors can lead to disruption of services, which may have grave consequences. Verification of networks is key to eliminating errors and building robust networks. In this paper, we propose an approach to verify networks using declarative networking, where networks are specified in NDlog, a declarative language. We focus on analyzing safety properties. We develop a technique to statically analyze NDlog programs: first, we build a dependency graph of the predicates of NDlog programs; then, we build a summary data structure called a derivation pool to represent all possible derivations and their associated constraints for predicates in the program; finally, properties specified in first-order logic are checked on the data structure with the help of the SMT solver Z3. We build a prototype tool and demonstrate the effectiveness of the tool in validating and debugging several SDN applications.","PeriodicalId":445788,"journal":{"name":"Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128942775","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
Expressing preferences in logic programming using an infinite-valued logic 用无限值逻辑表达逻辑编程中的偏好
Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming Pub Date : 2015-07-14 DOI: 10.1145/2790449.2790511
P. Rondogiannis, Antonis Troumpoukis
{"title":"Expressing preferences in logic programming using an infinite-valued logic","authors":"P. Rondogiannis, Antonis Troumpoukis","doi":"10.1145/2790449.2790511","DOIUrl":"https://doi.org/10.1145/2790449.2790511","url":null,"abstract":"We propose the new logic programming language PrefLog, which is based on an infinite-valued logic in order to support operators for expressing preferences. We demonstrate that if the operators used are continuous over the infinite-valued underlying domain, then the resulting logic programming language retains the well-known properties of classical logic programming (and most notably the existence of a least Herbrand model). We argue that one can define simple and natural new continuous operators by using a small set of operators that are easily shown to be continuous. Finally, we demonstrate that despite the fact that the underlying truth domain and the set of possible interpretations of a PrefLog program are infinite, we can define a terminating bottom-up proof procedure for implementing a significant and useful fragment of the language.","PeriodicalId":445788,"journal":{"name":"Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming","volume":"344 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116237373","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
From monoids to near-semirings: the essence of MonadPlus and alternative 从一元到近半:MonadPlus的本质和替代品
Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming Pub Date : 2015-07-14 DOI: 10.1145/2790449.2790514
Exequiel Rivas, Mauro Jaskelioff, T. Schrijvers
{"title":"From monoids to near-semirings: the essence of MonadPlus and alternative","authors":"Exequiel Rivas, Mauro Jaskelioff, T. Schrijvers","doi":"10.1145/2790449.2790514","DOIUrl":"https://doi.org/10.1145/2790449.2790514","url":null,"abstract":"It is well-known that monads are monoids in the category of endofunctors, and in fact so are applicative functors. Unfortunately, the benefits of this unified view are lost when the additional nondeterminism structure of MonadPlus or Alternative is required. This article recovers the essence of these two type classes by extending monoids to near-semirings with both additive and multiplicative structure. This unified algebraic view enables us to generically define the free construction as well as a novel double Cayley representation that optimises both left-nested sums and left-nested products.","PeriodicalId":445788,"journal":{"name":"Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming","volume":"149 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128871612","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
Static analysis of cloud elasticity 云弹性的静态分析
Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming Pub Date : 2015-07-14 DOI: 10.1145/2790449.2790524
A. Garcia, C. Laneve, Michael Lienhardt
{"title":"Static analysis of cloud elasticity","authors":"A. Garcia, C. Laneve, Michael Lienhardt","doi":"10.1145/2790449.2790524","DOIUrl":"https://doi.org/10.1145/2790449.2790524","url":null,"abstract":"We propose a static analysis technique that computes upper bounds of virtual machine usages in a concurrent language with explicit acquire and release operations of virtual machines. In our language it is possible to delegate other (ad-hoc or third party) concurrent code to release virtual machines (by passing them as arguments of invocations). Our technique is modular and consists of (i) a type system associating programs with behavioural types that records relevant information for resource usage (creations, releases, and concurrent operations), (ii) a translation function that takes behavioural types and return cost equations, and (iii) an automatic off-the-shelf solver for the cost equations. A soundness proof of the type system establishes the correctness of our technique with respect to the cost equations. We have experimentally evaluated our technique using a cost analysis solver and we report some results. The experiments show that our analysis allows us to derive bounds for programs that are better than other techniques, such as those based on amortized analysis.","PeriodicalId":445788,"journal":{"name":"Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125907474","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}
引用次数: 19
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信