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