4. FLOPS 1999: Tsukuba, Japan

• Juan Carlos González Moreno, Maria Teresa Hortalá-González, Mario Rodríguez-Artalejo:
  Semantics and Types in Functional Logic Programming. 1-20
  
• Ralf Hinze:
  Polytypic Programming With Ease (Extended Abstract). 21-36
  
• Carlos Camarão, Lucília Figueiredo:
  Type Inference for Overloading without Restrictions, Declarations or Annotations. 37-52
  
• Gilles Barthe, Bernard P. Serpette:
  Partial Evaluation and Non-inference for Object Calculi. 53-67
  
• Manuel M. T. Chakravarty:
  Lazy Lexing is Fast. 68-84
  
• Rafael Caballero, Francisco Javier López-Fraguas:
  A Functional-Logic Perspective on Parsing. 85-99
  
• Wolfgang Lux:
  Implementing Encapsulated Search for a Lazy Functional Logic Language. 100-113
  
• Armin Kühnemann:
  Comparison of Deforestation Techniques for Functional Programs and for Tree Transducers. 114-130
  
• Mizuhito Ogawa:
  Automatic Verification Based on Abstract Interpretation. 131-146
  
• María Alpuente, Moreno Falaschi, Ginés Moreno, Germán Vidal:
  A Transformation System for Lazy Functional Logic Programs. 147-162
  
• Sofie Verbaeten, Danny De Schreye:
  Termination Analysis of Tabled Logic Programs Using Mode and Type Information. 163-178
  
• Enno Ohlebusch:
  On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems. 179-193
  
• Antonio J. Fernández, Patricia M. Hill:
  An Interval Lattice-Based Constraint Solving Framework for Lattices. 194-208
  
• Oege de Moor, Ganesh Sittampalam:
  Higher Order Matching for Program Transformation. 209-224
  
• Adam Bakewell, Colin Runciman:
  Automated Generalisation of Function Definitions. 225-240
  
• Olivier Danvy:
  An Extensional Characterization of Lambda-Lifting and Lambda-Dropping. 241-250
  
• Christoph Beierle, Gregor Meyer:
  Using Types as Approximations for Type Checking Prolog Programs. 251-266
  
• Olivier Ridoux, Patrice Boizumault, Frédéric Malésieux:
  Typed Static Analysis: Application to Groundness Analysis of PROLOG and lambda-PROLOG. 267-283
  
• Ernie Johnson, C. R. Ramakrishnan, I. V. Ramakrishnan, Prasad Rao:
  A Space Efficient Engine for Subsumption-Based Tabled Evaluation of Logic Programs. 284-300
  
• Atsushi Ohori:
  The Logical Abstract Machine: A Curry-Howard Isomorphism for Machine Code. 300-318
  
• Mircea Marin, Tetsuo Ida, Taro Suzuki:
  On Reducing the Search Space of Higher-Order Lazy Narrowing. 319-334
  
• Sergio Antoy, Andrew P. Tolmach:
  Typed Higher-Order Narrowing without Higher-Order Strategies. 335-353
  
• Michael Hanus, Salvador Lucas:
  A Semantics for Program Analysis in Narrowing-Based Functional Logic Languages. 353-368
  

Last update Wed May 22 23:32:30 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page