## Programming Languages: Implementations, Logics, and Programs: 8th International Symposium, PLILP '96, Aachen, Germany, September 24 - 27, 1996. ProceedingsThis book constitutes the refereed proceedings of the Eighth International Symposium on Programming Languages, Implementations, Logics, and Programs, PLILP '96, held in conjunction with ALP and SAS in Aachen, Germany, in September 1996. The 30 revised full papers presented in the volume were selected from a total of 97 submissions; also included are one invited contribution by Lambert Meerlens and five posters and demonstrations. The papers are organized in topical sections on typing and structuring systems, program analysis, program transformation, implementation issues, concurrent and parallel programming, tools and programming environments, lambda-calculus and rewriting, constraints, and deductive database languages. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Calculate Polytypically | 1 |

Limits of MLDefinability | 17 |

Functorial ML | 32 |

Parametric Polymorphism for Typed Prolog and AProlog | 47 |

A Specification Formalism for Inheritance and Object Hierarchies | 62 |

Towards Independent AndParallelism in CLP | 77 |

Annotated Structure Shape Graphs for Abstract Analysis of Prolog | 92 |

A Reactive Implementation of Pos Using ROBDDs | 107 |

Functional Skeletons Generate Process Topologies in Eden | 289 |

ProFun A Language for Executable Specifications | 304 |

From Term Rewriting to Generalised Interaction Nets | 319 |

Type Isomorphisms for Module Signatures | 334 |

Decidability of Logic Program Semantics and Applications to Testing | 347 |

PIDGETS Unifying Pictures and Widgets in a ConstraintBased Framework for Concurrent Functional GUI Programming | 363 |

Generalized ẞReduction and Explicit Substitutions | 378 |

Modeling Sharing and Recursion for Weak Reduction Strategies Using Explicit Substitution | 393 |

Dynamic Attribute Grammars | 122 |

How To Be More Specific | 137 |

Controlling Conjunctive Partial Deduction | 152 |

UnfoldFold Transformations of Concurrent Processes | 167 |

A Case Study in TypeDirected Partial Evaluation | 182 |

Implementing Memoization for Partial Evaluation | 198 |

Higher Order Deforestation | 213 |

Scheduling Expression DAGs for Minimal Register Need | 228 |

Improving Tabled Logic Programs through Alternative Scheduling Strategies | 243 |

A New Implementation Approach for Prolog | 259 |

Systematic Extraction and Implementation of DivideandConquer Parallelism | 274 |

ContextSensitive Computations in Confluent Programs | 408 |

Models for Using Stochastic Constraint Solvers in Constraint Logic Programming | 423 |

Integrating Efficient Records into Concurrent Constraint Programming | 438 |

The LOL Deductive Database Programming Language | 454 |

An Efficient and Precise Sharing Domain for Logic Programs | 469 |

Cheap Tupling in Calculational Form | 471 |

Needed Narrowing in Prolog | 473 |

Automatic Optimization of Dynamic Scheduling in Logic Programs | 475 |

A Visual Constraint Programming Tool | 477 |

### Other editions - View all

Programming Languages: Implementations, Logics, and Programs: 8th ... Herbert Kuchen,S.Doaitse Swierstra No preview available - 2014 |

### Common terms and phrases

abstract algorithm allows analysis annotations answer application approach argument atoms attribute bound called clause combine compiler complete Computer condition conjunctions consider constant constraint construction constructor contains corresponding defined definition denote dependencies derivation described domain dynamic efficient equivalence evaluation example execution exists expression extended formal function functor give given goal ground higher implementation independence instance interaction interpreter introduce language Logic Programming means method nodes Note object obtain occur operations pair parallel partial performed possible present problem Proceedings Programming Languages Prolog proof provides records recursive reduction References relation replacing represent representation result rewriting rules Scheduling Science semantics sequence sharing signature solver sort space specialization specific static strategy structure substitution term tests Theorem tion transformation tree unification variables