Advertisement

Computer Program Synthesis Methodologies

Proceedings of the NATO Advanced Study Institute held at Bonas, France, September 28–October 10, 1981

  • Alan W. Biermann
  • Gérard Guiho

Part of the NATO Advanced Study Institutes Series book series (ASIC, volume 95)

Table of contents

  1. Front Matter
    Pages i-ix
  2. Roland Backhouse
    Pages 79-124
  3. Patricia C. Goldberg
    Pages 125-145
  4. Hervé Gallaire
    Pages 173-212
  5. Jean-Pierre Jouannaud, Yves Kodratoff
    Pages 213-250
  6. Zohar Manna, Richard Waldinger
    Pages 251-307
  7. Alan W. Biermann
    Pages 335-368
  8. Back Matter
    Pages 369-374

About these proceedings

Introduction

powerful operations on them. An early step in this direction was the development of APl, and more recent examples have been SETl which enables a user to code in terms of mathematical enti­ ties such as sets and BDl which allows a user, presumably a businessman, to specify a computation in terms of a series of tabular forms and a series of processing paths through which data flows. The design and implementation of such languages are examined in chapters by P. GOLDBERG. Another extension to traditional methods is made possible by systems designed to automatically handle low level flow-of­ control decisions. All the above higher level languages do this implicitly with their built in operators. PROLOG is a language which does this with a theorem proving mechanism employing primarily unification and backtracking. The programmer specifies the problem to be solved with a set of formal logic statements including a theorem to be proved. The theorem proving system finds a way to combine the axioms to prove the theorem, and in the process, it completes the desired calculation. H. GAllAIRE has contributed a chapter describing PROLOG giving many examples of its usage.

Keywords

Calculation Mathematica Natural Prolog Rack algorithms calculus data types logic programming theorem

Editors and affiliations

  • Alan W. Biermann
    • 1
  • Gérard Guiho
    • 2
  1. 1.Department of Computer ScienceDuke UniversityDurhamUSA
  2. 2.Laboratoire de Recherche en InformatiqueUniversité de Paris-SudOrsayFrance

Bibliographic information

  • DOI https://doi.org/10.1007/978-94-009-7019-9
  • Copyright Information Springer Science+Business Media B.V. 1983
  • Publisher Name Springer, Dordrecht
  • eBook Packages Springer Book Archive
  • Print ISBN 978-94-009-7021-2
  • Online ISBN 978-94-009-7019-9
  • Series Print ISSN 1389-2185
  • Buy this book on publisher's site