Programming Language Implementation and Logic Programming

1. Front Matter

   PDF

2. Improving control of logic programs by using functional logic languages

   • Michael Hanus

   Pages 1-23

3. Independent AND-parallel implementation of narrowing

   • Herbert Kuchen, Juan José Moreno-Navarro, Manuel V. Hermenegildo

   Pages 24-38

4. Binding techniques and garbage collection for OR-parallel CLP systems

   • Michel Dorochevsky, André Véron

   Pages 39-53

5. Path analysis for lazy data structures

   • Carsten K. Gomard, Peter Sestoft

   Pages 54-68

6. Why the occur-check is not a problem

   • Krzysztof R. Apt, Alessandro Pellegrini

   Pages 69-86

7. Incremental evaluation of natural semantics specifications

   • Isabelle Attali, Jacques Chazarain, Serge Gilette

   Pages 87-99

8. Subsumption-oriented Push-Down Automata

   • F. Barthélemy, E. Villemonte de la Clergerie

   Pages 100-114

9. Unlimp uniqueness as a leitmotiv for implementation

   • Stefan Kahrs

   Pages 115-129

10. Using cached functions and constructors for incremental attribute evaluation

    • Maarten Pennings, Doaitse Swierstra, Harald Vogt

    Pages 130-144

11. Strictness analysis for attribute grammars

    • Mads Rosendahl

    Pages 145-157

12. Checking and debugging of two-level grammars

    • Sadegh Saidi, Jean-Francois Boulicaut

    Pages 158-171

13. On safe folding

    • Annalisa Bossi, Nicoletta Cocco, Sandro Etalle

    Pages 172-186

14. Unfold/fold transformations preserving termination properties

    • Torben Amtoft

    Pages 187-201

15. A technique for transforming logic programs by fold-unfold transformations

    • Francis Alexandre

    Pages 202-216

16. FOLON: An environment for declarative construction of logic programs

    • J. Henrard, B. Le Charlier

    Pages 217-231

17. A complete indexing scheme for WAM-based abstract machines

    • Werner Hans

    Pages 232-244

18. Fast prolog with a VAM1p based Prolog compiler

    • Andreas Krall, Thomas Berger

    Pages 245-259

19. Metastructures vs. attributed variables in the context of extensible unification

    • Christian Holzbaur

    Pages 260-268

20. Comparing the Galois connection and widening/narrowing approaches to abstract interpretation

    • Patrick Cousot, Radhia Cousot

    Pages 269-295

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.

• algorithm
• algorithms
• compiler
• logic
• object-oriented programming
• programming
• programming language

Policies and ethics