courses on FLP

From: Sergio Antoy <>
Date: Mon, 12 Nov 2012 08:53:03 -0800

I am trying to compile a list of courses recently taught on
the subject of Functional Logic Programming. I am aware of
the course taught at CAU Kiel by Michael Hanus and, obviosuly,
at PSU by myself. If you have any addition, I'll be glad to
receive it.

                                  Sergio Antoy
                                  Dept. of Computer Science
                                  Portland State University
                                  P.O.Box 751
                                  Portland, OR 97207
                                  voice +1 (503) 725-3009
                                  fax +1 (503) 725-3211
curry mailing list

Message-id: <>
Date: Wed, 20 Jun 2012 18:09:49 +0200
From: Michael Hanus <>
User-Agent: Mozilla/5.0 (X11; U; Linux i686 (x86_64); en-US; rv:
        Gecko/20111120 Icedove/3.1.16
To: curry_at_lists.RWTH-Aachen.DE
X-Enigmail-Version: 1.1.2
X-Null-Tag: 962388635b3f7e33a8d46ace026a6966
X-Null-Tag: bbf36883138784af3cff844c30ba58c8
X-Authenticated-Sender: user mh from
Subject: Re: equality of partial applications
X-BeenThere: curry_at_lists.RWTH-Aachen.DE
X-Mailman-Version: 2.1.14
Precedence: list
List-Id: Discussions on the programming language Curry
List-Unsubscribe: <http://MailMan.RWTH-Aachen.DE/mailman/options/curry>,
List-Archive: <http://MailMan.RWTH-Aachen.DE/pipermail/curry>
List-Post: <mailto:curry_at_lists.RWTH-Aachen.DE>
List-Help: <mailto:curry-request_at_lists.RWTH-Aachen.DE?subject=help>
List-Subscribe: <http://MailMan.RWTH-Aachen.DE/mailman/listinfo/curry>,
Errors-to: curry-bounces_at_lists.RWTH-Aachen.DE
Sender: curry-bounces_at_lists.RWTH-Aachen.DE

On 06/18/2012 09:53 AM, Sebastian Fischer wrote:
> On Mon, Jun 18, 2012 at 9:30 AM, Wolfgang Lux <> wrote:
>> However, what you are expecting here is extensional equality, which is impossible to support in Curry.
> Not only in Curry, as it is in general undecidable..

Just a short remark to your interesting discussion.

I think that undecidability is not an argument against supporting
extensional equality. Unification modulo defined operations
is also undecidable but still supported in Curry...

Actually, some form of higher-order unification was originally
proposed for Curry but later abandoned due to its complexity.

Best regards,

curry mailing list
Received on Mi Jun 20 2012 - 17:58:35 CEST

This archive was generated by hypermail 2.3.0 : Do Mai 23 2024 - 07:15:11 CEST