![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
The Goedel Programming Language Appeared in Volume 7/3. August 1994
Keywords: Goedel.
By Patricia Hill and John Lloyd
Goedel is a new, general-purpose, declarative programming language that is based on the paradigm of logic programming and can be regarded as a successor to Prolog. This book gives a tutorial overview of Goedel, presents example programs, provides a formal definition of the syntax and semantics of the language, and covers background material on logic.
For details on how to obtain the system, go here.
The declarative nature of Goedel makes it well suited for use as a teaching language, narrows the gap that currently exists between theory and practice in logic programming, makes possible advanced software engineering tools such as declarative debuggers and compiler generators, reduces the effort involved in providing a parallel implementation of the language, and offers substantial scope for parallelization in such implementations.
The book is divided into two parts. The first part gives an informal overview of the language and includes example programs. The second part contains a definition of the syntax and semantics of the language.
Logic Programming series
MIT Press
May 1994, 7 x 9, 370 pp, US$45.00
ISBN 0-262-08229-2
For orders in the US: mitpress-orders@mit.edu
For inquiries: mitpress-order-inq@mit.edu
To access our catalogs telnet to: technifo.mit.edu and look under \Around MIT\Offices and Services. This server is also a Gopher server (gopher.mit.edu)
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |