<s>
Gödel	B-Language
is	O
a	O
declarative	B-Language
,	O
general-purpose	O
programming	O
language	O
that	O
adheres	O
to	O
the	O
logic	B-Language
programming	I-Language
paradigm	O
.	O
</s>
<s>
It	O
is	O
a	O
strongly	O
typed	O
language	O
,	O
the	O
type	O
system	O
being	O
based	O
on	O
many-sorted	O
logic	B-Language
with	O
parametric	O
polymorphism	O
.	O
</s>
<s>
It	O
is	O
named	O
after	O
logician	O
Kurt	O
Gödel	B-Language
.	O
</s>
<s>
Gödel	B-Language
has	O
a	O
module	O
system	O
,	O
and	O
it	O
supports	O
arbitrary	B-Algorithm
precision	I-Algorithm
integers	O
,	O
arbitrary	B-Algorithm
precision	I-Algorithm
rationals	O
,	O
and	O
also	O
floating-point	O
numbers	O
.	O
</s>
<s>
It	O
can	O
solve	O
constraints	B-Application
over	O
finite	O
domains	O
of	O
integers	O
and	O
also	O
linear	O
rational	O
constraints	B-Application
.	O
</s>
<s>
It	O
also	O
has	O
a	O
flexible	O
computation	O
rule	O
and	O
a	O
pruning	O
operator	O
which	O
generalises	O
the	O
commit	O
of	O
the	O
concurrent	O
logic	B-Language
programming	I-Language
languages	I-Language
.	O
</s>
<s>
Gödel	B-Language
's	O
meta-logical	O
facilities	O
provide	O
support	O
for	O
meta-programs	O
that	O
do	O
analysis	O
,	O
transformation	B-Application
,	O
compilation	O
,	O
verification	O
,	O
and	O
debugging	O
,	O
among	O
other	O
tasks	O
.	O
</s>
<s>
The	O
following	O
Gödel	B-Language
module	O
is	O
a	O
specification	O
of	O
the	O
greatest	O
common	O
divisor	O
(	O
GCD	O
)	O
of	O
two	O
numbers	O
.	O
</s>
<s>
It	O
is	O
intended	O
to	O
demonstrate	O
the	O
declarative	B-Language
nature	O
of	O
Gödel	B-Language
,	O
not	O
to	O
be	O
particularly	O
efficient	O
.	O
</s>
