5. PLILP 1993: Tallinn, Estonia
Maurice Bruynooghe, Jaan Penjam (Eds.): Programming Language Implementation and Logic Programming, 5th International Symposium, PLILP'93, Tallinn, Estonia, August 25-27, 1993, Proceedings. Springer 1993 Lecture Notes in Computer Science ISBN 3-540-57186-8
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
Constraint Programming
Pierre Lim, Joachim Schimpf: A Conservative Approach to Meta-Programming in Constraint Logic Programming. 44-59
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
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
Parallelism I
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

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


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
Martin Alt, Georg Sander, Reinhard Wilhelm: Generation of Synchronization Code for Parallel Compilers. 420-421



