Functional and Logic Programming: 4th Fuji International Symposium, FLOPS’99 Tsukuba, Japan, November 11-13, 1999 Proceedings

J. C. González-Moreno, M. T. Hortalá-González (auth.), Aart Middeldorp, Taisuke Sato (eds.)354066677X, 9783540666776

This volume contains the papers presented at the 4th Fuji International S- posium on Functional and Logic Programming (FLOPS’99) held in Tsukuba, Japan, November 11–13, 1999, and hosted by the Electrotechnical Laboratory (ETL). FLOPS is a forum for presenting and discussing all issues concerning functional programming, logic programming, and their integration. The sym- sium takes place about every 1.5 years in Japan. Previous FLOPS meetings were held in Fuji Susuno (1995), Shonan Village (1996), and Kyoto (1998). 1 There were 51 submissions from Austria ( ),Belgium (2),Brazil(3),China 3 3 1 7 (1), Denmark (2), France (3 ), Germany (8), Ireland (1), Israel ( ), Italy (1 ), 4 3 12 1 Japan (9 ), Korea (1), Morocco (1), The Netherlands (1), New Zealand (1), 3 1 1 3 5 Portugal ( ), Singapore ( ), Slovakia (1), Spain (4 ), Sweden (1), UK (4 ), 2 3 4 6 1 and USA (2 ), of which the program committee selected 21 for presentation. In 4 addition, this volume contains full papers by the two invited speakers, Atsushi Ohori and Mario Rodr´?guez-Artalejo.

---

Table of contents :
Front Matter….Pages –
Semantics and Types in Functional Logic Programming….Pages 1-20
Polytypic Programming With Ease….Pages 21-36
Type Inference for Overloading without Restrictions, Declarations or Annotations….Pages 37-52
Partial Evaluation and Non-interference for Object Calculi….Pages 53-67
Lazy Lexing is Fast….Pages 68-84
A Functional-Logic Perspective of Parsing….Pages 85-99
Implementing Encapsulated Search for a Lazy Functional Logic Language….Pages 100-113
Comparison of Deforestation Techniques for Functional Programs and for Tree Transducers….Pages 114-130
Automatic Verification Based on Abstract Interpretation….Pages 131-146
A Transformation System for Lazy Functional Logic Programs….Pages 147-162
Termination Analysis of Tabled Logic Programs Using Mode and Type Information….Pages 163-178
On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems….Pages 179-193
An Interval Lattice-Based Constraint Solving Framework for Lattices….Pages 194-208
Higher Order Matching for Program Transformation….Pages 209-224
Automated Generalisation of Function Definitions….Pages 225-240
An Extensional Characterization of Lambda-Lifting and Lambda-Dropping….Pages 241-250
Using Types as Approximations for Type Checking Prolog Programs….Pages 251-266
Typed Static Analysis: Application to Groundness Analysis of Prolog and λ Prolog ….Pages 267-283
A Space Efficient Engine for Subsumption-Based Tabled Evaluation of Logic Programs….Pages 284-299
The Logical Abstract Machine: A Curry-Howard Isomorphism for Machine Code….Pages 300-318
On Reducing the Search Space of Higher-Order Lazy Narrowing….Pages 319-334
Typed Higher-Order Narrowing without Higher-Order Strategies….Pages 335-352
A Semantics for Program Analysis in Narrowing-Based Functional Logic Languages….Pages 353-368
Back Matter….Pages –