Programming Language Implementation and Logic Programming: 4th International Symposium, PLILP'92 Leuven, Belgium, August 26–28, 1992 Proceedings

✍ Scribed by Michael Hanus (auth.), Maurice Bruynooghe, Martin Wirsing (eds.)

• Publisher: Springer-Verlag Berlin Heidelberg
• Year: 1992
• Tongue: English
• Leaves: 488
• Series: Lecture Notes in Computer Science 631
• Edition: 1
• Category: Library

✦ Synopsis

This volume contains the papers accepted for presentation at the Fourth International Symposium on Programming Language Implementation and Logic Programming (PLILP '92) held in Leuven, Belgium, August 26-28, 1992. Theaim of the symposium was to explore new declarative concepts, methods and techniques relevant for implementation of all kinds of programming languages, whether algorithmic or declarative. The symposium gathered researchers from the fields of algorithmic programming languages as well as logic, functional, and object-oriented programming. The topics discussed in the volume include: - Declarative implementation techniques; - Implementation of declarative concepts and modules; - Compiler specification and construction; - Program transformation; - Programming environments for declarative languages; - Amalgamation of logic programming with algorithmic, functional, or object-oriented techniques; - Executable specification.

✦ Table of Contents

Improving control of logic programs by using functional logic languages....Pages 1-23
Independent AND-parallel implementation of narrowing....Pages 24-38
Binding techniques and garbage collection for OR-parallel CLP systems....Pages 39-53
Path analysis for lazy data structures....Pages 54-68
Why the occur-check is not a problem....Pages 69-86
Incremental evaluation of natural semantics specifications....Pages 87-99
Subsumption-oriented Push-Down Automata....Pages 100-114
Unlimp uniqueness as a leitmotiv for implementation....Pages 115-129
Using cached functions and constructors for incremental attribute evaluation....Pages 130-144
Strictness analysis for attribute grammars....Pages 145-157
Checking and debugging of two-level grammars....Pages 158-171
On safe folding....Pages 172-186
Unfold/fold transformations preserving termination properties....Pages 187-201
A technique for transforming logic programs by fold-unfold transformations....Pages 202-216
FOLON: An environment for declarative construction of logic programs....Pages 217-231
A complete indexing scheme for WAM-based abstract machines....Pages 232-244
Fast prolog with a VAM 1p based Prolog compiler....Pages 245-259
Metastructures vs. attributed variables in the context of extensible unification....Pages 260-268
Comparing the Galois connection and widening/narrowing approaches to abstract interpretation....Pages 269-295
Derivation of linear size relations by abstract interpretation....Pages 296-310
Generic abstract interpretation algorithms for prolog: Two optimization techniques and their experimental evaluation....Pages 311-325
A bottom-up interpreter for a higher-order logic programming language....Pages 326-340
Camel: An extension of the categorical abstract machine to compile functional/logic programs....Pages 341-354
On the interaction of lazy evaluation and backtracking....Pages 355-369
Interprocedural dynamic slicing....Pages 370-384
Algorithmic debugging for lazy functional languages....Pages 385-399
A general trace query mechanism based on Prolog....Pages 400-414
Fully declarative logic programming....Pages 415-427
Our LIPS are sealed: Interfacing functional and logic programming systems....Pages 428-442
Analyses of inconsistency for incremental equational logic programming....Pages 443-457
I/O trees and interactive lazy functional programming....Pages 458-472
UCG-E: An equational logic programming system....Pages 473-474
A relational programming system with inferred representations....Pages 475-476
An implementation of action semantics (Summary)....Pages 477-478
BinProlog: A continuation passing style Prolog engine....Pages 479-480
LaToKi: A language toolkit for bottom-Up evaluation of functional programs....Pages 481-482
Implementing higher-order functions in an algebraic specification language with narrowing....Pages 483-484
Implementing attribute grammars by computational models....Pages 485-486
ProQuery: Logical access to an OODB....Pages 487-488
Inference of inheritance relationships from Prolog programs: a system developed with PrologIII....Pages 489-490
CLP( PB )....Pages 491-492

✦ Subjects

Programming Languages, Compilers, Interpreters; Logics and Meanings of Programs; Mathematical Logic and Formal Languages; Programming Techniques; Artificial Intelligence (incl. Robotics); Software Engineering