Skip to main content

Computer Program Synthesis Methodologies

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

  • Conference proceedings
  • © 1983

Overview

Part of the book series: Nato Science Series C: (ASIC, volume 95)

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (10 papers)

Keywords

About this book

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.

Editors and Affiliations

  • Department of Computer Science, Duke University, Durham, USA

    Alan W. Biermann

  • Laboratoire de Recherche en Informatique, Université de Paris-Sud, Orsay, France

    Gérard Guiho

Bibliographic Information

  • Book Title: Computer Program Synthesis Methodologies

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

  • Editors: Alan W. Biermann, Gérard Guiho

  • Series Title: Nato Science Series C:

  • DOI: https://doi.org/10.1007/978-94-009-7019-9

  • Publisher: Springer Dordrecht

  • eBook Packages: Springer Book Archive

  • Copyright Information: D. Reidel Publishing Company, Dordrecht, Holland 1983

  • Hardcover ISBN: 978-90-277-1504-3Published: 31 December 1982

  • Softcover ISBN: 978-94-009-7021-2Published: 08 December 2011

  • eBook ISBN: 978-94-009-7019-9Published: 06 December 2012

  • Series ISSN: 1389-2185

  • Edition Number: 1

  • Number of Pages: IX, 374

  • Topics: Mathematics, general

Publish with us