2. PLILP 1990: Linköping, Sweden

Implementation of Term Rewriting

• Claude Kirchner, Patrick Viry:
  Implementing Parallel Rewriting. 1-15
  
• Andy Mück:
  Compilation of Narrowing. 16-29
  

Algorithmic Programming

• Franz-Josef Grosch, Gregor Snelting:
  Inference-Based Overloading Resolution for ADA. 30-44
  
• Jonathan P. Bowen, Jifeng He, Paritosh K. Pandya:
  An Approach to Verifiable Compiling Specification and Prototyping. 45-59
  
• Mariam Kamkar, Nahid Shahmehri, Peter Fritzson:
  Bug Localization by Algorithmic Debugging and Program Slicing. 60-74
  

Constraint Logic Programming

• Pierre Lim, Peter J. Stuckey:
  A Constraint Logic Programming Shell. 75-88
  
• Juhani Jaakola:
  Modifying the Simplex Algorithm to a Constraint Solver. 89-105
  
• Pierre Lim, David N. Morley:
  Implementing a Meta-Logical Scheme. 106-120
  

Implementation of Logic Programming

• Andreas Krall, Ulrich Neumerkel:
  The Vienna Abstract Machine. 121-135
  
• Serge Le Huitouze:
  A New Data Structure for Implementing Extensions to Prolog. 136-150
  

Logic Programming

• Dan Sahlin:
  Finding the Least Fixed Point Using Wait-Declarations in Prolog. 151-158
  
• Paul Tarau, Michel Boyer:
  Elementary Logic Programs. 159-173
  
• Laurent Fribourg:
  A New Presburger Arithmetic Decision Procedure Based on Extended Prolog Execution. 174-188
  

Static Analysis

• Ian A. Mason, Carolyn L. Talcott:
  Reasoning About Programs with Effects. 189-203
  
• Bal Wang, R. K. Shyamasundar:
  Towards a Characterization of Termination of Logic Programs. 204-221
  
• Pierre De Boeck, Baudouin Le Charlier:
  Static Type Analysis of Prolog Procedures for Ensuring Correctness. 222-237
  

Functional Programming

• Andrea Asperti:
  Integrating Strict and Lazy Evaluation: The lambda-sl-Calculus. 238-254
  
• Xavier Leroy:
  Efficient Data Representation in Polymorphic Languages. 255-276
  

Abstract Interpretation

• Shmuel Sagiv, Nissim Francez, Michael Rodeh, Reinhard Wilhelm:
  A Logic-Based Approach to Data Flow Analysis Problem. 277-292
  
• Ulf Nilsson:
  Systematic Semantic Approximations of Logic Programs. 293-306
  
• François Bourdoncle:
  Interprocedural Abstract Interpretation of Block Structured Languages with Nested Procedures, Aliasing and Recursivity. 307-323
  
• Veroniek Dumortier, Maurice Bruynooghe:
  On the Automatic Generation of Events in Delta Prolog. 324-339
  

Implementation of Pattern Matching

• Christian Queinnec:
  Compilation of Non-Linear, Second Order Patterns on S-Expressions. 340-357
  
• Christian Ferdinand:
  Pattern Matching in a Functional Transformation Language using Treeparsing. 358-371
  

Integration of Logic Programming and Functional Programming

• Antonio Brogi, Paolo Mancarella, Dino Pedreschi, Franco Turini:
  Logic Programming within a Functional Framework. 372-386
  
• Michael Hanus:
  Compiling Logic Programs with Equality. 387-400