Re: residuation for compositional search?

From: Antonio Regidor García <>
Date: Tue, 14 Jun 2011 20:12:55 +0100 (BST)

--- El mar, 14/6/11, Michael Hanus <> escribió:

> I would agree if you would say "successful termination".
> In case of failures, I think there are many languages or
> systems
> where the ability to fail instead of running into an
> infinite
> loop depends on the abilities of the compiler. For
> instance, if you
> require that some class of programs should not terminate,
> you exclude the development of sophisticated loop detection
> techniques
> that provide useful error messages to the programmer
> instead of
> simply looping.

I don't think this is the case here. There is no error message here.

For small programas there is no big deal, but for production software this can be a serious problem. You have a large software that works ok when compiled with compiler A. Some day, you try compiler B and then the program dies with a stack overflow and suddenly you have hundreds of bugs to search for.

But, if the difference is only for meta-programming stuff, maybe the problem is not so serious.



curry mailing list
Received on Di Jun 14 2011 - 21:36:05 CEST

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