4. FLOPS 1999: Tsukuba, Japan

@proceedings{DBLP:conf/flops/1999,
  editor    = {Aart Middeldorp and
               Taisuke Sato},
  title     = {Functional and Logic Programming, 4th Fuji International Symposium,
               FLOPS'99, Tsukuba, Japan, November 11-13, 1999, Proceedings},
  booktitle = {FLOPS},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1722},
  year      = {1999},
  isbn      = {3-540-66677-X},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

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