ESOP 86: European Symposium on Programming Saarbrücken, Federal Republic of Germany March 17–19, 1986 Proceedings

Compiler generation from relational semantics....Pages 1-29
Correctness of code generation from a two-level meta-language....Pages 30-40
A general approach to the optimization of function calls....Pages 41-52
Lifetime analysis for procedure parameters....Pages 53-69
Another implementation technique for applicative languages....Pages 70-81
Graal : A Functional Programming system with uncurryfied combinators and its reduction machine....Pages 82-98
A safe approach to parallel combinator reduction (extended abstract)....Pages 99-110
Reducing recursion to iteration by algebraic extension....Pages 111-118
Design and implementation of a generic, logic and functional programming language....Pages 119-132
Pragmatic aspects of two-level denotational meta-languages....Pages 133-143
An experiment in practical semantics....Pages 144-159
The choice of programming primitives for SETL-like programming languages....Pages 160-172
Algebraic semantics of exception handling....Pages 173-186
Data refinement refined resume....Pages 187-196
Proving entailment between conceptual state specifications....Pages 197-209
Automatic parallelization of fortran programs in the presence of procedure calls....Pages 210-222
Parallelization by semantic detection of reductions....Pages 223-236
Denotational semantics of nets with nondeterminism....Pages 237-249
specification of a tool for viewing program text....Pages 250-261
A classical implementation for Prolog-II....Pages 262-273
Programs as collections of communicating Prolog units....Pages 274-288
An and-parallel execution model of logic programs....Pages 289-300
Compiling Extended Concurrent Prolog -single queue compilation-....Pages 301-314
A very intelligent backtracking method for Logic Programs....Pages 315-326
An application of abstract interpretation of logic programs: Occur check reduction....Pages 327-338
Experiences with the RAP system — a specification interpreter combining term rewriting and resolution....Pages 339-350
Rewriting with a nondeterministic choice operator : From algebra to proofs....Pages 351-374