Functional and Constraint Logic Programming, 18th International Workshop, WFLP 2009, Brasilia, Brazil, June 28, 2009, Revised Selected Papers

3642119980......Page 1
Lecture Notes in Computer Science 5979......Page 2
Functional\rand Constraint\rLogic Programming......Page 3
Preface......Page 5
Organization......Page 7
Table of Contents......Page 8
Introduction......Page 9
Data Description......Page 10
Functional Programming......Page 11
Object-Oriented Programming......Page 14
Goal-Oriented Programming......Page 15
Concurrent Programming......Page 17
Final Remarks......Page 18
References......Page 19
Introduction......Page 21
Abstract Reduction Systems......Page 22
Abstract Strategies......Page 25
Intensional Strategies......Page 26
Constraints and Strategies......Page 28
Conclusion......Page 32
References......Page 33
Introduction......Page 35
$TOY$ with SICStus Prolog CLP(FD): TOY(FDs)......Page 36
ILOG CP to Improve $TOY$......Page 37
$TOY$ with ILOG CP: $TOY(FDi)$......Page 38
Connecting SICStus Prolog to C++......Page 39
Communication between $TOY$ and ILOG CP......Page 40
A $TOY(FDi)$ Example......Page 45
Measuring Performance......Page 48
References......Page 50
Introduction......Page 52
Constrained Equational Rewrite Systems......Page 56
Context-Sensitive Rewriting with CERSs......Page 59
Dependency Pairs for Rewriting with CS-CERSs......Page 60
Dependency Graphs......Page 63
Reduction Pairs......Page 64
Evaluation and Conclusions......Page 66
References......Page 67
Introduction......Page 70
Combinatory Reduction Systems......Page 74
Binding Algebras......Page 75
Algebra of Meta-terms......Page 76
Semantic Labelling for Meta-terms......Page 77
Commutativity......Page 79
Example......Page 80
Labelling with Quasi-models......Page 81
References......Page 83
Introduction......Page 87
The Boyer–Moore Algorithm......Page 88
Logic Program Transformation Tools......Page 91
Guidelines of Our Derivations......Page 93
Deriving the Search Part of Some Variants of the Boyer–Moore Algorithm......Page 95
Conclusions......Page 101
References......Page 102
Introduction......Page 104
Domain-Free Lambda Calculi with Existence......Page 106
Lambda Calculus with Implication and Existence......Page 107
Lambda Calculus with Negation, Conjunction, and Existence......Page 108
Type Checking and Type Inference......Page 109
TC and TI Are Equivalent in DF-\\lamda^{right arrow\\exists}......Page 110
Translation to Closed Terms......Page 114
Concluding Remarks......Page 116
References......Page 117
Introduction......Page 119
Fundamentals of Size-Change Analysis......Page 121
A Procedure for Size-Change Analysis......Page 123
Offline Partial Evaluation of Logic Programs......Page 128
Prolog Implementation and Empirical Evaluation......Page 129
Propagating Partial Left-to-Right Information......Page 132
References......Page 134
Introduction......Page 136
Higher Order Patterns......Page 137
Local Definitions......Page 138
Preliminaries......Page 139
Type Derivation......Page 140
Properties of the Typing Relations......Page 142
Subject Reduction......Page 143
Type Inference for Expressions......Page 145
Type Inference for Programs......Page 148
Conclusions and Future Work......Page 150
References......Page 151
Introduction......Page 153
Operational Semantics......Page 155
Region Annotations......Page 157
Region Implementation......Page 159
The Region Inference Algorithm......Page 160
A High-Level View of the Algorithm......Page 161
Region Inference of Function Definitions......Page 162
Second Phase of Region Inference......Page 163
The Kernel of the Algorithm......Page 164
Examples......Page 165
Related Work and Conclusions......Page 167
References......Page 169
Introduction......Page 170
Motivating Example......Page 172
Preliminary Notions......Page 175
The Higher-Order Rewriting Logic GHRC......Page 177
Intended Models of CPRS-Programs......Page 180
Declarative Debugging of Wrong Answers in GHRC......Page 182
Conclusions, Related and Future Work......Page 184
References......Page 185
Author Index......Page 187