Algebraic and logic programming : second international conference, Nancy, France, October 1-3, 1990 : proceedings
Enregistré dans:
| Institution som forfatter: | |
|---|---|
| Andre forfattere: | , |
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serier: | Lecture notes in computer science
463 |
| Fag: | |
| Online adgang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Algebraic and logic programming, second international conference, Nancy, France, October 1-3, 1990, proceedings, H. Kirchner, W. Wechler, eds, 1990, Berlin, Springer-Verlag, 1 vol. (vii-386 p.), Lecture notes in computer science, 3-540-53162-9 • Algebraic and Logic Programming, Texte imprimé, 9783662212042 |
Indholdsfortegnelse:
- 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.