skip to main content
10.1145/3551357acmotherconferencesBook PagePublication PagesppdpConference Proceedingsconference-collections
PPDP '22: Proceedings of the 24th International Symposium on Principles and Practice of Declarative Programming
ACM2022 Proceeding
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
Conference:
PPDP 2022: 24th International Symposium on Principles and Practice of Declarative Programming Tbilisi Georgia September 20 - 22, 2022
ISBN:
978-1-4503-9703-2
Published:
20 September 2022
Recommend ACM DL
ALREADY A SUBSCRIBER?SIGN IN

Reflects downloads up to 17 Feb 2025Bibliometrics
Abstract

No abstract available.

Skip Table Of Content Section
research-article
A Monadic Implementation of Functional Logic Programs
Article No.: 1, Pages 1–15https://doi.org/10.1145/3551357.3551370

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. ...

research-article
Open Access
ASP-based Multi-shot Reasoning via DLV2 with Incremental Grounding
Article No.: 2, Pages 1–9https://doi.org/10.1145/3551357.3551371

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 ...

research-article
CheckINN: Wide Range Neural Network Verification in Imandra
Article No.: 3, Pages 1–14https://doi.org/10.1145/3551357.3551372

Neural networks are increasingly relied upon as components of complex safety-critical systems such as autonomous vehicles. There is high demand for tools and methods that embed neural network verification in a larger verification cycle. However, neural ...

research-article
Contextual Equivalence in a Probabilistic Call-by-Need Lambda-Calculus
Article No.: 4, Pages 1–15https://doi.org/10.1145/3551357.3551374

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 ...

research-article
Nominal Matching Logic
Article No.: 5, Pages 1–15https://doi.org/10.1145/3551357.3551375

We introduce Nominal Matching Logic (NML) as an extension of Matching Logic with names and binding following the Gabbay-Pitts nominal approach. Matching logic is the foundation of the framework, used to specify programming languages and automatically ...

research-article
Public Access
A Logic for Formalizing Properties of LF Specifications
Article No.: 6, Pages 1–13https://doi.org/10.1145/3551357.3551377

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 ...

research-article
A Predicate Construct for Declarative Programming in Imperative Languages
Article No.: 7, Pages 1–13https://doi.org/10.1145/3551357.3551379

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 ...

research-article
A Faithful Description of ECMAScript Algorithms
Article No.: 8, Pages 1–14https://doi.org/10.1145/3551357.3551381

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 ...

research-article
Open Access
A Typed Lambda Calculus with Gradual Intersection Types
Article No.: 9, Pages 1–13https://doi.org/10.1145/3551357.3551382

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 ...

research-article
User Guided Abductive Proof Generation for Answer Set Programming Queries
Article No.: 10, Pages 1–14https://doi.org/10.1145/3551357.3551383

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 (...

research-article
Certified Derivation of Small-Step From Big-Step Skeletal Semantics
Article No.: 11, Pages 1–48https://doi.org/10.1145/3551357.3551384

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 ...

research-article
Session Types Revisited: A Decade Later
Article No.: 12, Pages 1–4https://doi.org/10.1145/3551357.3556676

Recommendations

Acceptance Rates

Overall Acceptance Rate 230 of 486 submissions, 47%
YearSubmittedAcceptedRate
PPDP '19451942%
PPDP '18392256%
PPDP '17281864%
PPDP '16371746%
PPDP '14432251%
PPDP '10572137%
PPDP '08482450%
PPDP '03482450%
PPDP '02361850%
PPDP '01401948%
PPDP '00652640%
Overall48623047%