Higher-Order Algebra, Logic, and Term Rewriting
Higher-Order Algebra, Logic, and Term Rewriting

Author: J. Heering

Publisher: Springer Science & Business Media

Published: 1994-07-28

Total Pages: 362

ISBN-13: 9783540582335

DOWNLOAD EBOOK

This volume contains the final revised versions of the best papers presented at the First International Workshop on Higher-Order Algebra, Logic, and Term Rewriting (HOA '93), held in Amsterdam in September 1993. Higher-Order methods are increasingly applied in functional and logic programming languages, as well as in specification and verification of programs and hardware. The 15 full papers in this volume are devoted to the algebra and model theory of higher-order languages, computational logic techniques including resolution and term rewriting, and specification and verification case studies; in total they provide a competently written overview of current research and suggest new research directions in this vigourous area.

Higher-Order Algebra, Logic, and Term Rewriting
Higher-Order Algebra, Logic, and Term Rewriting

Author: Gilles Dowek

Publisher: Springer Science & Business Media

Published: 1996-05-08

Total Pages: 38

ISBN-13: 9783540612544

DOWNLOAD EBOOK

This book presents a collection of revised refereed papers selected from the presentations accepted for the Second International Workshop on Higher-Order Algebra, Logic, and Term Rewriting, HOA '95, held in Paderborn, Germany, in September 1995. The 14 research papers included, together with an invited paper by Jan Willem Klop, report state-of-the-art results; the relevant theoretical aspects are addressed, and in addition existing proof systems and term rewriting systems are discussed.

Term Rewriting Systems
Term Rewriting Systems

Author: Terese

Publisher: Cambridge University Press

Published: 2003-03-20

Total Pages: 926

ISBN-13: 9780521391153

DOWNLOAD EBOOK

Term rewriting systems developed out of mathematical logic and are an important part of theoretical computer science. They consist of sequences of discrete transformation steps where one term is replaced with another and have applications in many areas, from functional programming to automatic theorem proving and computer algebra. This 2003 book starts at an elementary level with the earlier chapters providing a foundation for the rest of the work. Much of the advanced material appeared here for the first time in book form. Subjects treated include orthogonality, termination, completion, lambda calculus, higher-order rewriting, infinitary rewriting and term graph rewriting. Many exercises are included with selected solutions provided on the web. A comprehensive bibliography makes this book ideal both for teaching and research. A chapter is included presenting applications of term rewriting systems, with many pointers to actual implementations.

Term Rewriting and Applications
Term Rewriting and Applications

Author: Jürgen Giesl

Publisher: Springer Science & Business Media

Published: 2005-04-07

Total Pages: 528

ISBN-13: 3540255966

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 16th International Conference on Rewriting Techniques and Applications, RTA 2005, held in Nara, Japan in April 2005. The 29 revised full papers and 2 systems description papers presented together with 5 invited articles were carefully reviewed and selected from 79 submissions. All current issues in Rewriting are addressed, ranging from foundational and methodological issues to applications in various contexts; due to the fact that the first RTA conference was held 20 years ago, the conference offered 3 invited historical papers 2 of which are included in this proceedings.

Algebraic and Logic Programming
Algebraic and Logic Programming

Author: Michael Hanus

Publisher: Springer Science & Business Media

Published: 1997-08-20

Total Pages: 308

ISBN-13: 9783540634591

DOWNLOAD EBOOK

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 full papers presented in the book were selected from 31 submissions. The volume is divided in sections on functional and logic programming, higher-order methods, term rewriting, types, lambda-calculus, and theorem proving methods.

Solving Higher-Order Equations
Solving Higher-Order Equations

Author: Christian Prehofer

Publisher: Springer Science & Business Media

Published: 2012-12-06

Total Pages: 193

ISBN-13: 1461217784

DOWNLOAD EBOOK

This monograph develops techniques for equational reasoning in higher-order logic. Due to its expressiveness, higher-order logic is used for specification and verification of hardware, software, and mathematics. In these applica tions, higher-order logic provides the necessary level of abstraction for con cise and natural formulations. The main assets of higher-order logic are quan tification over functions or predicates and its abstraction mechanism. These allow one to represent quantification in formulas and other variable-binding constructs. In this book, we focus on equational logic as a fundamental and natural concept in computer science and mathematics. We present calculi for equa tional reasoning modulo higher-order equations presented as rewrite rules. This is followed by a systematic development from general equational rea soning towards effective calculi for declarative programming in higher-order logic and A-calculus. This aims at integrating and generalizing declarative programming models such as functional and logic programming. In these two prominent declarative computation models we can view a program as a logical theory and a computation as a deduction.

Computer Science Logic
Computer Science Logic

Author: Anuj Dawar

Publisher: Springer Science & Business Media

Published: 2010-08-11

Total Pages: 561

ISBN-13: 364215204X

DOWNLOAD EBOOK

This volume constitutes the refereed proceedings of the 24th International Workshop on Computer Science Logic, CSL 2010, held in Brno, Czech Republic, in August 2010. The 33 full papers presented together with 7 invited talks, were carefully reviewed and selected from 103 submissions. Topics covered include automated deduction and interactive theorem proving, constructive mathematics and type theory, equational logic and term rewriting, automata and games, modal and temporal logic, model checking, decision procedures, logical aspects of computational complexity, finite model theory, computational proof theory, logic programming and constraints, lambda calculus and combinatory logic, categorical logic and topological semantics, domain theory, database theory, specification, extraction and transformation of programs, logical foundations of programming paradigms, verification and program analysis, linear logic, higher-order logic, and nonmonotonic reasoning.

Rewriting Techniques and Applications
Rewriting Techniques and Applications

Author: Leo Bachmair

Publisher: Springer

Published: 2006-12-30

Total Pages: 284

ISBN-13: 3540449809

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 11th International Conference on Rewriting Techniques and Applications, RTA 2000, held in Norwich, UK, in July 2000. The 15 revised full papers and three system descriptions presented together with two invited contributions were carefully reviewed and selected from 44 submissions. All current aspects of rewriting are addressed.

Fork Algebras in Algebra, Logic and Computer Science
Fork Algebras in Algebra, Logic and Computer Science

Author: Marcelo Fabi n Frias

Publisher: World Scientific

Published: 2002

Total Pages: 230

ISBN-13: 9810248768

DOWNLOAD EBOOK

Fork algebras are a formalism based on the relational calculus, with interesting algebraic and metalogical properties. Their representability is especially appealing in computer science, since it allows a closer relationship between their language and models. This book gives a careful account of the results and presents some applications of Fork algebras in computer science, particularly in system specification and program construction. Many applications of Fork algebras in formal methods can be applied in many ways, and the book covers all the essentials in order to provide the reader with a better understanding.

Symbolic Rewriting Techniques
Symbolic Rewriting Techniques

Author: Manuel Bronstein

Publisher: Springer Science & Business Media

Published: 1998

Total Pages: 304

ISBN-13: 9783764359010

DOWNLOAD EBOOK

Symbolic rewriting techniques are methods for deriving consequences from systems of equations, and are of great use when investigating the structure of the solutions. Such techniques appear in many important areas of research within computer algebra: • the Knuth-Bendix completion for groups, monoids and general term-rewriting systems, • the Buchberger algorithm for Gröbner bases, • the Ritt-Wu characteristic set method for ordinary differential equations, and • the Riquier-Janet method for partial differential equations. This volume contains invited and contributed papers to the Symbolic Rewriting Techniques workshop, which was held at the Centro Stefano Franscini in Ascona, Switzerland, from April 30 to May 4, 1995. That workshop brought together 40 researchers from various areas of rewriting techniques, the main goal being the investigation of common threads and methods. Following the workshops, each contribution was formally refereed and 14 papers were selected for publication.