Re: Declarative constraints in practical terms
Date: Tue, 28 Feb 2006 09:36:24 +0200
Message-ID: <du0uhq$ja7$1_at_emma.aioe.org>
<ralphbecket_at_gmail.com> wrote in message
news:1141076877.789050.200720_at_z34g2000cwc.googlegroups.com...
>
> x wrote:
> > I don't know why but I think it has something to do with the fact that
in
> > some PROLOG implementations the inequality tests are not allowed on
unbouded
> > variables.
> That's all Prolog implementations. Despite what is often
> said, Prolog is not a declarative language; it's an imperative
> language with unification and backtracking.
That's not all Prolog implementations.
Maybe the word "test" is not the best word to put in that sentence.
> Have a look at Mercury for an example of a pragmatic,
> general purpose, high performance declarative
> programming language.
I used Goedel for about one year.
I'll look at Mercury when I'll find some time but I saw that there is not a
version 1 yet (0.12.2).
Do you have any information about Escher ?
Received on Tue Feb 28 2006 - 08:36:24 CET