Del 49 - Mathematical Research
Algebraic and Logic Programming
Proceedings of an International Workshop held in Gaussig (GDR), November 14–18, 1988
Inbunden, Engelska, 1989
1 850 kr
Skickas inom 5-8 vardagar
Wolfgang Wechler – författare
Visar alla böcker från författaren Wolfgang Wechler. Handla med fri frakt och snabb leverans.
8 produkter
8 produkter
- Del 5 - Studien Zur Algebra Und Ihre Anwendungen
Concept of Fuzziness in Automata and Language Theory
Inbunden, Tyska, 19782 043 kr
Skickas inom 5-8 vardagar
- E-bokPDF, Tyska, 1979
1 775 kr
Läs direkt efter köp
Keine ausführliche Beschreibung für "The Concept of Fuzziness in Automata and Language Theory" verfügbar. - E-bokPDF, Engelska, 2005
739 kr
Läs direkt efter köp
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 rewrite rule systems, and Logic Programming, in the sense of Horn clause specifications and resolution systems. This includes combined algebraic/logic programming systems, mutual relations and mutual implementation of programming paradigms, completeness and efficiency considerations in both fields, as well as related topics. - Häftad, Engelska, 1989
571 kr
Skickas inom 10-15 vardagar
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 rewrite rule systems, and Logic Programming, in the sense of Horn clause specifications and resolution systems. This includes combined algebraic/logic programming systems, mutual relations and mutual implementation of programming paradigms, completeness and efficiency considerations in both fields, as well as related topics. - Häftad, Engelska, 1990
571 kr
Skickas inom 10-15 vardagar
This volume consists of papers presented at the Second International Conference on Algebraic and Logic Programming in Nancy, France, October 1-3, 1990. - E-bokPDF, Engelska, 2012
1 427 kr
Läs direkt efter köp
A new model-theoretic approach to universal algebra is offered in this book. Written for computer scientists, it presents a systematic development of the methods and results of universal algebra that are useful in a variety of applications in computer science. The notation is simple and the concepts are clearly presented. The book concerns the algebraic characterization of axiomatic classes of algebras (equational, implicational, and universal Horn classes) by closure operators generalizing the famous Birkhoff Variety Theorem, and the algebraic characterization of the related theories. The book also presents a thorough study of term rewriting systems. Besides basic notions, the Knuth-Bendix completion procedure and termination proof methods are considered. A third main topic is that of fixpoint techniques and complete ordered algebras. Algebraic specifications of abstract data types and algebraic semantics of recursive program schemes are treated as applications. The book is self-contained and suitable both as a textbook for graduate courses and as a reference for researchers. - Häftad, Engelska, 2012
1 135 kr
Skickas inom 10-15 vardagar
A new model-theoretic approach to universal algebra is offered in this book. Written for computer scientists, it presents a systematic development of the methods and results of universal algebra that are useful in a variety of applications in computer science. The notation is simple and the concepts are clearly presented. The book concerns the algebraic characterization of axiomatic classes of algebras (equational, implicational, and universal Horn classes) by closure operators generalizing the famous Birkhoff Variety Theorem, and the algebraic characterization of the related theories. The book also presents a thorough study of term rewriting systems. Besides basic notions, the Knuth-Bendix completion procedure and termination proof methods are considered. A third main topic is that of fixpoint techniques and complete ordered algebras. Algebraic specifications of abstract data types and algebraic semantics of recursive program schemes are treated as applications. The book is self-contained and suitable both as a textbook for graduate courses and as a reference for researchers.
