An Introduction to Gödel

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

[1]  John W. Lloyd,et al.  The Godel Report , 1991 .

[2]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[3]  Krzysztof R. Apt,et al.  Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[4]  Robert B. Reisel,et al.  Elements of abstract and linear algebra , 1971 .

[5]  John W. Lloyd,et al.  Analysis of Meta-Programs , 1989, META.

[6]  Ehud Shapiro,et al.  The family of concurrent logic programming languages , 1989, CSUR.

[7]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

[8]  Frank Pfenning,et al.  Types in Logic Programming , 1992, ICLP.

[9]  John W. Lloyd,et al.  Properties of a Pruning Operator , 1990, Journal of Logic and Computation.

[10]  Rodney W. Topor,et al.  A Semantics for Typed Logic Programs , 1992, Types in Logic Programming.

[11]  Lee Naish,et al.  Negation and Quantifiers in NU-Prolog , 1986, ICLP.