Gödel (programming language): Difference between revisions

Revision as of 13:41, 1 October 2006

Latest revision as of 15:02, 30 August 2025

(48 intermediate revisions by 31 users not shown)

Line 1:

{{Short description|Declarative, general-purpose programming language}}

'''Gödel''' is a [[declarative (programming)|declarative]], general-purpose [[programming language]] that adheres to the [[logical (programming)|logic]] [[programming paradigm]]. It is a [[strongly typed language]], the type system being based on many-sorted logic with parametric polymorphism. It is named after logician [[Kurt Gödel]].

{{Infobox programming language

| name =Gödel

| logo =

| paradigm = [[Declarative programming|declarative]], [[Logic programming|logic]]

| year = 1992

| designer =John Lloyd & Patricia Hill

| developer = John Lloyd & Patricia Hill

| latest_release_version = 1.5

| latest release date ={{release date|1995|8|11}}

| typing = [[strong typing|strong]]

| implementations =

| dialects = [https://web.archive.org/web/20091207092823/http://www.scs.leeds.ac.uk/hill/GOEDEL/expgoedel.html Gödel with Generic (Parametrised) Modules]

| influenced_by =

| influenced =

| operating_system = [[Unix-like]]

| license = Non-commercial research/educational use only

| website = https://www.cs.unipr.it/~hill/GOEDEL/expgoedel.html

| file_ext =

}}

'''Gödel''' is a [[declarativeDeclarative (programming)|declarative]], general-purpose [[programming language]] that adheres to the [[logicalLogic (programming)|logic]] [[programming paradigm]]. It is a [[strongly typed language]], the type system being based on [[many-sorted logic]] with [[parametric polymorphism]]. It is named after logician [[Kurt Gödel]].

==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 setsset]]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.

==Sample code==

Line 29 ⟶ 50:

i Mod d = 0 &

j Mod d = 0.

==External links==

*[ https://web.archive.org/web/20091207092823/http://www.csscs.brisleeds.ac.uk/~bowershill/goedelGOEDEL/expgoedel.html Bristol Gödel site]

* https://mitpress.mit.edu/9780262519151/the-godel-programming-language/

{{Authority control}}

{{DEFAULTSORT:Godel (programming language)}}

[[Category:Programming languages]]

[[Category:Logic programming languages|Godel]]

[[Category:Declarative programmingProgramming languages created in 1992]]

[[Category:Programming languages created by women]]

[[es:Lenguaje de programación Gödel]]