Jan Maluszynski, Martin Wirsing
Proceedings of the Third International Symposium on Programming Language Implementation and Logic Programming
PLILP, 1991.

@proceedings{PLILP-1991,
	address       = "Passau, Germany",
	editor        = "Jan Maluszynski and Martin Wirsing",
	isbn          = "3-540-54444-5",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Third International Symposium on Programming Language Implementation and Logic Programming}",
	volume        = 528,
	year          = 1991,
}

Contents (41 items)

9 ×#logic programming
5 ×#performance
5 ×#prolog
4 ×#constraints
4 ×#named
4 ×#source code
4 ×#specification
3 ×#compilation
3 ×#functional
3 ×#logic

PLILP-1991-AppelM #ml #standard

Standard ML of New Jersey (AWA, DBM), pp. 1–13.

PLILP-1991-Naish #equation #prolog

Adding equations to NU-Prolog (LN), pp. 15–26.

PLILP-1991-Yamasaki #functional #logic programming

Extraction of Functional from Logic Program (SY), pp. 27–38.

PLILP-1991-Kredel #component #specification

The MAS Specification Component (HK), pp. 39–50.

PLILP-1991-GrahamK #functional #imperative

Domesticating Imperative Constructs So That They Can Live in a Functional World (TCNG, GK), pp. 51–62.

PLILP-1991-Poetzsch-Heffter #specification

Logic-Based Specification of Visibility Rules (APH), pp. 63–74.

PLILP-1991-ErtlK #constraints #logic programming #scheduling #using

Optimal Instruction Scheduling using Constraint Logic Programming (MAE, AK), pp. 75–86.

PLILP-1991-BaiardiB #architecture #distributed #memory management

An Architectural Model for OR-Parallelism on Distributed Memory Systems (FB, DMB), pp. 87–98.

PLILP-1991-LangendoenV #memory management #named #parallel #reduction

FRATS: A Parallel Reduction Strategy for Shared Memory (KL, WGV), pp. 99–110.

PLILP-1991-AlpuenteF #algorithm #constraints #incremental

Narrowing as an Incremental Constraint Satisfaction Algorithm (MA, MF), pp. 111–122.

PLILP-1991-ChakravartyL #implementation #lazy evaluation

The Implementation of Lazy Narrowing (MMTC, HCRL), pp. 123–134.

PLILP-1991-ConselK #compilation #generative #prolog #semantics

Semantics-Directed Generation of a Prolog Compiler (CC, SCK), pp. 135–146.

PLILP-1991-BorgerD #database #framework #prolog

A Framework to Specify Database Update Views for Prolog (EB, BD), pp. 147–158.

PLILP-1991-Ferenczi #composition #concept #distributed #prolog

Concepts for a Modular and Distributed Prolog Language (SF), pp. 159–170.

PLILP-1991-Davison

From Parlog to Polka in two easy Steps (AD), pp. 171–182.

PLILP-1991-Aasa #implementation #programming language #specification

Precedences in Specifications and Implementations of Programming Languages (AA), pp. 183–194.

PLILP-1991-KeslerPR #approach #heuristic #random

A Randomized Heuristic Approach to Register Allocation (CWK, WJP, TR), pp. 195–206.

PLILP-1991-HalbwachsRR #data flow #generative #performance #source code

Generating Efficient Code From Data-Flow Programs (NH, PR, CR), pp. 207–218.

PLILP-1991-KosterB #on the #source code

On the Borderline Between Grammars and Programs (CHAK, JB), pp. 219–230.

PLILP-1991-VogtSK #attribute grammar #higher-order #incremental #performance

Efficient Incremental Evaluation of Higher order Attribute Grammars (HV, SDS, MFK), pp. 231–242.

PLILP-1991-Paakki #attribute grammar #logic programming #named

PROFIT: A System Integrating Logic Programming and Attribute Grammars (JP), pp. 243–254.

PLILP-1991-Ait-KaciP #towards

Towards a Meaning of LIFE (HAK, AP), pp. 255–274.

PLILP-1991-Gloess #logic #order

U-Log, An Ordered Sorted Logic with Typed Attributes (PYG), pp. 275–286.

PLILP-1991-ChenW #abstraction #compilation #higher-order #logic programming

Compilation of Predicate Abstractions in Higher-Order Logic Programming (WC, DSW), pp. 287–298.

PLILP-1991-Nilsson #abstract interpretation

Abstract Interpretation: A Kind of Magic (UN), pp. 299–309.

PLILP-1991-FileS #abstract interpretation #type checking

Abstract Interpretation for Type Checking (GF, PS), pp. 311–322.

PLILP-1991-GiannottiH #detection #recursion #specification

A Technique for Recursive Invariance Detection and Selective Program Specification (FG, MVH), pp. 323–334.

PLILP-1991-LoogenW #detection #functional

Dynamic Detection of Determinism in Functional Languages (RL, SW), pp. 335–346.

PLILP-1991-ProiettiP #logic programming #named #order #source code

Unfolding — Definition — Folding, in this Order, for Avaoiding Unnecessary Variables in Logic Programs (MP, AP), pp. 347–358.

PLILP-1991-CheongF #integration #performance #prolog

Efficient Integration of Simplifications into Prolog (PHC, LF), pp. 359–370.

PLILP-1991-Antoy #evaluation #lazy evaluation #logic

Lazy Evaluation in Logic (SA), pp. 371–382.

PLILP-1991-Boye #logic programming #named #semantics #source code

S-SLD-resolution — An Operational Semantics for Logic Programs with External Procedures (JB), pp. 383–393.

PLILP-1991-HentenryckD #constraints #finite #logic programming #semantics

Operational Semantics of Constraint Logic Programming over Finite Domains (PVH, YD), pp. 395–406.

PLILP-1991-BrogiG #constraints #logic #process

Constraints for Synchronizing Logic Coarse-grained Sequential Logic Processes (AB, MG), pp. 407–418.

PLILP-1991-Loyola #animation #debugging #execution #logic programming

Extending Execution Trees for Debugging and Animation in Logic Programming (DL), pp. 419–420.

PLILP-1991-FrausH #proving #theorem proving

A Narrowing-Based Theorem Prover (UF, HH), pp. 421–422.

PLILP-1991-Hanus

The ALF System (MH), pp. 423–424.

PLILP-1991-Vollmer #case study #compilation #experience #logic programming #performance

Experiences with Gentle: Efficient Compiler Construction Based On Logic Programming (JV), pp. 425–426.

PLILP-1991-BaumF #performance

The System FLR (Fast Laboratory for Recomposition) (BB, PF), pp. 427–428.

PLILP-1991-AttardiG #multi

Multilanguage Interoperability (GA, MG), pp. 429–430.

PLILP-1991-LegeardL #overview

Short Overview of the CLPS System (BL, EL), pp. 431–433.