Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming最新文献

Smart Contracts as Authorized Production Rules 作为授权生产规则的智能合约

Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming Pub Date : 2019-10-07 DOI: 10.1145/3354166.3354179

B. Lippmeier, Amos Robinson, A. Muys

引用次数: 2

Exception Handling and Classical Logic 异常处理和经典逻辑

Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming Pub Date : 2019-10-07 DOI: 10.1145/3354166.3354186

S. V. Bakel

{"title":"Exception Handling and Classical Logic","authors":"S. V. Bakel","doi":"10.1145/3354166.3354186","DOIUrl":"https://doi.org/10.1145/3354166.3354186","url":null,"abstract":"We present λtry, an extension of the λ-calculus with named exception handling, via try, throw and catch, and present a basic notion of type assignment expressing recoverable exception handling and show that it is sound. We define an interpretation for λtry to Parigot's λμ-calculus, and show that reduction (both lazy and call by value) is preserved by the interpretation. We will show that also types assignable in the basic system are preserved by the interpretation. We will then add a notion of total failure through halt that escapes applicative contexts without being caught by a handler, and show that we can interpret this in λμ when adding top as destination. We will argue that introducing handlers for halt will break the relation with λμ. We will conclude the paper by showing that it is possible to add handlers for program failure by introducing panic and dedicated handlers to λtry. We will need to extend the language with a conditional construct that is typed in a non-traditional way, that cannot be expressed in λμ or logic. This will allow both recoverable exceptions and total failure, dealt with by handlers; we will show a non-standard soundness result for this system.","PeriodicalId":182058,"journal":{"name":"Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124184169","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

Foundations of Session Types: 10 Years Later 会话类型的基础:10年后

Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming Pub Date : 2019-10-07 DOI: 10.1145/3354166.3356340

Giuseppe Castagna, M. Dezani-Ciancaglini, Elena Giachino, L. Padovani

{"title":"Foundations of Session Types: 10 Years Later","authors":"Giuseppe Castagna, M. Dezani-Ciancaglini, Elena Giachino, L. Padovani","doi":"10.1145/3354166.3356340","DOIUrl":"https://doi.org/10.1145/3354166.3356340","url":null,"abstract":"We were thrilled to know that our PPDP’09 paper “Foundations of Session Types” [10] was selected for the PPDP Most Influential Paper 10-Year Award. Just moments after being notified of this, we couldn’t help looking at the works that cited—and in some cases were inspired by—our own. The result is the following short note, in which we recollect the main ideas behind our own work and the related ones that followed. The tight gap between the award notification and the deadline for the production of the PPDP’19 proceedings prevent us from providing an exhaustive survey of the related literature and we apologize in advance for the conciseness of our report and any relevant omission. Fortunately, there exist recent surveys [2, 4, 14, 21] that may help the interested readers orient themselves into the vast literature of session types as a whole. Sessions and session types have proved to be extremely successful concepts for the structuring and the analysis of communications in distributed systems. A session is a private communication channel through which participating processes, using the so-called session endpoints, can communicate without interference from other processes. This privacy property of sessions enables the modular reasoning on complex systems, whereby each session is treated— and typed—in isolation. Thus, it is relatively easy to conceive type","PeriodicalId":182058,"journal":{"name":"Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114341023","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

Exponential Elimination for Bicartesian Closed Categorical Combinators 笛卡儿闭范畴组合子的指数消去

Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming Pub Date : 2019-10-07 DOI: 10.1145/3354166.3354185

Nachiappan Valliappan, Alejandro Russo

引用次数: 3

Functional Reactive Programming, restated 函数式响应式编程，重申

Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming Pub Date : 2019-10-07 DOI: 10.1145/3354166.3354172

Guerric Chupin, H. Nilsson

{"title":"Functional Reactive Programming, restated","authors":"Guerric Chupin, H. Nilsson","doi":"10.1145/3354166.3354172","DOIUrl":"https://doi.org/10.1145/3354166.3354172","url":null,"abstract":"Functional Reactive Programming is an approach to declarative programming of reactive systems by describing interactions between time-varying values. FRP implementations are often realised as an embedding in a functional host language, making for very expressive reactive programming frameworks. However, this expressiveness comes at a cost: current embedded FRP implementations incur substantial performance overheads, in particular for values that (notionally) vary continuously. The basic idea of FRP is closely related to synchronous data-flow and continuous system simulation languages. In contrast to FRP, these handle values that vary continuously efficiently, but are less expressive. This paper seeks to bridge this gap by proposing a novel approach to embedded FRP-implementation that uses the fundamental implementation approach of synchronous datalow and simulation languages for efficient handling of continuously varying values, while retaining the expressiveness normally associated with FRP, as well as paying attention to values that only change relatively infrequently. These ideas are applicable beyond FRP, for example for implementing flexible embedded simulation languages. We evaluate our approach on a range of benchmarks, including an existing full-fledged video game where using our new FRP implementation as a drop-in replacement for the old one gave a three-fold performance improvement.","PeriodicalId":182058,"journal":{"name":"Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127085569","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

Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming 第21届声明式编程原则与实践国际研讨会论文集

Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming Pub Date : 2019-10-07 DOI: 10.1145/3354166

引用次数: 0

10 Years of the Higher-Order Model Checking Project (Extended Abstract) 高阶模型检验项目10年(扩展摘要)

Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming Pub Date : 2019-10-07 DOI: 10.1145/3354166.3354167

N. Kobayashi

引用次数: 1

Inductive Theorem Proving in Non-terminating Rewriting Systems and Its Application to Program Transformation 非终止重写系统中的归纳定理证明及其在程序变换中的应用

Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming Pub Date : 2019-10-07 DOI: 10.1145/3354166.3354178

Kentaro Kikuchi, Takahito Aoto, Isao Sasano

引用次数: 1

Under Control: Compositionally Correct Closure Conversion with Mutable State 在控制之下:具有可变状态的组合正确闭包转换

Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming Pub Date : 2019-10-07 DOI: 10.1145/3354166.3354181

P. Mates, James T. Perconti, Amal J. Ahmed

{"title":"Under Control: Compositionally Correct Closure Conversion with Mutable State","authors":"P. Mates, James T. Perconti, Amal J. Ahmed","doi":"10.1145/3354166.3354181","DOIUrl":"https://doi.org/10.1145/3354166.3354181","url":null,"abstract":"Compositional compiler verification aims to ensure correct compilation of components, not just whole programs. Perconti and Ahmed [2014] propose a methodology for compositional compiler correctness that supports linking with code of arbitrary provenance. In particular, they allow compiled components to be linked with code whose functionality cannot even be expressed in the compiler's own source language. The essence of their approach is to define a multi-language system that formalizes interoperability between the source and target languages so that compiler correctness can be stated as contextual equivalence in the multi-language. They illustrate this methodology on a two-pass type-preserving compiler for a polymorphic language with recursive types. We show how to extend this multi-language compiler-verification approach to a source language with ML-style mutable references. We present the first compositional correctness proof of typed closure conversion for a language with mutable state. More importantly, we show we can extend our target language with first-class control (call/cc) yielding a compiler correctness theorem that allows components compiled from the source language (without call/cc) to be linked with target-language components (with call/cc) whose extensional behavior cannot be expressed in the source. A nontrivial technical contribution is the design of the multi-language logical relation used to carry out the proof of compiler correctness. This is semantically challenging due to the mix of parametric polymorphism and mutable state in both interoperating languages. We use a blue font to typeset our source language and a bold red to typeset the target. The paper will be much easier to read if viewed/printed in color.","PeriodicalId":182058,"journal":{"name":"Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129679228","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

Type-Driven Verification of Non-functional Properties 非功能属性的类型驱动验证

Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming Pub Date : 2019-10-07 DOI: 10.1145/3354166.3354171

Christopher Brown, Adam D. Barwell, Y. Marquer, Céline Minh, Olivier Zendra

引用次数: 6