Compiler generation from relational semantics.- Correctness of code generation from a two-level meta-language.- A general approach to the optimization of function calls.- Lifetime analysis for procedure parameters.- Another implementation technique for applicative languages.- Graal : A Functional Programming system with uncurryfied combinators and its reduction machine.- A safe approach to parallel combinator reduction (extended abstract).- Reducing recursion to iteration by algebraic extension.- Design and implementation of a generic, logic and functional programming language.- Pragmatic aspects of two-level denotational meta-languages.- An experiment in practical semantics.- The choice of programming primitives for SETL-like programming languages.- Algebraic semantics of exception handling.- Data refinement refined resume.- Proving entailment between conceptual state specifications.- Automatic parallelization of fortran programs in the presence of procedure calls.- Parallelization by semantic detection of reductions.- Denotational semantics of nets with nondeterminism.- specification of a tool for viewing program text.- A classical implementation for Prolog-II.- Programs as collections of communicating Prolog units.- An and-parallel execution model of logic programs.- Compiling Extended Concurrent Prolog -single queue compilation-.- A very intelligent backtracking method for Logic Programs.- An application of abstract interpretation of logic programs: Occur check reduction.- Experiences with the RAP system a specification interpreter combining term rewriting and resolution.- Rewriting with a nondeterministic choice operator : From algebra to proofs.
Inhaltsverzeichnis
Compiler generation from relational semantics. - Correctness of code generation from a two-level meta-language. - A general approach to the optimization of function calls. - Lifetime analysis for procedure parameters. - Another implementation technique for applicative languages. - Graal : A Functional Programming system with uncurryfied combinators and its reduction machine. - A safe approach to parallel combinator reduction (extended abstract). - Reducing recursion to iteration by algebraic extension. - Design and implementation of a generic, logic and functional programming language. - Pragmatic aspects of two-level denotational meta-languages. - An experiment in practical semantics. - The choice of programming primitives for SETL-like programming languages. - Algebraic semantics of exception handling. - Data refinement refined resume. - Proving entailment between conceptual state specifications. - Automatic parallelization of fortran programs in the presence of procedure calls. - Parallelization by semantic detection of reductions. - Denotational semantics of nets with nondeterminism. - specification of a tool for viewing program text. - A classical implementation for Prolog-II. - Programs as collections of communicating Prolog units. - An and-parallel execution model of logic programs. - Compiling Extended Concurrent Prolog -single queue compilation-. - A very intelligent backtracking method for Logic Programs. - An application of abstract interpretation of logic programs: Occur check reduction. - Experiences with the RAP system a specification interpreter combining term rewriting and resolution. - Rewriting with a nondeterministic choice operator : From algebra to proofs.
