Re: Invertible nondeterminism?

From: Sebastian Fischer <sebf_at_informatik.uni-kiel.de>
Date: Thu, 16 Dec 2010 21:34:52 +0900

Hi Julio,

On Thu, 2010-12-16 at 13:23 +0100, Julio Mariņo wrote:
> The idea seems mathematically reasonable and reminds me to
> constructive negation in constraint logic programming.

Does constructive negation use something like the Grothendiek-group or
does the similarity not go that far? Anyway, thanks for the pointer,
I'll look into it.

> The domain-theory needed for anti-answers would be similar,
> apparently, to constructive computed answers in CLP(Herbrand) with
> equalities and disequalities, but I am being highly speculative here.

I hope to get away with a purely algebraic construction as the
Groethendiek-group is an abelian group for every underlying commutative
monoid. I intend to conclude from the commutative monoid laws that the
inversion laws hold by construction without developing a separate
theory..

Sebastian

_______________________________________________
curry mailing list
curry_at_lists.RWTH-Aachen.DE
http://MailMan.RWTH-Aachen.DE/mailman/listinfo/curry
Received on Do Dez 16 2010 - 13:41:29 CET

This archive was generated by hypermail 2.3.0 : Do Jun 20 2024 - 07:15:11 CEST