Strictness standardization/description

L.S., Much has already been said about strictness, but what I haven't seen discussed sofar, and what am missing in the Haskell Report, is a description of the strictness of parameters of functions and operators. It is often important to know the strictness to prevent space leaks and even for the correctness of a program. A description of strictness in the Haskell' report would not only enable more reliable design of Haskell programs, but also prevent difference in strictness between the compilers/interpreters. -- Best regards, Henk-Jan van Tuyl -- http://members.chello.nl/hjgtuyl -- Using Opera's revolutionary e-mail client: https://secure.bmtmicro.com/opera/buy-opera.html?AID=789433

which reminds me: - Patrik Jansson, while chasing bottoms, found some nice examples of not-nice-at-all interactions of strictness and the pattern-matching translation; I don't recall the details, but I do recall that I was not all that happy that those equations and not-equations were really what the report implied they should be. there are a few examples on slide 3 of this talk: http://www.cs.chalmers.se/~patrikj/talks/refactoringworkshop040209.pdf - the Programatica project has a Haskell-in-Haskell implementation, which apart from a possible candidate for such a library, prompted many investigations into the oddities of Haskell 98, strictness aspects of pattern matching amongst them, iirc; I think Bill Harrison was involved in most of those papers: http://www.cs.missouri.edu/~harrison/publications.html have I just misssed it, or has neither been discussed yet on this list? I do hope that the committee is soliciting input from all such investigations that may be relevant for this revision, even if the authors themselves do not put their results forward again. but among all the items on the main haskell prime page, I cannot find the obvious one: a collection of links and references relevant to the process (there are many links scattered all over the wiki/ticket tracker/mailing list archives, but is there an organised collection?). cheers, claus

Claus Reinke wrote:
- the Programatica project has a Haskell-in-Haskell implementation, which apart from a possible candidate for such a library, prompted many investigations into the oddities of Haskell 98, strictness aspects of pattern matching amongst them, iirc; I think Bill Harrison was involved in most of those papers:
The Programatica team also produced a formal spec of the Haskell 98 module system, which may come handy: http://www.cse.ogi.edu/PacSoft/projects/programatica/diatchi.pdf Their Haskell implementation correctly implements Haskell98's recursive modules (among other subtleties). Here's the "Logic of Demand" paper that I think Claus is referring to above: http://www.cse.ogi.edu/PacSoft/projects/programatica/harrison-kieburtz.pdf A -- Andy Adams-Moran Phone: 503.626.6616, x113 Galois Connections Inc. Fax: 503.350.0833 12725 SW Millikan Way, Suite #290 http://www.galois.com Beaverton, OR 97005 adams-moran@galois.com
participants (3)
-
Andy Adams-Moran
-
Claus Reinke
-
Henk-Jan van Tuyl