
The Gödel Programming LanguageGödel is a declarative, generalpurpose programming language in the family of logic programming languages. It is a strongly typed language, the type system being based on manysorted logic with parametric polymorphism. It has a module system. Gödel supports infinite precision integers, infinite precision rationals, and also floatingpoint numbers. It can solve constraints over finite domains of integers and also linear rational constraints. It supports processing of finite sets. It also has a flexible computation rule and a pruning operator which generalises the commit of the concurrent logic programming languages. Considerable emphasis is placed on Gödel's meta logical facilities which provide significant support for metaprograms that do analysis, transformation, compilation, verification, debugging, and so on.Here is an example Gödel program.
There is a book on the language:P.M. Hill & J.W. Lloyd. The Gödel Programming Language. MIT Press, 1994, ISBN 0262082292.
Gödel with Generic (Parametrised) ModulesGödel has a simple module system. There is an experimental version in goedel2.tar.Z that supports parametrised modules. This system includes:


hill@comp.leeds.ac.uk 
Home  Personal Info  Research  Papers  Research Degrees Admissions Tutor  Gödel  Interests  People  Links 