Advertisement

Computing in Horn Clause Theories

  • Peter Padawitz

Part of the EATCS Monographs on Theoretical Computer Science book series (EATCS, volume 16)

Table of contents

  1. Front Matter
    Pages I-XI
  2. Peter Padawitz
    Pages 1-5
  3. Peter Padawitz
    Pages 7-13
  4. Peter Padawitz
    Pages 15-52
  5. Peter Padawitz
    Pages 53-111
  6. Peter Padawitz
    Pages 113-137
  7. Peter Padawitz
    Pages 139-152
  8. Peter Padawitz
    Pages 153-186
  9. Peter Padawitz
    Pages 187-240
  10. Peter Padawitz
    Pages 241-305
  11. Back Matter
    Pages 307-322

About this book

Introduction

At least four research fields detennine the theoretical background of specification and deduction in computer science: recursion theory, automated theorem proving, abstract data types and tenn rewriting systems. As these areas approach each other more and more, the strong distinctions between functional and relational views, deductive and denotational approaches as well as between specification and programming are relieved in favour of their integration. The book will not expose the lines of this development; conversely, it starts out from the nucleus of Hom clause logic and brings forth both known and unknown results, most of which affect more than one of the fields mentioned above. Chapter 1 touches on historical issues of specification and prototyping and delimits the topics handled in this book from others which are at the core of related work. Chapter 2 provides the fundamental notions and notations needed for the presentation and interpretation of many-sorted Horn clause theories with equality. Chapter 3 supplies a number of sample Hom clause specifications ranging from arithmetic through string manipulation to higher data structures and interpreters of programming languages. Some of these examples serve as a reference to illustrate definitions and results, others may throw a light on the strong link between specifications and programs, which are executed by applying deduction rules. Thus we have included examples of how to use program trans/ormation methods in specification design.

Keywords

Boolean algebra Natural Resolution algorithm algorithms language logic palindrome program transformation programming semantics

Authors and affiliations

  • Peter Padawitz
    • 1
  1. 1.Fakultät für Mathematik und InformatikUniversität PassauPassauGermany

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-73824-1
  • Copyright Information Springer-Verlag Berlin Heidelberg 1988
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-642-73826-5
  • Online ISBN 978-3-642-73824-1
  • Series Print ISSN 1431-2654
  • Buy this book on publisher's site