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

Functional programming with λ-tree syntax λ树语法的函数式编程

Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming Pub Date : 2019-08-09 DOI: 10.1145/3354166.3354177

Ulysse Gérard, D. Miller, Gabriel Scherer

引用次数: 0

Intrinsically-Typed Mechanized Semantics for Session Types 会话类型的内在类型机械化语义

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

Peter Thiemann

引用次数: 16

Spacetime Programming: A Synchronous Language for Composable Search Strategies 时空编程:用于可组合搜索策略的同步语言

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

Pierre Talbot

引用次数: 1

Crumbling Abstract Machines 摇摇欲坠的抽象机器

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

Beniamino Accattoli, Andrea Condoluci, Giulio Guerrieri, C. Coen

引用次数: 14

Sharing Equality is Linear 共享平等是线性的

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

Andrea Condoluci, Beniamino Accattoli, C. Coen

{"title":"Sharing Equality is Linear","authors":"Andrea Condoluci, Beniamino Accattoli, C. Coen","doi":"10.1145/3354166.3354174","DOIUrl":"https://doi.org/10.1145/3354166.3354174","url":null,"abstract":"The λ-calculus is a handy formalism to specify the evaluation of higher-order programs. It is not very handy, however, when one interprets the specification as an execution mechanism, because terms can grow exponentially with the number of β-steps. This is why implementations of functional languages and proof assistants always rely on some form of sharing of subterms. These frameworks however do not only evaluate λ-terms, they also have to compare them for equality. In presence of sharing, one is actually interested in equality of the underlying unshared λ-terms. The literature contains algorithms for such a sharing equality, that are polynomial in the sizes of the shared terms. This paper improves the bounds in the literature by presenting the first linear time algorithm. As others before us, we are inspired by Paterson and Wegman's algorithm for first-order unification, itself based on representing terms with sharing as DAGs, and sharing equality as bisimulation of DAGs. Beyond the improved complexity, a distinguishing point of our work is a dissection of the involved concepts. In particular, we show that the algorithm computes the smallest bisimulation between the given DAGs, if any.","PeriodicalId":182058,"journal":{"name":"Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124448108","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

Generic Encodings of Constructor Rewriting Systems 构造函数重写系统的通用编码

Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming Pub Date : 2019-05-14 DOI: 10.1145/3354166.3354173

Horatiu Cirstea, Pierre-Etienne Moreau

引用次数: 2

An Adequate While-Language for Hybrid Computation 一种适合混合计算的while语言

Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming Pub Date : 2019-02-20 DOI: 10.1145/3354166.3354176

S. Goncharov, Renato Neves

引用次数: 8

Normalization by Evaluation for Call-By-Push-Value and Polarized Lambda Calculus 推值调用的归一化求值与极化λ演算

Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming Pub Date : 2019-02-16 DOI: 10.1145/3354166.3354168

Andreas Abel, Christian Sattler

{"title":"Normalization by Evaluation for Call-By-Push-Value and Polarized Lambda Calculus","authors":"Andreas Abel, Christian Sattler","doi":"10.1145/3354166.3354168","DOIUrl":"https://doi.org/10.1145/3354166.3354168","url":null,"abstract":"We observe that normalization by evaluation for simply-typed lambda-calculus with weak coproducts can be carried out in a weak bi-cartesian closed category of presheaves equipped with a monad that allows us to perform case distinction on neutral terms of sum type. The placement of the monad influences the normal forms we obtain: for instance, placing the monad on coproducts gives us eta-long beta-pi normal forms where pi refers to permutation of case distinctions out of elimination positions. We further observe that placing the monad on every coproduct is rather wasteful, and an optimal placement of the monad can be determined by considering polarized simple types inspired by focalization. Polarization classifies types into positive and negative, and it is sufficient to place the monad at the embedding of positive types into negative ones. We consider two calculi based on polarized types: pure call-by-push-value (CBPV) and polarized lambda-calculus, the natural deduction calculus corresponding to focalized sequent calculus. For these two calculi, we present algorithms for normalization by evaluation. We further discuss different implementations of the monad and their relation to existing normalization proofs for lambda-calculus with sums. Our developments have been partially formalized in the Agda proof assistant.","PeriodicalId":182058,"journal":{"name":"Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming","volume":"7 24","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131437444","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

Relational Symbolic Execution 关系符号执行

Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming Pub Date : 2017-11-22 DOI: 10.1145/3354166.3354175

Gian Pietro Farina, Stephen Chong, Marco Gaboardi

引用次数: 20

Property-Based Testing via Proof Reconstruction 通过证明重构的基于属性的测试

Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming Pub Date : 2017-09-08 DOI: 10.1145/3354166.3354170

Roberto Blanco, D. Miller, A. Momigliano

{"title":"Property-Based Testing via Proof Reconstruction","authors":"Roberto Blanco, D. Miller, A. Momigliano","doi":"10.1145/3354166.3354170","DOIUrl":"https://doi.org/10.1145/3354166.3354170","url":null,"abstract":"Property-based testing (PBT) is a technique for validating code against an executable specification by automatically generating test-data. We present a proof-theoretical reconstruction of this style of testing for relational specifications and employ the Foundational Proof Certificate framework to describe test generators. We do this by presenting certain kinds of \"proof outlines\" that can be used to describe various common generation strategies in the PBT literature, ranging from random to exhaustive, including their combination. We also address the shrinking of counterexamples as a first step towards their explanation. Once generation is accomplished, the testing phase boils down to a standard logic programming search. After illustrating our techniques on simple, first-order (algebraic) data structures, we lift it to data structures containing bindings using λ-tree syntax. The λProlog programming language is capable of performing both the generation and checking of tests. We validate this approach by tackling benchmarks in the metatheory of programming languages coming from related tools such as PLT-Redex.","PeriodicalId":182058,"journal":{"name":"Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128087609","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