Algebraic and logic programming : 6th international joint conference, ALP '97-HOA '97, Southampton, UK. September 3-5, 1997 : proceedings
This book constitutes the refereed proceedings of the 6th International Conference on Algebraic and Logic Programming, ALP '97 and the 3rd International Workshop on Higher-Order Algebra, Logic and Term Rewriting, HOA '97, held jointly in Southampton, UK, in September 1997. The 18 revised f...
שמור ב:
| Collectivités auteurs: | , |
|---|---|
| מחברים אחרים: | , , |
| פורמט: | Livre numérique |
| שפה: | Anglais |
| יצא לאור: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| סדרה: | Lecture notes in computer science
1298 |
| נושאים: | |
| גישה מקוונת: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| הערה: |
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, 6th international joint conference, ALP '97-HOA '97, Southampton, UK. September 3-5, 1997, proceedings, Michael Hanus, Jan Heering, Karl Meinke, eds, 1997, New York, Springer, 1 vol. (X-286 p.), Lecture notes in computer science, 3-540-63459-2 • Algebraic and Logic Programming, Texte imprimé, 9783662184646 |
תוכן הענינים:
- Safe folding/unfolding with conditional narrowing
- Optimal non-deterministic functional logic computations
- A semantic basis for termination analysis of logic programs and its realization using symbolic norm constraints
- Parallelizing functional programs by generalization
- Higher-order equational unification via explicit substitutions
- Parameterised higher-order algebraic specifications
- Higher-order lazy narrowing calculus: A computation model for a higher-order functional logic language
- On composable properties of term rewriting systems
- Needed reductions with context-sensitive rewriting
- Conditional term graph rewriting
- Lazy narrowing with parametric order sorted types
- Termination of algebraic type systems: The syntactic approach
- Proof net semantics of proof search computation
- Explicit substitutions for the ??-calculus
- A left-linear variant of ??
- Perpetuality and uniform normalization
- Model generation with existentially quantified variables and constraints
- Optimal left-to-right pattern-matching automata.