Algebraic and logic programming : third international conference, Volterra, Italy, September 2 4, 1992 : proceedings
This volume contains the proceedings of the Third International Conference on Algebraic and Logic Programming, held in Pisa, Italy, September 2-4, 1992. Like the two previous conferences in Germany in 1988 and France in 1990, the third conference aims at strengthening the connections betweenalgebrai...
Uloženo v:
| Korporativní autor: | |
|---|---|
| Další autoři: | , |
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science
632 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
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, third international conference, Pisa, Italy, September 1992: proceedings, H. Kirchner, G. Levi, eds, Berlin, Springer-Verlag, 1992, 1 vol. (IX-457 p.), Lecture notes in computer science, 3-540-55873-X • Algebraic and Logic Programming, Texte imprimé, 9783662162613 |
Obsah:
- Outline of an object-oriented calculus of higher type
- High-level-replacement systems for equational algebraic specifications
- Termination of rewrite systems by elementary interpretations
- Termination of order-sorted rewriting
- Generalized sufficient conditions for modular termination of rewriting
- A theory of first-order built-in's of prolog
- Fixpoint semantics for partial computed answer substitutions and call patterns
- Oracle semantics for Prologa
- On the relation between primitive recursion, schematization, and divergence
- Term rewriting with sharing and memoïzation
- Definitional trees
- Multiparadigm logic programming
- Non-linear real constraints in constraint logic programming
- A general scheme for constraint functional logic programming
- Incremental rewriting in narrowing derivations
- Counterexamples to completeness results for basic narrowing (extended abstract)
- Uniform narrowing strategies
- Proof by consistency in constructive systems with final algebra semantics
- A fast algorithm for ground normal form analysis
- Eta-conversion for the languages of explicit substitutions
- Serialisation analysis of concurrent logic programs
- Implementation of a toolset for prototyping algebraic specifications of concurrent systems
- Axiomatizing permutation equivalence in the ?-calculus
- A CLP view of logic programming
- Partial deduction of logic programs WRT well-founded semantics
- The finiteness of logic programming derivations
- Theorem proving for hierarchic first-order theories
- A goal oriented strategy based on completion
- On n-syntactic equational theories.