ALPUK92 pp 299-343 | Cite as

An Introduction to Gödel

  • A. Bowers
  • P. M. Hill
Part of the Workshops in Computing book series (WORKSHOPS COMP.)


The logic programming language Gödel is a new language with functionality and expressiveness similar to Prolog, but greatly improved declarative semantics compared with Prolog. Facilities provided by Gödel include types, meta-programming, control annotations, modules, and input/output. This paper is an introduction and tutorial for Gödel.


Normal Form Ground Representation Computation Rule Logic Programming Language Language Declaration 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Language Compatible Arithmetic Standard, ISO/IEC 10967:1991, March 1991. First Committee Draft (Version 3.1), JTC1/SC22/WG11 N229; X3T2 91–073.Google Scholar
  2. [2]
    K.A. Bowen and R.A. Kowalski. Amalgamating language and metalanguage in logic programming. In K.L. Clark and S.-A. Tarnlund, editors, Logic Programming, pages 153–172. Academic Press, 1982.Google Scholar
  3. [3]
    H. B. Enderton. A Mathematical Introduction to Logic. Academic Press, 1972.MATHGoogle Scholar
  4. [4]
    P. M. Hill. Typed logic programs and their completion. Technical Report 92.05, School of Computer Studies, 1992.Google Scholar
  5. [5]
    P.M. Hill and J.W. Lloyd. Meta-programming for dynamic knowledge bases. Technical Report CS-88–18, Department of Computer Science, University of Bristol, 1988.Google Scholar
  6. [6]
    P.M. Hill and J.W. Lloyd. Analysis of meta-programs. In H.D. Abramson and M.H. Rogers, editors, Meta-Programming in Logic Programming, pages 23–52. MIT Press, 1989. Proceedings of the Meta88 Workshop, June 1988.Google Scholar
  7. [7]
    P.M. Hill and J.W. Lloyd. The Gödel report. Technical Report TR-91–02, Department of Computer Science, University of Bristol, 1991. Revised June 1992.Google Scholar
  8. [8]
    P.M. Hill, J.W. Lloyd, and J.C. Shepherdson. Properties of a pruning operator. Journal of Logic and Computation, 1(1):99–143, 1990.MathSciNetMATHCrossRefGoogle Scholar
  9. [9]
    P.M. Hill and R.W. Topor. A semantics for typed logic programs. In F. Pfenning, editor, Types in Logic Programming. MIT Press, 1992.Google Scholar
  10. [10]
    J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, second edition, 1987.MATHCrossRefGoogle Scholar
  11. [11]
    L. Naish. Negation and quantifiers in NU-Prolog. In E. Shapiro, editor, Proceedings of the Third International Conference on Logic Programming, London, pages 624–634. Lecture Notes in Computer Science 225, Springer-Verlag, 1986.CrossRefGoogle Scholar
  12. [12]
    H. Paley and P.M. Weichsel. Elements of Abstract and Linear Algebra. Holt, Rinehart and Winston, 1972.Google Scholar
  13. [13]
    E. Shapiro. The family of concurrent logic programming languages. ACM Computing Surveys, 21(3):412–510, 1989.CrossRefGoogle Scholar
  14. [14]
    J. A. Thom and J. Zobel. Nu-prolog reference manual, version 1.3. Technical report, Machine Intelligence Project, Department of Computer Science, University of Melbourne, 1988.Google Scholar

Copyright information

© British Computer Society 1993

Authors and Affiliations

  • A. Bowers
    • 1
  • P. M. Hill
    • 2
  1. 1.Department of Computer ScienceUniversity of BristolBristolUK
  2. 2.School of Computer StudiesUniversity of LeedsLeedsUK

Personalised recommendations