Algebraic and logic programming : international workshop, Gaussig, GDR, November 14-18, 1988 : proceedings
This volume contains the proceedings of the First International Workshop on Algebraic and Logic Programming held in Gaussig (German Democratic Republic) from November 14 to 18, 1988. The workshop was devoted to Algebraic Programming, in the sense of programming by algebraic specifications and rewrit...
Na minha lista:
| Autor Corporativo: | |
|---|---|
| Outros Autores: | , , |
| Formato: | Livre numérique |
| Idioma: | Anglais |
| Publicado em: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Colecção: | Lecture notes in computer science
343 |
| Assuntos: | |
| Acesso em linha: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
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, international workshop, Gaussig, GDR, November 14-18, 1988, proceedings, J. Grabowski, P. Lescanne, W. Wechler (eds.), Berlin, Springer-Verlag, 1988, 1 vol. (278 p.), Lecture notes in computer science, 3-540-50667-5 • Algebraic and Logic Programming, Texte imprimé, 9783662200889 |
Sumário:
- ACP with signals
- Functional extensions to prolog: Are they needed?
- Narrowing and resolution in logic-functional programming languages
- Nondeterministic algebraic specifications and nonconfluent term rewriting
- OBJ: Programming with equalities, subsorts, overloading and parameterization
- Logic programming with polymorphically order-sorted types
- Integrating logic programming and equational specification of abstract data types
- Narrowing with built-in theories
- A completion procedure for hierarchical conditional rewriting systems
- An effective method for handling initial algebras
- Boolean valued models and incomplete specifications
- Types, modularisation and abstraction in logic programming
- Translating algebraic specifications to Prolog programs: A comparative study
- Rewrite rule systems for modal propositional logic
- A characterization of irreducible sets modulo left-linear term rewriting systems by tree automata
- Functional data term models and semantic unification.-Modular algebraic specifications
- Proving inductive theorems based on term rewriting systems
- Jungle evaluation for efficient term rewriting
- A new quasi-reducibility testing algorithm and its application to proofs by induction
- Fuzzy reasoning based on f-horn clause rules
- Babel: A functional and logic programming language based on constructor discipline and narrowing
- Refined compilation of pattern-matching for functional languages
- Narrowing in partial conditional equational theories
- Solving equations in an equational language
- Nonstandard logics of recursive programs and denotational semantics. .