Maurice Bruynooghe, Jaan Penjam
Proceedings of the Fifth International Symposium on Programming Language Implementation and Logic Programming
PLILP, 1993.

@proceedings{PLILP-1993,
	address       = "Tallinn, Estonia",
	editor        = "Maurice Bruynooghe and Jaan Penjam",
	isbn          = "3-540-57186-8",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Fifth International Symposium on Programming Language Implementation and Logic Programming}",
	volume        = 714,
	year          = 1993,
}

Contents (33 items)

8 ×#implementation
5 ×#logic programming
4 ×#parallel
4 ×#prolog
3 ×#analysis
3 ×#constraints
3 ×#functional
3 ×#performance
3 ×#source code
3 ×#specification

PLILP-1993-Kastens #execution #implementation #specification

Executable Specifications for Language Implementation (UK), pp. 1–11.

PLILP-1993-Boye #functional #logic programming #source code

Avoiding Dynamic Delays in Functional Logic Programs (JB), pp. 12–27.

PLILP-1993-HanusJ #debugging #functional #logic programming #source code

A Debugging Model for Functional Logic Programs (MH, BJ), pp. 28–43.

PLILP-1993-LimS #approach #constraints #logic programming #metaprogramming

A Conservative Approach to Meta-Programming in Constraint Logic Programming (PL, JS), pp. 44–59.

PLILP-1993-JourdanS #constraints

The Versatility of Handling Disjunctions as Constraints (JJ, TS), pp. 60–74.

PLILP-1993-CorsiniMRC #abstract interpretation #bottom-up #constraints #finite #performance #prolog #theorem proving

Efficient Bottom-up Abstract Interpretation of Prolog by Means of Constraint Solving over Symbolic Finite Domains (MMC, KM, AR, BLC), pp. 75–91.

PLILP-1993-Kagedal #analysis #prolog

Improvements in Compile-Time Analysis for Ground Prolog (AK), pp. 92–107.

PLILP-1993-Nederhof #algorithm #definite clause grammar #parsing #recursion #top-down

A New Top-Down Parsing Algorithm for Left-Recursive DCGs (MJN), pp. 108–122.

PLILP-1993-JourdanBPR #attribute grammar #implementation #specification #using

Specification and Implementation of Grammar Couplings using Attribute Grammars (MJ, CLB, DP, GR), pp. 123–136.

PLILP-1993-Poetzsch-Heffter #programming language #prototype #specification #using

Programming Language Specification and Prototyping Using the MAX System (APH), pp. 137–150.

PLILP-1993-Mantsivoda #implementation

Flang and its Implementation (AM), pp. 151–166.

PLILP-1993-Moreno-NavarroKMWH #analysis #lazy evaluation #performance #using

Efficient Lazy Narrowing using Demandedness Analysis (JJMN, HK, JMC, SW, WH), pp. 167–183.

PLILP-1993-LoogenFR #lazy evaluation

A Demand Driven Computation Strategy for Lazy Narrowing (RL, FJLF, MRA), pp. 184–200.

PLILP-1993-DarlingtonGK #functional #linear #logic #perspective #programming language

Functional Programming Languages with Logical Variables: A Linear Logic View (JD, YG, MK), pp. 201–219.

PLILP-1993-NataliO #logic programming

Objects with State in Contextual Logic Programming (AN, AO), pp. 220–234.

PLILP-1993-AliK #implementation #novel #parallel

A Novel Method for Parallel Implementation of findall (KAMA, RK), pp. 235–245.

PLILP-1993-MoolenaarD #implementation #parallel

A Parallel Implementation for AKL (RM, BD), pp. 246–261.

PLILP-1993-Kaser #stack

Inlining to Reduce Stack Space (OK), pp. 262–274.

PLILP-1993-DovierP #implementation #logic #set

A WAM-Based Implementation of a Logical Language with Sets (AD, EP), pp. 275–290.

PLILP-1993-BenjumeaT #distributed #memory management #parallel #prolog

An OR Parallel Prolog Model for Distributed Memory Systems (VB, JMT), pp. 291–301.

PLILP-1993-BarklundB #bound #memory management #multi

Executing Bounded Quantifications on Shared Memory Multiprocessors (JB, JB), pp. 302–317.

PLILP-1993-ClarkH #graph

A Lattice of Abstract Graphs (DC, CH), pp. 318–331.

PLILP-1993-Rosendahl #higher-order #sequence

Higher-Order Chaotic Iteration Sequences (MR), pp. 332–345.

PLILP-1993-BurnM #analysis #compilation #correctness #optimisation #proving #strict

Proving the Correctness of Compiler Optimizations Based on Strictness Analysis (GLB, DLM), pp. 346–364.

PLILP-1993-Dikovsky #complexity #prolog

Abstract Complexity of Prolog Based on WAM (AJD), pp. 365–377.

PLILP-1993-Letichevsky #development

Development of Rewriting Strategies (AAL), pp. 378–390.

PLILP-1993-AlpuenteFRV #approximate #equation #logic programming #optimisation #source code

Narrowing Approximations as an Optimization for Equational Logic Programs (MA, MF, MJR, GV), pp. 391–409.

PLILP-1993-CanaldaCDM #generative #named

PAGODE: a Back End Generator (PC, LC, AD, MM), pp. 410–411.

PLILP-1993-BugliesiN #implementation #named

SelfLog: Language and Implementation (MB, GN), pp. 412–413.

PLILP-1993-JourdanLMR #declarative #imperative

Embedding Declarative Subprograms into Imperative Constructs (MJ, FL, FM, PR), pp. 414–415.

PLILP-1993-HogenL #distributed #implementation #runtime #stack

Stack Management of Runtime Structures in Distributed Implementations (GH, RL), pp. 416–417.

PLILP-1993-KesslerR #performance #scalability

Efficient Register Allocation for Large Basic Blocks (CWK, TR), pp. 418–419.

PLILP-1993-AltSW #compilation #generative #parallel

Generation of Synchronization Code for Parallel Compilers (MA, GS, RW), pp. 420–421.