Abstract is missing.
- Improving Control of Logic Programs by Using Functional Logic LanguagesMichael Hanus. 1-23
- Independent AND-Parallel Implementation of NarrowingHerbert Kuchen, Juan José Moreno-Navarro, Manuel V. Hermenegildo. 24-38
- Binding Techniques and Garbage Collection for OR-Parallel CLP SystemsMichel Dorochevsky, André Véron. 39-53
- Path Analysis for Lazy Data StructuresCarsten K. Gomard, Peter Sestoft. 54-68
- Why the Occur-Check is Not a ProblemKrzysztof R. Apt, Alessandro Pellegrini. 69-86
- Incremental Evaluation of Natural Semantics SpecificationIsabelle Attali, Jacques Chazarain, Serge Gilette. 87-99
- Subsumption-oriented Push-Down AutomataFrançois Barthélemy, Eric Villemonte de la Clergerie. 100-114
- Unlimp, Uniqueness as a Leitmotiv for ImplementationStefan Kahrs. 115-129
- Using Cached Functions and Constructors for Incremental Attribute EvaluationMaarten Pennings, S. Doaitse Swierstra, Harald Vogt. 130-144
- Strictness Analysis for Attribute GrammarsMads Rosendahl. 145-157
- Checking and Debugging of Two-level GrammarsSadeph Saidi, Jean-François Boulicaut. 158-171
- On Safe FoldingAnnalisa Bossi, Nicoletta Cocco, Sandro Etalle. 172-186
- Unfold/fold Transformations Preserving Termination PropertiesTorben Amtoft. 187-201
- A technique for Transforming Logic Programs by Fold-Unfold TransformationsFrancis Alexandre. 202-216
- FOLON: An Environment for Declarative Construction of Logic ProgramsJean Henrard, Baudouin Le Charlier. 217-231
- A Complete Indexing Scheme for WAM-based Abstract MachinesWerner Hans. 232-244
- Fast Prolog with VAM1p based Prolog CompilerAndreas Krall, Thomas Berger. 245-259
- Metastructures versus Attributed Variables in the Context of Extensible UnificationChristian Holzbaur. 260-268
- Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract InterpretationPatrick Cousot, Radhia Cousot. 269-295
- Deriving of Linear Size Relations by Abstract InterpretationKristof Verschaetse, Danny De Schreye. 296-310
- Generic Abstract Interpretation Algorithms For Prolog: Tow Optimization Techniques and Their Experimental EvaluationVincent Englebert, Baudouin Le Charlier, Didier Roland, Pascal Van Hentenryck. 310-325
- A Bottom-Up Interpreter for a Higher-Order Logic Programming LanguageAlain Hui-Bon-Hoa. 326-340
- CAMEL: An Extension of the Categorial Abstract Machine to Compile Functional/Logic ProgramsAndy Mück. 341-354
- On the Interaction of Lazy Evaluation and BacktrackingWerner Hans, Rita Loogen, Stephan Winkler. 355-369
- Interprocedural Dynamic Slicing370-384
- Algorithmic Debugging for Lazy Functional LanguagesHenrik Nilsson, Peter Fritzson. 385-399
- A General Trace Query Mechanism Based on PrologMireille Ducassé. 400-414
- Fully Declarative Logic ProgrammingJan A. Plaza. 415-427
- Our LIPS Are Sealed: Interfacing Functional and Logic Programming SystemsGary Lindstrom, Jan Maluszynski, Takeshi Ogi. 428-442
- Analyses of Inconsistency for Incremental Equational Logic ProgrammingMaría Alpuente, Moreno Falaschi, Ferdinando Manzo. 443-457
- I/O Trees and Interactive Lazy Functional ProgrammingSamuel A. Rebelsky. 458-472
- UCG-E: An Equational Logic Programming SystemLutz H. Hamel. 473-474
- A Relational Programming System with Inferred RepresentationsDave Cattrall, Colin Runciman. 475-476
- An Implementation of Action Semantics (Summaray)Hermano Moura. 477-478
- BinProlog: a Continuation Passing Style Prolog EnginePaul Tarau. 479-480
- LaToKi: A Language Toolkit for Bottom-Up Evaluation of Functional ProgramsPeter Thiemann. 481-482
- Implementing Higher-Order Functions in an Algebraic Specification Language with NarrowingBernhard Reus. 483-484
- Implementing Attribute Grammars by Computational ModelsJaak Vilo. 485-486
- ProQuery: Logical Access to an OODBChu Min Li, Paul Y. Gloess. 487-488
- Inference of Inheritance Relationships from Prolog Programs: a System Developed with PrologIIIChristine Solnon, Michel Rueher. 489-490
- CLP(PB), A Meta-Interpreter in CLP(R)Peter Barth. 491-492