From its home page (see below):

<blockquote>
G&ouml;del is a declarative, general-purpose *(programming language) in the family of *(logic) programming languages. It is a strongly typed language, the _(type system) being based on many-sorted logic with parametric polymorphism. It has a module system. G&ouml;del supports infinite precision integers, infinite precision rationals, and also floating-point 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&ouml;del's meta-logical facilities which provide significant support for meta-programs that do analysis, transformation, compilation, verification, debugging, and so on. [..]
</blockquote>

<ul class="implementations">
  <li>_("The G&ouml;del Programming Language"|http://www.cs.bris.ac.uk/~bowers/goedel.html).</li>
</ul>
