Algebraic and logic programming : second international conference, Nancy, France, October 1-3, 1990 : proceedings / H. Kirchner, W. Wechler, eds.

Format
Book
Language
English
Published/​Created
Berlin ; New York : Springer-Verlag, ©1990.
Description
vii, 386 pages : illustrations ; 25 cm

Availability

Copies in the Library

Location Call Number Status Location Service Notes
ReCAP - Remote StorageQA76.6 .A4584 1990 Browse related items Request

    Details

    Subject(s)
    Series
    Lecture notes in computer science ; 463. [More in this series]
    Notes
    "Proceedings of the Second International Conference on Algebraic and Logic Programming ... sponsored by CNRS, INRIA, and Nancy Universities"--Foreword.
    Bibliographic references
    Includes bibliographical references.
    System details
    Mode of access: World Wide Web.
    Contents
    • Proving and rewriting
    • Proving correctness w.r.t. specifications with hidden parts
    • Hybrid implementations of algebraic specifications
    • Multi-modal logic programming using equational and order-sorted logic
    • Logic programs with equational type specifications
    • Higher-order order-sorted algebras
    • Axiomatization of a functional logic language
    • Fourier algorithm revisited
    • Fixpoint techniques for non-monotone maps
    • Domain theory for nonmonotonic functions
    • On the strong completion of logic programs
    • An equivalence preserving first order unfold/fold transformation system
    • Propositional calculus problems in CHIP
    • Unfolding and fixpoint semantics of concurrent constraint logic programs
    • Eliminating negation from normal logic programs
    • On logic programming interpretations of Dislog: Programming long-distance dependencies in logic
    • Recursive query processing in predicate-goal graph
    • Implementation of completion by transition rules + control: ORME
    • A matching process modulo a theory of categorical products
    • Equation solving in conditional AC-theories
    • Lazy narrowing in a graph machine
    • An abstract concurrent machine for rewriting
    • Applying term rewriting methods to finite groups
    • Termination proofs by multiset path orderings imply primitive recursive derivation lengths
    • Optimization of rewriting and complexity of rewriting
    • AC-Termination of rewrite systems: A modified Knuth-Bendix ordering.
    ISBN
    • 0387531629 ((U.S.))
    • 9780387531625 ((U.S.))
    • 3540531629 ((Springer-Verlag Berlin Heidelberg New York))
    • 9783540531623 ((Springer-Verlag Berlin Heidelberg New York))
    LCCN
    90010325
    OCLC
    22389519
    Statement on language in description
    Princeton University Library aims to describe library materials in a manner that is respectful to the individuals and communities who create, use, and are represented in the collections we manage. Read more...
    Other views
    Staff view