Practical Aspects of Declarative Languages: 25th International Symposium, PADL 2023, Boston, MA, USA, January 16–17, 2023, Proceedings (Lecture Notes in Computer Science)

This book constitutes the proceedings of the 25th International Symposium on Practical Aspects of Declarative Languages, PADL 2023, which was held in Boston, MA, USA, in January 2023. The 15 full papers and 4 short papers presented in this volume were carefully reviewed and selected from 36 submissions. The papers are organized in the following topical sections: Functional Programming; Logic Programming. Preface Organization Abstracts of Invited Talks Modern Macros Towards Declarative Content Generation for Creativity Support Tools Contents Functional Programming RICE: An Optimizing Curry Compiler 1 Introduction 2 The Curry Run-Time System 3 GAS and Optimizations 4 Results 5 Conclusion and Future Work References Program Synthesis Using Example Propagation 1 Introduction 2 Example Propagation 2.1 Program Synthesis Using Example Propagation 2.2 Handcrafted Example Propagation 2.3 Example Propagation for Algebraic Datatypes 2.4 Evaluation-Based Example Propagation 3 Program Synthesis Using Example Propagation 3.1 Weighted Search 3.2 Hole Order 3.3 Generating Hole Fillings 3.4 Pruning the Program Space 4 Evaluation 4.1 Results 5 Conclusion References Embedding Functional Logic Programming in Haskell via a Compiler Plugin 1 Introduction 2 From Direct-Style to Explicit Monadic Style 2.1 A Lazy Functional-Logic Monad 2.2 The Transformation 2.3 Types 2.4 Data Type Declarations 2.5 Functions 3 Plugin Core 3.1 Why a GHC Plugin? 3.2 Plugin Phases 3.3 Handling of Imported Definitions 3.4 Sharing Polymorphic Expressions 3.5 Interfacing with Haskell 3.6 Compatibility 4 Inherited Features 5 Embedding Other Languages 6 Related Work 6.1 GHC Plugins 6.2 Monadic Intermediate Languages 6.3 Embedding Languages 7 Conclusion References Execution Time Program Verification with Tight Bounds 1 Introduction 2 Cost Instrumented Operational Semantics 3 Cost-Aware Program Logic 3.1 Verification Condition Generation 4 Amortized Costs 4.1 Examples 5 Exact Costs 5.1 Examples 6 Soundness 7 Implementation 8 Conclusions References Fluo: A Domain-Specific Language for Experiments in Fluorescence Microscopy (Application Paper) 1 Introduction 2 Overview of Fluo 2.1 Software: Measurement Controller DSL 2.2 Hardware 2.3 Graphical User Interface (GUI) 2.4 An Example Program: From GUI to Hardware 3 Use Case: FRET Measurements Using Time-Lapses 3.1 Förster Resonance Energy Transfer 3.2 Simultaneous FRET Measurements 4 Reflection References Logic Programming Flexible Job-shop Scheduling for Semiconductor Manufacturing with Hybrid Answer Set Programming (Application Paper) 1 Introduction 2 Application Scenario 3 Hybrid ASP Approach 4 Experimental Evaluation and Conclusion References Integrating ASP-Based Incremental Reasoning in the Videogame Development Workflow (Application Paper) 1 Introduction 2 The ThinkEngine 3 The Incremental-DLV[0.8]2 Reasoner 4 How to Program Brains: An Example 5 Integration and Experiments References Dynamic Slicing of Reaction Systems Based on Assertions and Monitors 1 Introduction 2 Reaction Systems 3 SOS Rules for Reaction Systems 3.1 SOS Rules for the Slicing Computation 4 Slicing RS Computations 5 Implementation 5.1 A Computation with the Interpreter of Reaction Systems 6 A Logical Framework for the Slicing Algorithm 6.1 The Assertion Language 6.2 Monitors 7 Related Work 8 Conclusions and Future Work References Multiple Query Satisfiability of Constrained Horn Clauses 1 Introduction 2 Preliminary Notions 3 An Introductory Example 4 Catamorphism-Based Queries 5 Transformation Rules 6 Transformation Algorithm 7 Experimental Evaluation 8 Conclusions and Related Work References Formalizing and Reasoning About Supply Chain Contracts Between Agents 1 Introduction 2 Preliminaries 2.1 The NIST CPS Framework 2.2 Action Language B 3 A Motivating Scenario 4 Formalizing a Contract 4.1 Syntax of Lc 4.2 Semantics of Lc 4.3 Reasoning About Contracts 5 Reasoning About Contracts Using Answer Set Programming 5.1 Answer Set Programming for Reasoning About Contracts 6 Conclusions and Related Work References From Starvation Freedom to All-Path Reachability Problems in Constrained Rewriting 1 Introduction 2 Preliminaries 2.1 Logically Constrained Rewriting 2.2 All-Path Reachability 3 LCTRSs for Asynchronous ITSs with Shared Variables 4 Reducing Non-occurrence of Error States to APR Problems 5 Reducing Starvation Freedom to APR Problems 5.1 Modification of Rewrite Rules 5.2 Characterization of Terminating States by Constrained Terms 5.3 From Starvation Freedom to APR Problems 6 Experiments 7 Related Work 8 Conclusion References SwitchLog: A Logic Programming Language for Network Switches 1 Introduction 2 SwitchLog Design 2.1 NDLog 2.2 SwitchLog 2.3 Guidelines for SwitchLog Rules 3 Compiling SwitchLog 3.1 Compiling Relations 3.2 Evaluating Rules 3.3 Optimizations 3.4 Integration with Lucid 4 Evaluation 5 Limitations and Future Work 6 Conclusion References Linear Algebraic Abduction with Partial Evaluation 1 Introduction 2 Preliminaries 3 Linear Algebraic Abduction with Partial Evaluation 3.1 Linear Algebraic Computation of Abduction 3.2 Partial Evaluation 4 Experimental Results 4.1 Original Benchmark 4.2 Enhanced Benchmark 5 Related Work 6 Conclusion References Using Hybrid Knowledge Bases for Meta-reasoning over OWL 2 QL 1 Introduction 2 Preliminaries 2.1 OWL 2 QL 2.2 Hybrid Knowledge Bases 3 Query Answering Using MSER 4 MSER Query Answering via Hybrid Knowledge Bases 4.1 General Architecture 4.2 Basic Notions 4.3 Variants 4.4 Query Equivalence 5 Evaluation 6 Discussion and Conclusion References Solving Vehicle Equipment Specification Problems with Answer Set Programming 1 Introduction 2 CAFE Problems 3 Answer Set Programming 4 The aspcafe Approach 5 Finding Pareto Optimal Solutions of Multi-objective CAFE Problems 6 Experiments 7 Conclusion References UAV Compliance Checking Using Answer Set Programming and Minimal Explanations Towards Compliance (Application Paper) 1 Introduction 2 Background 2.1 Answer Set Programming 2.2 Goal-Directed Answer Set Programming 2.3 Abductive Reasoning in ASP 2.4 AMA Safety Code for Model Aircraft Operators in ASP 2.5 Minimal Explanation for Violating Rules 3 Extending Computing Minimal Explanation to Predicate ASP 4 Conclusion and Future Work References Jury-Trial Story Construction and Analysis Using Goal-Directed Answer Set Programming 1 Introduction 1.1 Motivation and Background 1.2 Method 2 Automating Jury Decision-making 2.1 Modeling Trial Knowledge 2.2 Modeling World Knowledge 2.3 Verdict Representation 3 Evaluation of Different Verdicts and Scenarios 4 Counterfactual Reasoning 5 Discussion 6 Conclusion References Pruning Redundancy in Answer Set Optimization Applied to Preventive Maintenance Scheduling 1 Introduction 2 Definitions 3 An ASO-Based Implementation 4 Pruning Constraints and Correctness Proofs 5 Experiments 6 Conclusion References Automatic Rollback Suggestions for Incremental Datalog Evaluation 1 Introduction 2 Overview 2.1 Motivating Example 2.2 Approach Overview 3 Incremental Provenance 4 Fault Localization and Rollback Repair 4.1 Preliminaries 4.2 Fault Localization 4.3 Rollback Repair 4.4 Extensions 4.5 Full Algorithm 5 Experiments 6 Related Work 7 Conclusion References Author Index