Ebook: Programming Language Implementation and Logic Programming: 3rd International Symposium, PLILP '91 Passau, Germany, August 26–28, 1991 Proceedings

This volume contains the papers which have been accepted for presentation atthe Third International Symposium on Programming Language Implementation andLogic Programming (PLILP '91) held in Passau, Germany, August 26-28, 1991. The aim of the symposium was to explore new declarative concepts, methods and techniques relevant for the implementation of all kinds of programming languages, whether algorithmic or declarative ones. The intention was to gather researchers from the fields of algorithmic programming languages as well as logic, functional and object-oriented programming. This volume contains the two invited talks given at the symposium by H. Ait-Kaci and D.B. MacQueen, 32 selected papers, and abstracts of several system demonstrations. The proceedings of PLILP '88 and PLILP '90 are available as Lecture Notes in Computer Science Volumes 348 and 456.

---

This volume contains the papers which have been accepted for presentation atthe Third International Symposium on Programming Language Implementation andLogic Programming (PLILP '91) held in Passau, Germany, August 26-28, 1991. The aim of the symposium was to explore new declarative concepts, methods and techniques relevant for the implementation of all kinds of programming languages, whether algorithmic or declarative ones. The intention was to gather researchers from the fields of algorithmic programming languages as well as logic, functional and object-oriented programming. This volume contains the two invited talks given at the symposium by H. Ait-Kaci and D.B. MacQueen, 32 selected papers, and abstracts of several system demonstrations. The proceedings of PLILP '88 and PLILP '90 are available as Lecture Notes in Computer Science Volumes 348 and 456.

---

This volume contains the papers which have been accepted for presentation atthe Third International Symposium on Programming Language Implementation andLogic Programming (PLILP '91) held in Passau, Germany, August 26-28, 1991. The aim of the symposium was to explore new declarative concepts, methods and techniques relevant for the implementation of all kinds of programming languages, whether algorithmic or declarative ones. The intention was to gather researchers from the fields of algorithmic programming languages as well as logic, functional and object-oriented programming. This volume contains the two invited talks given at the symposium by H. Ait-Kaci and D.B. MacQueen, 32 selected papers, and abstracts of several system demonstrations. The proceedings of PLILP '88 and PLILP '90 are available as Lecture Notes in Computer Science Volumes 348 and 456.
Content:
Front Matter....Pages -
Standard ML of New Jersey....Pages 1-13
Adding equations to NU-Prolog....Pages 15-26
Extraction of functional from logic program....Pages 27-38
The MAS specification component....Pages 39-50
Domesticating imperative constructs so that they can live in a functional world....Pages 51-62
Logic-based specification of visibility rules....Pages 63-74
Optimal instruction scheduling using constraint logic programming....Pages 75-86
An architectural model for OR-parallellism on distributed memory systems....Pages 87-98
FRATS: A parallel reduction strategy for shared memory....Pages 99-110
Narrowing as an incremental constraint satisfaction algorithm....Pages 111-122
The implementation of lazy narrowing....Pages 123-134
Semantics-directed generation of a Prolog compiler....Pages 135-146
A framework to specify database update views for Prolog....Pages 147-158
Concepts for a modular and distributed Prolog language....Pages 159-170
From parlog to polka in two easy steps....Pages 171-182
Precedences in specifications and implementations of programming languages....Pages 183-194
A randomized heuristic approach to register allocation....Pages 195-206
Generating efficient code from data-flow programs....Pages 207-218
On the borderline between grammars and programs....Pages 219-230
Efficient incremental evaluation of higher order attribute grammars....Pages 231-242
Profit: A system integrating logic programming and attribute grammars....Pages 243-254
Towards a meaning of LIFE....Pages 255-274
U-log, an ordered sorted logic with typed attributes....Pages 275-286
Compilation of predicate abstractions in higher-order logic programming....Pages 287-298
Abstract interpretation: A kind of magic....Pages 299-309
Abstract interpretation for type checking....Pages 311-322
A technique for recursive invariance detection and selective program specialization....Pages 323-334
Dynamic detection of determinism in functional logic languages....Pages 335-346
Unfolding — definition — folding, in this order, for avoiding unnecessary variables in logic programs....Pages 347-358
Efficient integration of simplification into Prolog....Pages 359-370
Lazy evaluation in logic....Pages 371-382
S-SLD-resolution — An operational semantics for logic programs with external procedures....Pages 383-393
Operational semantics of constraint logic programming over finite domains....Pages 395-406
Constraints for synchronizing coarse-grained sequential logic processes....Pages 407-418
Extending execution trees for debugging and animation in logic programming....Pages 419-420
A narrowing-based theorem prover....Pages 421-422
The ALF system....Pages 423-424
Experiences with gentle: Efficient compiler construction based on logic programming....Pages 425-426
The system FLR ( Fast laboratory for recomposition )....Pages 427-428
Multilanguage interoperability....Pages 429-430
Back Matter....Pages -
Short overview of the CLPS system....Pages 431-433

---

This volume contains the papers which have been accepted for presentation atthe Third International Symposium on Programming Language Implementation andLogic Programming (PLILP '91) held in Passau, Germany, August 26-28, 1991. The aim of the symposium was to explore new declarative concepts, methods and techniques relevant for the implementation of all kinds of programming languages, whether algorithmic or declarative ones. The intention was to gather researchers from the fields of algorithmic programming languages as well as logic, functional and object-oriented programming. This volume contains the two invited talks given at the symposium by H. Ait-Kaci and D.B. MacQueen, 32 selected papers, and abstracts of several system demonstrations. The proceedings of PLILP '88 and PLILP '90 are available as Lecture Notes in Computer Science Volumes 348 and 456.
Content:
Front Matter....Pages -
Standard ML of New Jersey....Pages 1-13
Adding equations to NU-Prolog....Pages 15-26
Extraction of functional from logic program....Pages 27-38
The MAS specification component....Pages 39-50
Domesticating imperative constructs so that they can live in a functional world....Pages 51-62
Logic-based specification of visibility rules....Pages 63-74
Optimal instruction scheduling using constraint logic programming....Pages 75-86
An architectural model for OR-parallellism on distributed memory systems....Pages 87-98
FRATS: A parallel reduction strategy for shared memory....Pages 99-110
Narrowing as an incremental constraint satisfaction algorithm....Pages 111-122
The implementation of lazy narrowing....Pages 123-134
Semantics-directed generation of a Prolog compiler....Pages 135-146
A framework to specify database update views for Prolog....Pages 147-158
Concepts for a modular and distributed Prolog language....Pages 159-170
From parlog to polka in two easy steps....Pages 171-182
Precedences in specifications and implementations of programming languages....Pages 183-194
A randomized heuristic approach to register allocation....Pages 195-206
Generating efficient code from data-flow programs....Pages 207-218
On the borderline between grammars and programs....Pages 219-230
Efficient incremental evaluation of higher order attribute grammars....Pages 231-242
Profit: A system integrating logic programming and attribute grammars....Pages 243-254
Towards a meaning of LIFE....Pages 255-274
U-log, an ordered sorted logic with typed attributes....Pages 275-286
Compilation of predicate abstractions in higher-order logic programming....Pages 287-298
Abstract interpretation: A kind of magic....Pages 299-309
Abstract interpretation for type checking....Pages 311-322
A technique for recursive invariance detection and selective program specialization....Pages 323-334
Dynamic detection of determinism in functional logic languages....Pages 335-346
Unfolding — definition — folding, in this order, for avoiding unnecessary variables in logic programs....Pages 347-358
Efficient integration of simplification into Prolog....Pages 359-370
Lazy evaluation in logic....Pages 371-382
S-SLD-resolution — An operational semantics for logic programs with external procedures....Pages 383-393
Operational semantics of constraint logic programming over finite domains....Pages 395-406
Constraints for synchronizing coarse-grained sequential logic processes....Pages 407-418
Extending execution trees for debugging and animation in logic programming....Pages 419-420
A narrowing-based theorem prover....Pages 421-422
The ALF system....Pages 423-424
Experiences with gentle: Efficient compiler construction based on logic programming....Pages 425-426
The system FLR ( Fast laboratory for recomposition )....Pages 427-428
Multilanguage interoperability....Pages 429-430
Back Matter....Pages -
Short overview of the CLPS system....Pages 431-433
....