Algebraic and logic programming : 4th international conference, ALP '94, Madrid, Spain, September 14-16, 1994 : proceedings
This volume constitutes the proceedings of the Fourth International Conference on Algebraic and Logic Programming (ALP '94), held in Madrid, Spain in September 1994. Like the predecessor conferences in this series, ALP '94 succeeded in strengthening the cross-fertilization between algebrai...
Kaydedildi:
| Müşterek Yazar: | |
|---|---|
| Diğer Yazarlar: | , |
| Materyal Türü: | Livre numérique |
| Dil: | Anglais |
| Baskı/Yayın Bilgisi: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Seri Bilgileri: | Lecture notes in computer science
850 |
| Konular: | |
| Online Erişim: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Not: |
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, 4th international confernence, ALP '94, Madrid, Spain, September 1994, proceedings, Giorgio Levi, Mario Rodríguez Artalejo, eds, Berlin, Springer-Verlag, 1994, 1 vol. (304 p.), Lecture notes in computer science, 0-387-58431-5 • Algebraic and Logic Programming, Texte imprimé, 9783662169247 |
İçindekiler:
- Concurrent constraint programming
- Specifications using multiple-conclusion logic programs
- Viewing a program transformation system at work
- Proving implications by algebraic approximation
- Sufficient completeness and parameterized proofs by induction
- Proving behavioural theorems with standard first-order logic
- How to realize LSE narrowing
- Compositional analysis for equational Horn programs
- Equation solving in projective planes and planar ternary rings
- From eventual to atomic and locally atomic CC programs: A concurrent semantics
- Concurrent logic programming as uniform linear proofs
- Three-valued completion for abductive logic programs
- A sequential reduction strategy
- On modularity of termination and confluence properties of conditional rewrite systems
- Syntactical analysis of total termination
- Logic programs as term rewriting systems
- Higher-order minimal function graphs
- Reasoning about layered, wildcard and product patterns
- Preserving universal termination through unfold/fold
- A logic for variable aliasing in logic programs.