Algebraic and logic programming : second international conference, Nancy, France, October 1-3, 1990 : proceedings
著者
書誌事項
Algebraic and logic programming : second international conference, Nancy, France, October 1-3, 1990 : proceedings
（Lecture notes in computer science, 463）
Springer-Verlag, c1990
- : gw
- : us
大学図書館所蔵 件 / 全58件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
この図書・雑誌をさがす
注記
"Proceedings of the Second International Conference on Algebraic and Logic Programming ... sponsored by CNRS, INRIA, and Nancy Universities"--Foreword
Includes bibliographical references
内容説明・目次
内容説明
This volume consists of papers presented at the Second International Conference on Algebraic and Logic Programming in Nancy, France, October 1-3, 1990.
目次
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.
「Nielsen BookData」 より