8. PLILP 1996: Aachen, Germany

Invited Talk

• Lambert G. L. T. Meertens:
  Calculate Polytypically! 1-16
  

Typing and Structuring Systems

• Stefan Kahrs:
  Limits of ML-Definability. 17-31
  
• Gianna Bellè, C. Barry Jay, Eugenio Moggi:
  Functorial ML. 32-46
  
• Pascale Louvet, Olivier Ridoux:
  Parametric Polymorphism for Typed Prolog and lambda-Prolog. 47-61
  
• Joaquín Mateos-Lago, Mario Rodríguez-Artalejo:
  GOTA Algebras: A Specification Formalism for Inheritance and Object Hierarchies. 62-76
  

Progam Analysis

• Maria J. García de la Banda, Francisco Bueno, Manuel V. Hermenegildo:
  Towards Independent And-Parallelism in CLP. 77-91
  
• Geoffrey Weyer, William H. Winsborough:
  Annotated Structure Shape Graphs for Abstract Analysis of Prolog. 92-106
  
• Roberto Bagnara:
  A Reactive Implementation of Pos Using ROBDDs. 107-121
  
• Didier Parigot, Gilles Roussel, Martin Jourdan, Étienne Duris:
  Dynamic Attribute Grammars. 122-136
  

Program Transformation

• Michael Leuschel, Danny De Schreye:
  Logic Program Specialisation: How To Be More Specific. 137-151
  
• Robert Glück, Jesper Jørgensen, Bern Martens, Morten Heine Sørensen:
  Controlling Conjunctive Partial Deduction. 152-166
  
• Nicoletta De Francesco, Antonella Santone:
  Unfold/Fold Transformations of Concurrent Processes. 167-181
  
• Olivier Danvy, René Vestergaard:
  Semantics-Based Compiling: A Case Study in Type-Directed Partial Evaluation. 182-197
  
• Peter Thiemann:
  Implementing Memoization for Partial Evaluation. 198-212
  
• Geoff W. Hamilton:
  Higher Order Deforestation. 213-227
  

Implementation Issues

• Christoph W. Keßler:
  Scheduling Expression DAGs for Minimal Register Need. 228-242
  
• Juliana Freire, Terrance Swift, David Scott Warren:
  Beyond Depth-First: Improving Tabled Logic Programs through Alternative Scheduling Strategies. 243-258
  
• Xining Li:
  Program Sharing: A New Implementation Approach for Prolog. 259-273
  

Concurrent and Parallel Programming

• Sergei Gorlatch:
  Systematic Extraction and Implementation of Divide-and-Conquer Parallelism. 274-288
  
• Luis A. Galán, Cristóbal Pareja, Ricardo Pena:
  Functional Skeletons Generate Process Topologies in Eden. 289-303
  
• Thomas Gehrke, Michaela Huhn:
  ProFun - A Language for Executable Specifications. 304-318
  
• Maribel Fernández, Ian Mackie:
  From Term Rewriting to Generalised Interaction Nets. 319-333
  

Tools and Programming Environments

• Maria Virginia Aponte, Roberto Di Cosmo:
  Type Isomorphisms for Module Signatures. 334-346
  
• Salvatore Ruggieri:
  Decidability of Logic Program Semantics and Applications to Testing. 347-362
  
• Enno Scholz:
  PIDGETS - Unifying Pictures and Widgets in a Constraint-Based Framework for Concurrent Functional GUI Programming. 363-377
  

Lambda-Calculus and Rewriting

• Fairouz Kamareddine, Alejandro Ríos:
  Generalized beta-Reduction and Explicit Substitution. 378-392
  
• Zine-El-Abidine Benaissa, Pierre Lescanne, Kristoffer Høgsbro Rose:
  Modeling Sharing and Recursion for Weak Reduction Strategies Using Explicit Substitution. 393-407
  
• Salvador Lucas:
  Context-Sensitive Computations in Confluent Programs. 408-422
  

Constraints

• Peter J. Stuckey, Vincent Tam:
  Models for Using Stochastic Constraint Solvers in Constraint Logic Programming. 423-437
  
• Peter Van Roy, Michael Mehl, Ralf Scheidhauer:
  Integrating Efficient Records into Concurrent Constraint Programming. 438-453
  

Deductive Database Languages

• Mengchi Liu:
  The LOL Deductive Database Programming Language (Extended Abstract). 454-468
  

Posters and Demonstrations

• Christian Fecht:
  An Efficient and Precise Sharing Domain for Logic Programs. 469-470
  
• Zhenjiang Hu, Hideya Iwasaki, Masato Takeichi:
  Cheap Tupling in Calculational Form. 471-472
  
• Sergio Antoy:
  Needed Narrowing in Prolog (Extended Abstract). 473-474
  
• Germán Puebla, Manuel V. Hermenegildo:
  Automatic Optimization of Dynamic Scheduling in Logic Programs. 475-476
  
• Christian Schulte:
  Oz Explorer: A Visual Constraint Programming Tool. 477-478