Functional and Logic Programming: 4th Fuji International Symposium, FLOPS'99 Tsukuba, Japan, November 11-13, 1999 ProceedingsAart Middeldorp, Taisuke Sato 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. |
Contents
Semantics and Types in Functional Logic Programming | 1 |
Polytypic Programming With Ease Extended Abstract | 21 |
Type Inference for Overloading without Restrictions | 37 |
Partial Evaluation and Noninterference for Object Calculi | 53 |
Lazy Lexing is Fast | 68 |
A FunctionalLogic Perspective of Parsing | 85 |
Implementing Encapsulated Search for a Lazy Functional Logic | 100 |
Comparison of Deforestation Techniques for Functional Programs | 114 |
An Interval LatticeBased Constraint Solving Framework for Lattices | 194 |
Higher Order Matching for Program Transformation | 209 |
Automated Generalisation of Function Definitions | 225 |
An Extensional Characterization of LambdaLifting | 241 |
Application to Groundness Analysis | 267 |
A Space Efficient Engine for SubsumptionBased Tabled Evaluation | 284 |
A CurryHoward Isomorphism | 300 |
On Reducing the Search Space of HigherOrder Lazy Narrowing | 319 |
Automatic Verification Based on Abstract Interpretation | 131 |
A Transformation System for Lazy Functional Logic Programs | 147 |
Termination Analysis of Tabled Logic Programs Using Mode | 163 |
On QuasiReductive and QuasiSimplifying Deterministic | 179 |
Typed HigherOrder Narrowing without HigherOrder Strategies | 335 |
A Semantics for Program Analysis in NarrowingBased Functional Logic | 353 |
Author Index | 369 |
Other editions - View all
Functional and Logic Programming: 4th Fuji International Symposium, FLOPS'99 ... Aart Middeldorp,Taisuke Sato No preview available - 1999 |
Common terms and phrases
abstract interpretation abstract machine algorithm analysis annotations answer application argument arity atom bool calculus called clause CLNC Computer Science condition constraint constructor context defined definition denoted deterministic domain DTSA equations evaluation example finite first-order functional logic languages functional logic programs Functional Programming functor generalisation given goal Haskell higher-order implementation induction inference input instantiated lambda lambda-dropping lambda-lifting lattice lazy evaluation lazy narrowing Lemma level mapping lexeme lexer LNCS Logic Programming match Middeldorp node normal operational operational semantics overloading parsers partial evaluation pattern polytypic predicate Proc programming language Prolog proof properties Proposition quasi-reductive recursive reduction regular expressions result rewrite systems rules Section semantics sequence sequent calculus solution Springer-Verlag strategy substitution symbols term termination Theorem tion transformation trees true type declarations type inference type system type variables unification well-typed