Editing Gödel (programming language) (section)

==Features==
Gödel has a module system, and it supports [[Arbitrary-precision arithmetic|arbitrary precision]] integers, arbitrary precision rationals, and also floating-point numbers. It can solve [[constraint (mathematics)|constraints]] over finite domains of integers and also linear rational constraints. It supports processing of [[finite set]]s. It also has a flexible computation rule and a pruning operator which generalises the commit of the concurrent logic programming languages.

Gödel's [[meta-logic]]al facilities provide support for meta-programs that do analysis, [[program transformation|transformation]], compilation, verification, and debugging, among other tasks.