H ? « ‹ ← → › »

Language peer sets for Gödel:
Designed 1994 ↑
1990s languages ↑
Fifth generation↑
Post-Cold War↑

Gödel(ID:2072/gde001)

alternate simple view
Designed 1994

after Kurt Gödel, of theorem fame

a declarative, general-purpose language in the family of logic languages. It is a strongly typed language, the type system being based on man-sorted logic with parametric polymorphism. It has a module system. It supports infinite precision integers, infinite precision rationals, and also floating-point numbers. It can solve constraints over finite domains of integers and also linear rational constraints. It supports processing of finite sets. Considerable emphasis is placed on GÖDEL's meta-logical facilities which provide significant support for analysis, transformation, compilation, debugging, and verification.
References:
  • Hill, P.M. (1994) Hill, P.M. & J.W. Lloyd. The Gödel Programming Language. MIT Press, 1994
    Resources
    Search in: Google  Google scholar  World Cat  Yahoo  Overture  DBLP  Monash bib  NZ  IEEE  ACM portal  CiteSeer  CSB  ncstrl  jstor  Bookfinder