Skip to search formSkip to main contentSkip to account menu

Gödel

Known as: Godel (programming language), Goedel (programming language), Goedel programming language 
Gödel is a declarative, general-purpose programming language that adheres to the logic programming paradigm. It is a strongly typed language, the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
Declarative programmingList of programming languagesLogic programmingParametric polymorphism

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2023
Highly Cited
2023
Logic and Computation
In the last chapter we saw how to use first order predicate logic (FOPL) as a system for representation and reasoning. We noted… 
Review
2015
Review
2015
On El Naschie’s Fractal-Cantorian Space-Time and Dark Energy—A Tutorial Review
This tutorial review is dedicated to the work of the outstanding Egyptian theoretical physicist and engineering scientist Prof… 
2015
2015
Relying on Intuitions: Where Cappelen and Deutsch Go Wrong
Abstract In Philosophy without Intuitions (Oxford: Oxford University Press, 2012), Herman Cappelen challenges the ‘almost… 
2015
2015
Taking the Pirahã seriously
2010
2010
Some properties of fuzzy reasoning in propositional fuzzy logic systems
2004
2004
Cybersemiotics and the Problems of the Information-Processing Paradigm as a Candidate for a Unified Science of Information Behind Library Information Science
As an answer to the humanistic, socially oriented critique of the information-processing paradigms used as a conceptual frame for… 
2002
2002
Runtime Service Composition via Logic-Based Program Synthesis
Dynamic composition of services from components at runtime can help to provide flexible service infrastructures, but requires… 
Highly Cited
2001
Highly Cited
2001
Mathematics in the 20th century
This article is based on the transcript of a recording of the author’s Fields Lecture at the World Mathematical Year 2000… 
1992
1992
An unprovable Ramsey-type theorem
We present a new proof of the Paris-Harrington unprovable (in PA) version of Ramsey's theorem. This also yields a particularly… 
1950
1950
General recursive functions
where the symbol on the right denotes the smallest y such that A (X, y) = 0, under the assumption that there is such a y for each… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)