4. PLILP 1992: Leuven, Belgium

Invited Lecture

• Michael Hanus:
  Improving Control of Logic Programs by Using Functional Logic Languages. 1-23
  

Parallelism

• Herbert Kuchen, Juan José Moreno-Navarro, Manuel V. Hermenegildo:
  Independent AND-Parallel Implementation of Narrowing. 24-38
  
• Michel Dorochevsky, André Véron:
  Binding Techniques and Garbage Collection for OR-Parallel CLP Systems. 39-53
  

Static Analysis

• Carsten K. Gomard, Peter Sestoft:
  Path Analysis for Lazy Data Structures. 54-68
  
• Krzysztof R. Apt, Alessandro Pellegrini:
  Why the Occur-Check is Not a Problem. 69-86
  , long version: TOPLAS 16(3): 687-726 (1994)

Implementation

• Isabelle Attali, Jacques Chazarain, Serge Gilette:
  Incremental Evaluation of Natural Semantics Specification. 87-99
  
• François Barthélemy, Eric Villemonte de la Clergerie:
  Subsumption-oriented Push-Down Automata. 100-114
  
• Stefan Kahrs:
  Unlimp, Uniqueness as a Leitmotiv for Implementation. 115-129
  

Attribute Grammars

• Maarten Pennings, S. Doaitse Swierstra, Harald Vogt:
  Using Cached Functions and Constructors for Incremental Attribute Evaluation. 130-144
  
• Mads Rosendahl:
  Strictness Analysis for Attribute Grammars. 145-157
  
• Sadeph Saidi, Jean-François Boulicaut:
  Checking and Debugging of Two-level Grammars. 158-171
  

Transformation/Synthesis

• Annalisa Bossi, Nicoletta Cocco, Sandro Etalle:
  On Safe Folding. 172-186
  
• Torben Amtoft:
  Unfold/fold Transformations Preserving Termination Properties. 187-201
  
• Francis Alexandre:
  A technique for Transforming Logic Programs by Fold-Unfold Transformations. 202-216
  
• Jean Henrard, Baudouin Le Charlier:
  FOLON: An Environment for Declarative Construction of Logic Programs. 217-231
  

Implementation II

• Werner Hans:
  A Complete Indexing Scheme for WAM-based Abstract Machines. 232-244
  
• Andreas Krall, Thomas Berger:
  Fast Prolog with VAM1p based Prolog Compiler. 245-259
  
• Christian Holzbaur:
  Metastructures versus Attributed Variables in the Context of Extensible Unification. 260-268
  

Invited Lecture

• Patrick Cousot, Radhia Cousot:
  Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation. 269-295
  

Abstract Interpretation

• Kristof Verschaetse, Danny De Schreye:
  Deriving of Linear Size Relations by Abstract Interpretation. 296-310
  
• Vincent Englebert, Baudouin Le Charlier, Didier Roland, Pascal Van Hentenryck:
  Generic Abstract Interpretation Algorithms For Prolog: Tow Optimization Techniques and Their Experimental Evaluation. 310-325
  

Implementation III

• Alain Hui-Bon-Hoa:
  A Bottom-Up Interpreter for a Higher-Order Logic Programming Language. 326-340
  
• Andy Mück:
  CAMEL: An Extension of the Categorial Abstract Machine to Compile Functional/Logic Programs. 341-354
  
• Werner Hans, Rita Loogen, Stephan Winkler:
  On the Interaction of Lazy Evaluation and Backtracking. 355-369
  

Debugging

• Mariam Kamkar, Nahid Shahmehri, Peter Fritzson:
  Interprocedural Dynamic Slicing. 370-384
  
• Henrik Nilsson, Peter Fritzson:
  Algorithmic Debugging for Lazy Functional Languages. 385-399
  
• Mireille Ducassé:
  A General Trace Query Mechanism Based on Prolog. 400-414
  

Integration

• Jan A. Plaza:
  Fully Declarative Logic Programming. 415-427
  
• Gary Lindstrom, Jan Maluszynski, Takeshi Ogi:
  Our LIPS Are Sealed: Interfacing Functional and Logic Programming Systems. 428-442
  
• María Alpuente, Moreno Falaschi, Ferdinando Manzo:
  Analyses of Inconsistency for Incremental Equational Logic Programming. 443-457
  
• Samuel A. Rebelsky:
  I/O Trees and Interactive Lazy Functional Programming. 458-472
  

System Demonstrations

• Lutz H. Hamel:
  UCG-E: An Equational Logic Programming System. 473-474
  
• Dave Cattrall, Colin Runciman:
  A Relational Programming System with Inferred Representations. 475-476
  
• Hermano Moura:
  An Implementation of Action Semantics (Summaray). 477-478
  
• Paul Tarau:
  BinProlog: a Continuation Passing Style Prolog Engine. 479-480
  
• Peter Thiemann:
  LaToKi: A Language Toolkit for Bottom-Up Evaluation of Functional Programs. 481-482
  
• Bernhard Reus:
  Implementing Higher-Order Functions in an Algebraic Specification Language with Narrowing. 483-484
  
• Jaak Vilo:
  Implementing Attribute Grammars by Computational Models. 485-486
  
• Chu Min Li, Paul Y. Gloess:
  ProQuery: Logical Access to an OODB. 487-488
  
• Christine Solnon, Michel Rueher:
  Inference of Inheritance Relationships from Prolog Programs: a System Developed with PrologIII. 489-490
  
• Peter Barth:
  CLP(PB), A Meta-Interpreter in CLP(R). 491-492