## Algebraic and Logic Programming: 5th International Conference, ALP '96, Aachen, Germany, September 25 - 27, 1996. ProceedingsMichael Hanus, Mario Rodriguez-Artalejo This book constitutes the refereed proceedings of the Fifth International Conference on Algebraic and Logic Programming, ALP '96, held in Aachen, Germany, in September 1996 in conjunction with PLILP and SAS. The volume presents 21 revised full papers selected from 54 submissions; also included is an invited contribution by Claude Kirchner and Ilies Alouini entitled "Toward the Concurrent Implementation of Computational Systems". The volume is divided into topical sections on logic programming, term rewriting, integration of paradigms, abstract interpretation, Lambda-calculus and rewriting, and types. |

### What people are saying - Write a review

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

### Contents

Toward the Concurrent Implementation of Computational Systems | 1 |

On Negation As Instantiation | 32 |

Independence in Dynamically Scheduled Logic Languages | 47 |

Heterogeneous Constraint Solving | 62 |

A Hierarchy of Semantics for Normal Constraint Logic Programs | 77 |

The Unsorted Way | 92 |

Unravelings and Ultraproperties | 107 |

Standardization Theorem Revisited | 122 |

A Strict Border for the Decidability of EUnification for Recursive Functions | 194 |

Prime Factorizations of Abstract Domains Using FirstOrder Logic | 209 |

Abstractions of Uniform Proofs | 224 |

Complementing Logic Program Semantics | 238 |

Meaningless Terms in Rewriting | 254 |

Unique Normal Form Property of HigherOrder Rewriting Systems | 269 |

Which Preserve pStrong Normalization | 284 |

Functional Logic Programming with Polymorphic OrderSorted Types | 299 |

Discrete Normalization and Standardization in Deterministic Residual Structures | 135 |

A Language for the Logical Specification of Processes and Relations | 150 |

A Process Algebra for Synchronous Concurrent Constraint Programming | 165 |

An Algebraic Approach to Mixins and Modularity | 179 |

Specifying Type Systems | 314 |

The Semantic Treatment of Polymorphic Specification Languages | 330 |

### Common terms and phrases

abstract abstract domain algebra algorithm allows applied approach assume atoms axioms calculus called closure complete components Computer concrete concurrent condition confluent consider consists constraint contains context corresponding CTRSs defined Definition denoted described domain element equations equivalent example exists expressions extended finite formula framework function give given goal holds implementation inference infinite instance instantiation interpretation introduced labelling language least left-linear Lemma Logic Programming mapping means method modularity multiset node normal Note notion obtained occur operator pair parallel partial pattern polymorphic position possible predicate presented preserves problem proof properties Proposition prove redex reduction relation represent respect restrict result rewrite rules rewriting systems rule satisfies Science semantics sequence side signature sort sort derivation specification standard step structure substitution symbols term term rewriting termination Theorem transformation tree TRSs true unraveling variables