Functional and Constraint Logic Programming: 28th International Workshop, WFLP 2020, Bologna, Italy, September 7, 2020, Revised Selected Papers (Lecture Notes in Computer Science, 12560)

✍ Scribed by Michael Hanus (editor), Claudio Sacerdoti Coen (editor)

• Publisher: Springer
• Year: 2021
• Tongue: English
• Leaves: 148
• Category: Library

✦ Synopsis

This book constitutes the refereed post-conference proceedings of the 28th International Workshop on Functional and Constraint Logic Programming, WFLP 2020, held in Bologna, Italy, in September 2020.

Due to the COVID-19, the workshop was held online.

From the 19 full papers submitted, 8 were accepted for presentation at the workshop. The accepted papers cover different programming areas of functional and logic programming, including code generation, verification, and debugging.

✦ Table of Contents

Preface
Organization
Contents
Programming Paradigms
SOS Rules for Equivalences of Reaction Systems
1 Introduction
2 Reaction Systems
3 SOS Rules for Reaction Systems
4 Bio-Simulation
4.1 Assertion Language
4.2 Bio-similarity and Bio-logical Equivalence
5 Implementation
6 Two Extensions
7 Conclusion and Future Work
References
Practical Idiomatic Considerations for Checkable Meta-logic in Experimental Functional Programming
1 Introduction
1.1 Proving and Checking
1.2 Executable Modeling
1.3 The PureCheck Framework
2 Proposed Idioms
2.1 Meta-language Marking
2.2 Nominal Axiomatics
2.3 Constructive Existentials
3 Example Application: Theory of (String) Patches
3.1 Group Words and Actions
3.2 String Editing Operations
3.3 Semantic Model
3.4 Strategical Remarks
4 Conclusion
References
Implementation and Static Analysis
On the Performance of Bytecode Interpreters in Prolog
1 Introduction
2 A Simple Language
3 Interpreter Implementations
3.1 AST Interpreter
3.2 Bytecode Interpreters
3.3 Rational Trees
4 Evaluation
4.1 Benchmarks
4.2 Results
5 Conclusions, Related and Future Work
References
Memoized Pull-Tabbing for Functional Logic Programming
1 Introduction
2 Functional Logic Programming with Curry
3 Pull-Tabbing
4 Memoized Pull-Tabbing
4.1 The Basic Scheme
4.2 Refinements for Deterministic Computations
5 Implementation
6 Benchmarks
7 Related Work
8 Conclusions
References
Effectiveness of Annotation-Based Static Type Inference
1 Introduction
2 A Note on Type Systems and Related Work
3 Foundation: plspec
4 Our Type System
4.1 Tool Architecture
4.2 Analysis
5 Evaluation
5.1 Known Limitations
5.2 Empirical Evaluation
6 Conclusion and Future Work
A Formal Inference Rules
References
Generating and Checking Exercises
A Framework for Generating Diverse Haskell-I/O Exercise Tasks
1 Introduction
2 Specifying and Testing I/O Behavior
3 Describing Parameterized Tasks
4 Building Tasks on Haskell I/O
4.1 Tasks with One Correct Answer
4.2 Tasks with Multiple Correct Answers
4.3 Tasks with Different Solution Strategies
5 Related Work
6 Conclusion and Future Work
References
Constraint Programming
Formally Verified Transformation of Non-binary Constraints into Binary Constraints
1 Introduction
2 Background
3 Coq Formalisation of HVE Translation
3.1 N-ary Constraint Satisfaction Problem
3.2 Binary Constraint Satisfaction Problem
3.3 HVE Transformation
3.4 Focus on Tuples and Extraction
3.5 Correctness of the HVE Translation
3.6 Local Consistencies
4 Brief Presentation of the Formally Verified Solver CoqbinFD
5 Extension of the Solver CoqbinFD to Non-binary Constraints
6 Conclusion
References
Constraint-Logic Object-Oriented Programming with Free Arrays
1 Motivation
2 Constraint-Logic Object-Oriented Programmingpg with Muli
3 Arrays as Logic Variables
4 Non-deterministic Access to Array Elements
5 Implementation
5.1 Modelling Constraints over Free Arrays
5.2 Conceptual Modifications to Bytecode Execution Semantics
5.3 Prototypical Implementation of Bytecode Execution Semantics
5.4 Demonstration of Prototypical Implementation
5.5 Limitations of Prototypical Implementation
6 Related Work
7 Conclusion and Outlook
References
Author Index