Algebraic and Logic Programming
Second International Conference, Nancy, France, October 1-3, 1990. Proceedings
(Sprache: Englisch)
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...
Leider schon ausverkauft
versandkostenfrei
Buch
85.59 €
Produktdetails
Produktinformationen zu „Algebraic and Logic Programming “
Klappentext zu „Algebraic and Logic Programming “
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.
Inhaltsverzeichnis zu „Algebraic and Logic Programming “
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.
Bibliographische Angaben
- 1990, 1990, 389 Seiten, Maße: 15,5 x 23,5 cm, Kartoniert (TB), Englisch
- Ed. by Helene Kirchner and Wolfgang Wechler
- Herausgegeben: Wolfgang Wechler, Helene Kirchner
- Verlag: Springer
- ISBN-10: 3540531629
- ISBN-13: 9783540531623
- Erscheinungsdatum: 20.09.1990
Sprache:
Englisch
Kommentar zu "Algebraic and Logic Programming"
0 Gebrauchte Artikel zu „Algebraic and Logic Programming“
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "Algebraic and Logic Programming".
Kommentar verfassen