5. PLILP 1993: Tallinn, Estonia

Invited Talk

• Uwe Kastens:
  Executable Specifications for Language Implementation. 1-11

Integration of Different Paradigms I

• Johan Boye:
  Avoiding Dynamic Delays in Functional Logic Programs. 12-27
• Michael Hanus, Berthold Josephs:
  A Debugging Model for Functional Logic Programs. 28-43

Constraint Programming

• Pierre Lim, Joachim Schimpf:
  A Conservative Approach to Meta-Programming in Constraint Logic Programming. 44-59
• Jean Jourdan, Thierry Sola:
  The Versatility of Handling Disjunctions as Constraints. 60-74

Static Analysis and Abstract Interpretation I

• Marc-Michel Corsini, Kaninda Musumbu, Antoine Rauzy, Baudouin Le Charlier:
  Efficient Bottom-up Abstract Interpretation of Prolog by Means of Constraint Solving over Symbolic Finite Domains. 75-91
• Andreas Kågedal:
  Improvements in Compile-Time Analysis for Ground Prolog. 92-107

Grammars

• Mark-Jan Nederhof:
  A New Top-Down Parsing Algorithm for Left-Recursive DCGs. 108-122
• Martin Jourdan, Carole Le Bellec, Didier Parigot, Gilles Roussel:
  Specification and Implementation of Grammar Couplings using Attribute Grammars. 123-136
• Arnd Poetzsch-Heffter:
  Programming Language Specification and Prototyping Using the MAX System. 137-150

Invited Talk

• Andrei Mantsivoda:
  Flang and its Implementation. 151-166

Narrowing I

• Juan José Moreno-Navarro, Herbert Kuchen, Julio Mariño-Carballo, Stephan Winkler, Werner Hans:
  Efficient Lazy Narrowing using Demandedness Analysis. 167-183
• Rita Loogen, Francisco Javier López-Fraguas, Mario Rodríguez-Artalejo:
  A Demand Driven Computation Strategy for Lazy Narrowing. 184-200

Integration of Different Paradigms II

• John Darlington, Yike Guo, Martin Köhler:
  Functional Programming Languages with Logical Variables: A Linear Logic View. 201-219
• Antonio Natali, Andrea Omicini:
  Objects with State in Contextual Logic Programming. 220-234

Parallelism I

• Khayri A. M. Ali, Roland Karlsson:
  A Novel Method for Parallel Implementation of findall. 235-245
• Remco Moolenaar, Bart Demoen:
  A Parallel Implementation for AKL. 246-261

Implementation Techniques

• Owen Kaser:
  Inlining to Reduce Stack Space. 262-274
• Agostino Dovier, Enrico Pontelli:
  A WAM-Based Implementation of a Logical Language with Sets. 275-290

Parallelism II

• Vicente Benjumea, José M. Troya:
  An OR Parallel Prolog Model for Distributed Memory Systems. 291-301
• Jonas Barklund, Johan Bevemyr:
  Executing Bounded Quantifications on Shared Memory Multiprocessors. 302-317

Static Analysis and Abstract Interpretation II

• David Clark, Chris Hankin:
  A Lattice of Abstract Graphs. 318-331
• Mads Rosendahl:
  Higher-Order Chaotic Iteration Sequences. 332-345
• Geoffrey L. Burn, Daniel Le Métayer:
  Proving the Correctness of Compiler Optimizations Based on Strictness Analysis. 346-364

Invited Talk

• Alexander Ja. Dikovsky:
  Abstract Complexity of Prolog Based on WAM. 365-377

Narrowing II

• Alexander A. Letichevsky:
  Development of Rewriting Strategies. 378-390
• María Alpuente, Moreno Falaschi, María José Ramis, Germán Vidal:
  Narrowing Approximations as an Optimization for Equational Logic Programs. 391-409

Abstracts of System Demonstrations and Posters

• P. Canalda, L. Cognard, Annie Despland, Monique Mazaud:
  PAGODE: a Back End Generator. 410-411
• Michele Bugliesi, Giuseppe Nardiello:
  SelfLog: Language and Implementation. 412-413
• Martin Jourdan, Fabienne Lagnier, Florence Maraninchi, Pascal Raymond:
  Embedding Declarative Subprograms into Imperative Constructs. 414-415
• Guido Hogen, Rita Loogen:
  Stack Management of Runtime Structures in Distributed Implementations. 416-417
• Christoph W. Keßler, Thomas Rauber:
  Efficient Register Allocation for Large Basic Blocks. 418-419
• Martin Alt, Georg Sander, Reinhard Wilhelm:
  Generation of Synchronization Code for Parallel Compilers. 420-421