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

筛选
英文 中文
Session Types Revisited: A Decade Later 重新审视会话类型:十年后
Ornela Dardha, Elena Giachino, D. Sangiorgi
{"title":"Session Types Revisited: A Decade Later","authors":"Ornela Dardha, Elena Giachino, D. Sangiorgi","doi":"10.1145/3551357.3556676","DOIUrl":"https://doi.org/10.1145/3551357.3556676","url":null,"abstract":"• Theory of computation → Process calculi ; Logic and verification ; • Software and its engineering → Software verification and validation . This short paper is a retrospection of our original work titled Session Types Revisited [11] published at PPDP’12. We thank the PPDP Steering Committee for awarding us the “PPDP 10 Year Most Influential Paper Award\". In the following, we recall our main con-tributions, highlight the impact in the literature and we conclude by presenting some ideas for future developments.","PeriodicalId":412797,"journal":{"name":"Proceedings of the 24th International Symposium on Principles and Practice of Declarative Programming","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128250390","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
A Typed Lambda Calculus with Gradual Intersection Types 具有渐交类型的类型化Lambda演算
Pedro Ângelo, Mário Florido
{"title":"A Typed Lambda Calculus with Gradual Intersection Types","authors":"Pedro Ângelo, Mário Florido","doi":"10.1145/3551357.3551382","DOIUrl":"https://doi.org/10.1145/3551357.3551382","url":null,"abstract":"Intersection types have the power to type expressions which are all of many different types. Gradual types combine type checking at both compile-time and run-time. Here we combine these two approaches in a new typed calculus that harness both of their strengths. We incorporate these two contributions in a single typed calculus and define an operational semantics with type cast annotations. We also prove several crucial properties of the type system, namely that types are preserved during compilation and evaluation, and that the refined criteria for gradual typing holds.","PeriodicalId":412797,"journal":{"name":"Proceedings of the 24th International Symposium on Principles and Practice of Declarative Programming","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116155954","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
Certified Derivation of Small-Step From Big-Step Skeletal Semantics 小步从大步骨架语义的证明派生
Guillaume Ambal, Sergueï Lenglet, Alan Schmitt, Camille Noûs
{"title":"Certified Derivation of Small-Step From Big-Step Skeletal Semantics","authors":"Guillaume Ambal, Sergueï Lenglet, Alan Schmitt, Camille Noûs","doi":"10.1145/3551357.3551384","DOIUrl":"https://doi.org/10.1145/3551357.3551384","url":null,"abstract":"We present an automatic translation of a skeletal semantics written in big-step style into an equivalent structural operational semantics. This translation is implemented on top of the Necro tool, which lets us automatically generate an OCaml interpreter for the small step semantics and a Coq mechanization of both semantics. We prove the framework correct in two ways: we provide a paper proof of the core of the transformation, and we generate Coq certification scripts alongside the transformation. We illustrate the approach using a simple imperative language and show how it scales to larger languages.","PeriodicalId":412797,"journal":{"name":"Proceedings of the 24th International Symposium on Principles and Practice of Declarative Programming","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131161434","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
Contextual Equivalence in a Probabilistic Call-by-Need Lambda-Calculus 概率按需调用lambda微积分中的上下文等价
David Sabel, M. Schmidt-Schauß, Luca Maio
{"title":"Contextual Equivalence in a Probabilistic Call-by-Need Lambda-Calculus","authors":"David Sabel, M. Schmidt-Schauß, Luca Maio","doi":"10.1145/3551357.3551374","DOIUrl":"https://doi.org/10.1145/3551357.3551374","url":null,"abstract":"To support the understanding of declarative probabilistic programming languages, we introduce a lambda-calculus with a fair binary probabilistic choice that chooses between its arguments with equal probability. The reduction strategy of the calculus is a call-by-need strategy that performs lazy evaluation and implements sharing by recursive let-expressions. Expected convergence of expressions is the limit of the sum of all successful reduction outputs weighted by their probability. We use contextual equivalence as program semantics: two expressions are contextually equivalent if and only if the expected convergence of the expressions plugged into any program context is always the same. We develop and illustrate techniques to prove equivalences including a context lemma, two derived criteria to show equivalences and a syntactic diagram-based method. This finally enables us to show correctness of a large set of program transformations with respect to the contextual equivalence.","PeriodicalId":412797,"journal":{"name":"Proceedings of the 24th International Symposium on Principles and Practice of Declarative Programming","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128360179","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
A Faithful Description of ECMAScript Algorithms ECMAScript算法的忠实描述
Adam Khayam, Louis Noizet, Alan Schmitt
{"title":"A Faithful Description of ECMAScript Algorithms","authors":"Adam Khayam, Louis Noizet, Alan Schmitt","doi":"10.1145/3551357.3551381","DOIUrl":"https://doi.org/10.1145/3551357.3551381","url":null,"abstract":"We present an ongoing formalization of algorithms of ECMAScript, the specification describing the semantics of JavaScript, in a tiny functional meta-language. We show that this formalization is concise, readable, maintainable, and textually close to the specification. We extract an OCaml interpreter from our description and run small JavaScript programs whose semantics is based on these algorithms.","PeriodicalId":412797,"journal":{"name":"Proceedings of the 24th International Symposium on Principles and Practice of Declarative Programming","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124935493","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
A Monadic Implementation of Functional Logic Programs 函数逻辑程序的一元实现
M. Hanus, Kai-Oliver Prott, Finn Teegen
{"title":"A Monadic Implementation of Functional Logic Programs","authors":"M. Hanus, Kai-Oliver Prott, Finn Teegen","doi":"10.1145/3551357.3551370","DOIUrl":"https://doi.org/10.1145/3551357.3551370","url":null,"abstract":"Functional logic languages are a high-level approach to programming by combining the most important declarative features. They abstract from small-step operational details so that programmers can concentrate on the logical aspects of an application. This is supported by appropriate evaluation strategies. Demand-driven evaluation from functional programming is amalgamated with non-determinism from logic programming so that solutions or values are computed whenever they exist. This frees the programmer from considering the influence of an operational strategy to the success of a computation but it is a challenge to the language implementer. A non-deterministic demand-driven strategy might duplicate unevaluated choices of an expression which could duplicate the computational efforts. In recent implementations, this problem has been tackled by adding a kind of memoization of non-deterministic choices to the expression under evaluation. Since this has been implemented in imperative target languages, it was unclear whether this could also be supported in a functional programming environment, like Haskell. This paper presents a solution to this challenge by transforming functional logic programs into a monadic representation. Although this transformation is not new, we present an implementation of the monadic interface which supports memoization in non-deterministic branches. We demonstrate that our approach yields a promising performance that outperforms current compilers for Curry.","PeriodicalId":412797,"journal":{"name":"Proceedings of the 24th International Symposium on Principles and Practice of Declarative Programming","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125943827","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
A Predicate Construct for Declarative Programming in Imperative Languages 命令式语言中声明式编程的谓词结构
James Smith, Xiangyu Guo, A. Bansal
{"title":"A Predicate Construct for Declarative Programming in Imperative Languages","authors":"James Smith, Xiangyu Guo, A. Bansal","doi":"10.1145/3551357.3551379","DOIUrl":"https://doi.org/10.1145/3551357.3551379","url":null,"abstract":"Imperative and object-oriented programming languages are among the most common languages for general-purpose programming. These languages work well for handling many common tasks necessary for most applications. However, there are still many hard problems that remain difficult to implement directly in imperative languages. Declarative languages have worked well for solving many of these problems by providing a syntax that allows the user to focus on modeling the problem rather than on designing an algorithm. Logic programming languages, like Prolog, have seen success in constraint satisfaction problems, logical databases, and various NP-Hard problems. Unfortunately, these languages have not seen the same success in general-purpose programming, and most of the problems they solve do not exist in isolation. Furthermore, many imperative programmers are still unfamiliar with and unaware of logic programming. In this work, we aim to integrate a logical predicate, borrowed from logic programming, into an imperative language to facilitate a model-based approach to programming. Rather than attempting to embed Prolog directly into the language, we provide a logic for reasoning over imperative expressions using the common Boolean operators familiar to imperative programmers. While logic programming relies on unification, our predicate relies on variable assignment which is standard in imperative languages. We have implemented the predicate into the syntax of the Python programming language along with a solver built into the runtime for solving queries on the predicate. We demonstrate the use of the construct through solving commonly-known problems, such as graph coloring and the N-Queens problem. To evaluate the viability of our predicate, we compare the performance results of our predicate against current implementations of Prolog. By bringing this predicate construct to imperative languages, it is our hope that we can help to bridge the gap between imperative and logic programming as well as provide an approach to logic programming that is more intuitive for imperative programmers.","PeriodicalId":412797,"journal":{"name":"Proceedings of the 24th International Symposium on Principles and Practice of Declarative Programming","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125028569","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
A Logic for Formalizing Properties of LF Specifications 一种形式化LF规范属性的逻辑
G. Nadathur, Mary Southern
{"title":"A Logic for Formalizing Properties of LF Specifications","authors":"G. Nadathur, Mary Southern","doi":"10.1145/3551357.3551377","DOIUrl":"https://doi.org/10.1145/3551357.3551377","url":null,"abstract":"A logic is presented for formalizing properties of specifications in the Edinburgh Logical Framework or LF. In this logic, typing judgments in LF serve as atomic formulas and quantification is permitted over LF terms and contexts. Quantifiers of the first variety are qualified by simple types that describe the functional structure associated with the variables they bind. Quantifiers over contexts are typed by context schemas that constrain their instantiations to adhere to a regular structure. The semantics of the logic is based ultimately on an understanding of derivability in LF. As such, valid formulas in the logic represent meta-theoretic properties of object systems that are encoded via LF signatures. The logic is complemented by a proof system that is briefly discussed. There are two categories to the rules in this proof system. One collection of rules captures the meanings of logical connectives and quantifiers. Another collection provides a means for analyzing atomic formulas based on an understanding of derivability in LF; these rules build in the capability for a case-analysis style reasoning about LF judgements and for induction over the heights of LF derivations.","PeriodicalId":412797,"journal":{"name":"Proceedings of the 24th International Symposium on Principles and Practice of Declarative Programming","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133868064","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
ASP-based Multi-shot Reasoning via DLV2 with Incremental Grounding 基于asp的增量接地DLV2多镜头推理
Francesco Calimeri, Giovambattista Ianni, Francesco Pacenza, S. Perri, J. Zangari
{"title":"ASP-based Multi-shot Reasoning via DLV2 with Incremental Grounding","authors":"Francesco Calimeri, Giovambattista Ianni, Francesco Pacenza, S. Perri, J. Zangari","doi":"10.1145/3551357.3551371","DOIUrl":"https://doi.org/10.1145/3551357.3551371","url":null,"abstract":"DLV2 is an AI tool for Knowledge Representation and Reasoning which supports Answer Set Programming (ASP) – a logic-based declarative formalism, successfully used in both academic and industrial applications. Given a logic program modelling a computational problem, an execution of DLV2 produces the so-called answer sets that correspond one-to-one to the solutions. The computational process relies on the typical Ground&Solve approach where the grounding step transforms the input program into a new, equivalent ground program, and the subsequent solving step applies propositional algorithms to search for the answer sets. Recently, emerging applications in contexts such as stream reasoning and event processing demand for multi-shot reasoning: here, the system is expected to be reactive while repeatedly executed over rapidly changing data. In this work, we present a new incremental reasoner obtained from the evolution of DLV2 towards multi-shot reasoning. Rather than restarting the computation from scratch, the system remains alive and incrementally handles the internal grounding process: in a completely transparent fashion for the user, at each shot, it reuses previous computations for building and maintaining a large, more general ground program, from which a smaller yet equivalent portion is determined and used for computing answer sets. We describe the system, its usage, its applicability and performance in some practically relevant domains.","PeriodicalId":412797,"journal":{"name":"Proceedings of the 24th International Symposium on Principles and Practice of Declarative Programming","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123976703","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
User Guided Abductive Proof Generation for Answer Set Programming Queries 回答集规划查询的用户引导溯因证明生成
Avishkar Mahajan, M. Strecker, Meng Weng Wong
{"title":"User Guided Abductive Proof Generation for Answer Set Programming Queries","authors":"Avishkar Mahajan, M. Strecker, Meng Weng Wong","doi":"10.1145/3551357.3551383","DOIUrl":"https://doi.org/10.1145/3551357.3551383","url":null,"abstract":"We present a method for generating possible proofs of a query with respect to a given Answer Set Programming (ASP) rule set using an abductive process where the space of abducibles is automatically constructed just from the input rules alone. Given a (possibly empty) set of user provided facts, our method infers any additional facts that may be needed for the entailment of a query and then outputs these extra facts, without the user needing to explicitly specify the space of all abducibles. We also present a method to generate a set of directed edges corresponding to the justification graph for the query. Furthermore, through different forms of implicit term substitution, our method can take user provided facts into account and suitably modify the abductive solutions. Past work on abduction has been primarily based on goal directed methods. However these methods can result in solvers that are not truly declarative. Much less work has been done on realizing abduction in a bottom up solver like the Clingo ASP solver. We describe novel ASP programs which can be run directly in Clingo to yield the abductive solutions and directed edge sets without needing to modify the underlying solving engine.","PeriodicalId":412797,"journal":{"name":"Proceedings of the 24th International Symposium on Principles and Practice of Declarative Programming","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115400693","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
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学术官方微信
小红书