Content deleted Content added
Niceguyedc (talk | contribs) m WPCleaner v1.27 - Repaired 1 link to disambiguation page - (You can help) - Pascal / Fixed using WP:WCW - Reference list duplication |
m →Historical remarks: clean up, typos fixed: 1980's → 1980s (2) using AWB |
||
Line 213:
Gödel programming language benefits from previous designed languages and work of many authors. It is based on, and supposed to be a successor of Prolog that was developed by Alain Colmerauer in 1972. Gödel then contains:
* the intensional set terms developed from set processing facilities introduced around 1980 into Prolog by David H.D. Warren
* pruning operator first appeared in the Relational Language of Keith Clark and Steve Gregory in the early
* the if-then-else construct and the when control declaration taken from NU-Prolog introduced by Lee Naish around 1986
* the type system based on many-sorted first order logic with the addition of polymorphism through parameters and constructors
* the ideas of the polymorphic component are made by Robin Milner (introduced in ML in the
* the module system is based on standard ideas of Modula-2
* the constraint solving facilities are partially developed by Alain Colmerauer, Joxan Jaffar, Jean-Luis Lassez (influenced by work of Kenneth Bowen and Robert Kowalski which itself relies on work of Kurt Gödel)
| |||