Functional and Constraint Logic Programming

Name: Functional and Constraint Logic Programming | 26th International Workshop, WFLP 2018, Frankfurt/Main, Germany, September 6, 2018, Revised Selected Papers
Brand: Springer
Price: 53.49 EUR
Availability: OnlineOnly

26th International Workshop, WFLP 2018, Frankfurt/Main, Germany, September 6, 2018, Revised Selected Papers

Josep Silva(Herausgeber*in)

Springer (Verlag)

Erschienen am 15. März 2019

VII, 179 Seiten

E-Book

PDF mit Wasserzeichen-DRM

Systemvoraussetzungen

978-3-030-16202-3 (ISBN)

53,49 €inkl. 7% MwSt.

Systemvoraussetzungen

für PDF mit Wasserzeichen-DRM

E-Book Einzellizenz

Als Download verfügbar

Beschreibung

Weitere Details

Weitere Ausgaben

Inhalt

Intro
Preface
Organization
Contents
Compilers and Code Generation
Transpiling Programming Computable Functions to Answer Set Programs
1 Introduction
2 Programming Computable Functions
2.1 Syntax
2.2 Operational Semantics
3 Answer Set Programming
3.1 Language
3.2 Grounding (and Solving)
4 Translation
4.1 Characterisation of the Translation
4.2 Conventions
4.3 Static Preamble
4.4 Translation Algorithm
4.5 Optimisations
4.6 Implementation
5 Applications
5.1 Multiple Interpretations for One Variable
5.2 Towards a More Expressive Language
6 Conclusion
References
Code Generation for Higher Inductive Types
1 Introduction
2 Background
2.1 Higher Inductive Types
2.2 Agda Reflection
3 Code Generation for Inductive Types
3.1 Non-dependent Eliminators
3.2 Dependent Eliminators
4 Code Generation for Higher Inductive Types
4.1 Non-dependent Eliminators for HITs
4.2 Dependent Eliminators for HITs
5 Applications
5.1 Patch Theory Revisited
5.2 Cryptographic Protocols
6 Related Work
7 Conclusion and Future Work
References
Debugging and Testing
Measuring Coverage of Prolog Programs Using Mutation Testing
1 Introduction and Motivation
2 Code Coverage Metrics
2.1 Mutation Testing
3 Mutation Operators
3.1 Sensible Mutations
3.2 Foolish Mutations
4 A Mutation Testing Framework
5 Empirical Evaluation
5.1 Sensibility of Mutations
5.2 Comparison with Predicate and Clause Coverage
6 Related Work
7 Future Work
8 Conclusion
References
Runtime Verification in Erlang by Using Contracts
1 Introduction
2 Contracts in Erlang
2.1 The Contracts
2.2 Implementation Details
3 Concurrency
3.1 Erlang Behaviours
3.2 The gen_server Behaviour, and How to Improve It
3.3 Selective Receives
3.4 Readers-Writers Example
4 Related Work
5 Conclusions
References
Enhancing POI Testing Through the Use of Additional Information
1 Introduction
2 POI Testing
3 Enhancing POI Testing with Additional Information
3.1 Augmenting Traces with Additional Information
3.2 Using Augmented Traces to Compare Program Behaviour
3.3 Reporting Customized Error Types
3.4 POI Testing Configurations
4 Enhancement by Using Improved Call Tracing
4.1 Motivation
4.2 Implementation Details of the Call Tracing
4.3 Using the Enhanced Call Tracing to Compare Traces
5 Related Work
6 Conclusions
References
Foundations of Functional Logic Programming
Synthesizing Set Functions
1 Introduction
2 Functional Logic Programming and Curry
3 Set Functions
4 Plural Functions
5 Synthesis of Set Functions: The Simple Way
6 Adding Call-Time Choice
7 Synthesis of Nested Set Functions
8 Related Work
9 Conclusions
References
Towards a Constraint Solver for Proving Confluence with Invariant and Equivalence of Realistic CHR Programs
1 Introduction
1.1 Related Work
1.2 Contributions
1.3 Overview
2 Preliminaries
3 Prolog-Based CHR
3.1 Constraints, Substitutions and States
3.2 Syntax
3.3 Operational Semantics
3.4 Invariants and Confluence
4 A Meta-Level Transition System for CHR
4.1 Meta-Level States
4.2 Operational Semantics
4.3 Invariants and Equivalences
4.4 Meta-Level Joinability and Splitting
5 Confluence
6 Conclusion
References
Reference Type Logic Variables in Constraint-Logic Object-Oriented Programming
1 Motivation
2 Constraint-Logic Object-Oriented Programming with Muli
3 Reference Type Logic Variables (or Free Objects)
3.1 Accessing a Field of a Free Object
3.2 Invoking a Method on a Free Object
3.3 Comparing Reference Equality of Reference Type Logic Variables
3.4 Comparing Value Equality of Reference Type Logic Variables
3.5 Performing Type Operations on a Free Object
3.6 Imposing a Constraint for Structural Equality Between Two Objects
4 Implementation
5 Related Work
6 Concluding Remarks
References
FMS: Functional Programming as a Modelling Language
1 Introduction
1.1 Context
1.2 Search Technologies
1.3 First Order or Higher Order?
1.4 Advantages
2 Language
2.1 Core Language
2.2 Full Language
3 General Workflow
3.1 Parse and Desugar
3.2 Optimise
3.3 Type Check
3.4 Translate
3.5 Clingo
3.6 Reinterpreting the Answer Sets
4 Optimisations
4.1 Stratifying Definitions
4.2 Inlining
4.3 Boolean Simplifications
4.4 Constant Folding and Beta Reductions
4.5 Combining the Optimisations
4.6 Future Optimisations
5 Dependencies and Availability
6 Conclusion
References
Functional Federated Learning in Erlang (ffl-erl)
1 Introduction
2 Background
2.1 Federated Learning
2.2 Federated Stochastic Gradient Descent
2.3 Motivating Use Case
3 Solution
3.1 The Skeleton of the Framework
3.2 A Neural Network with Backpropagation in Erlang
3.3 The Combined Framework
3.4 Evaluation
4 Related Work
5 Future Work
A Mathematical Derivation of Federated Stochastic Gradient Descent
References
Author Index

Systemvoraussetzungen

Als PDF speichern Als Link merken