September 2001 - Haskell

Happy 1.11 InstallShield released
by Reuben Thomas 28 Sep '01

28 Sep '01

A Happy 1.11 InstallShield is now available (including the post hoc bug fix!). -- http://sc3d.org/rrt/ | competent, a. underpromoted

1 0

Final CFP: FOOL 9 -- Foundations of Object-Oriented Languages
by Martin Odersky 28 Sep '01

28 Sep '01

FINAL CALL FOR PAPERS The Ninth International Workshop on Foundations of Object-Oriented Languages FOOL 9 Sponsored by ACM SIGPLAN January 19, 2002 Portland, Oregon, USA Following POPL '02 http://www.cs.williams.edu/~kim/FOOL/fool9.html Deadlines Submissions: October 12, 2001 Notifications: November 12, 2001 Final versions: December 10, 2001 The search for sound principles for object-oriented languages has given rise to much work on the theory of programming languages during the past 15 years, leading to a better understanding of the key concepts of object-oriented languages and to important developments in type theory, semantics, and program verification. The FOOL workshops bring together researchers to share new ideas and results in these areas. The next workshop, FOOL 9, will be held in Portland, Oregon, on Saturday January 19, 2002, the day after POPL '02. Submissions for this event are invited in the general area of foundations of object-oriented languages; topics of interest include language semantics, type systems, program analysis and verification, programming calculi, concurrent and distributed languages, and database languages. The main focus in selecting workshop contributions will be the intrinsic interest and timeliness of the work, so authors are encouraged to submit polished descriptions of work in progress as well as papers describing completed projects. A web page will be created and made available as informal electronic conference proceedings. Submission procedure We solicit submissions on original research not previously published or currently submitted for publication elsewhere, in the form of extended abstracts. These extended abstracts should not exceed 5000 words (approximately 10 pages); shorter extended abstracts (e.g., 2000 words) are often sufficient. Submissions should be e-mailed to fool9(a)lampsun1.epfl.ch by Friday, October 12, 2001, using Postscript or PDF. Each submission may be included inline in a message or as a MIME attachment only. We may not be able to consider late submissions, or submissions that do not have a working and attended return e-mail address. (If electronic submission is impossible, please contact the program chair in September.) Receipt of the submissions will be acknowledged by e-mail. Authors should inquire in case a prompt acknowledgment is not received. Correspondence and questions should be sent to fool9(a)lampsun1.epfl.ch Steering Committee Martin Abadi, Bell Labs Kim Bruce, Williams College Luca Cardelli, Microsoft Research Kathleen Fisher, AT&T Labs Benjamin Pierce, University of Pennsylvania (chair) Didier Remy, INRIA Rocquencourt Program Chair Martin Odersky, Swiss Federal Institute of Technology Lausanne, fool9(a)lampsun1.epfl.ch Program Committee Viviana Bono, Universita di Torino Craig Chambers, University of Washington Erik Ernst, University of Aalborg Giorgio Ghelli, University of Pisa Atsushi Igarashi, University of Tokyo Shriram Krishnamurthi, Brown University Clemens Szyperski, Microsoft Research Jan Vitek, Purdue University

1 0

> Re: Joy and Concatenative Programming
by Manfred von Thun 28 Sep '01

28 Sep '01

> From: Wolfgang Jeltsch <wolfgang(a)jeltsch.net> > Date: Wed, 26 Sep 2001 18:57:16 +0200 [..] > SAJ told that Joy is functional. If I unterstood him correctly, he said > functional languages eliminated state and Joy IN ADDITION TO THIS eliminated > variables and environments. So there must be a important difference to > Forth because AFAIK Forth didn't eliminate state. Of course the particular > idea of transforming stacks is not new. If you like equations of the kind started by Wirth: Joy = Forth - state - lots_of_other_good_things + (nested) lists + GC + program_quotation + combinators. Joy = (pure) Lisp/Scheme - lambda_abstraction - function_application + program_quotation + function_composition. Comparisons with ML, Miranda and Haskell are not so useful because Joy is weakly and dynmically typed. http://www.latrobe.edu.au/philosophy/phimvt/joy.html - Manfred

1 0

Re: 0-based versus 1-based
by Ashley Yakeley 27 Sep '01

27 Sep '01

At 2001-09-27 15:16, Tom Pledger wrote: >Just as a matter of idle curiosity, is there a particular reason for >tuples starting at element 1 (fst) whereas lists start at element 0? 'fst' (first) is an ordinal. It actually corresponds to the cardinal 'zero'. The element at zero is the first element. The element at 37 is the 38th element. It's quite consistent. -- Ashley Yakeley, Seattle WA

2 1

0-based versus 1-based
by Tom Pledger 27 Sep '01

27 Sep '01

Just as a matter of idle curiosity, is there a particular reason for tuples starting at element 1 (fst) whereas lists start at element 0? fst ('x', 'y') --> 'x' "xy" !! 1 --> 'y'

2 1

RE: Cash Prizes Win!
by Ashley Yakeley 27 Sep '01

27 Sep '01

At 2001-09-27 03:48, Simon Marlow wrote: >I could turn on subscriber-only posting if there's a consensus to do >that. I vote for that. >It might be inconvenient in that you have to post from the same >account that you read Haskell mail from though, and I know some people >have separate email accounts just for receiving Haskell mail. I also run an email list using Mailman. Anytime a subscriber sends a message from a 'wrong' address, Mailman catches it, and I simply subscribe that address 'nomail', and approve the message. >Also, what do people think about the volume of Conference-related >announcements sent to the list (haskell(a)haskell.org in particular)? I'm not really bothered by the way it is... -- Ashley Yakeley, Seattle WA

1 0

Haskell report (August release)
by Simon Peyton-Jones 27 Sep '01

27 Sep '01

Gentle colleages As ever, the emission of a draft of the Revised Haskell 98 Report elicited a flood of new corrections. It's quite uncanny. Anyway, I now publish another draft (the August release). http://research.microsoft.com/~simonpj/haskell98-revised Please check it out. My plan is that if I hear nothing for a month, I'll freeze it. Otherwise I'll iterate. Main changes this month: * stuff to do with lexical syntax (Ch 2) * stuff to do with modules (Ch 5) * many minor wording improvements As ever, the bugs list says exactly what has changed (grep for "Aug 2001". Happy days, Simon

2 1

RE: GUI Library Task Force
by Simon Marlow 27 Sep '01

27 Sep '01

> I don't think this is compatible with things like adding support > for the library hierarchy with multiple dots to Haskell 98 as you > will then be able to write a program that is valid Haskell 98 by > todays definition but not yesterdays. OTOH if what you mean is > adding support incrementally to todays *tools* and declaring H98 > with a set of the new features to be Haskell 2 at some point in > the future then I don't have a problem with that. I don't think anyone is suggesting that we change the meaning of the term "Haskell 98": it is, and always will be, defined by the Haskell 98 report. The idea behind "addenda" to the report is to define a family of new languages, eg. Haskell 98 + FFI, Haskell 98 + FFI + Exceptions, and so on. These languages may be incompatible with pure Haskell 98, but compilers will generally give you the choice between pure Haskell 98 and whatever extensions are supported. Cheers, Simon

1 0

RE: Cash Prizes Win!
by Simon Marlow 27 Sep '01

27 Sep '01

[ Ketil Malde asks about recent spam on Haskell mailing lists... ] > How about disallowing non-subscribers from posting? This list is my > main source of spam these days. (Effective filtering is your friend) My apologies for this spam that got through. Mailman's automatic filtering catches *most* of the spam bound for the list - there are usually a few messages per day. The ones that get through are very much the exception, but it does occasionally happen. I could turn on subscriber-only posting if there's a consensus to do that. It might be inconvenient in that you have to post from the same account that you read Haskell mail from though, and I know some people have separate email accounts just for receiving Haskell mail. What do people think? Also, what do people think about the volume of Conference-related announcements sent to the list (haskell(a)haskell.org in particular)? Most of these get caught by the filter, and I tend to disallow only those that have no connection to programming language research at all. This could be tightened to Haskell-related or functional programming-related conferences only. Cheers, Simon

1 0

RE: GUI Library Task Force
by Simon Marlow 27 Sep '01

27 Sep '01

> Great. So that is something that goes into some library conventions > document. Such a document is here: http://www.haskell.org/~simonmar/libraries/libraries.html If there are comments on the design (which is by no means finalised), please take them to the libraries mailing list. Cheers, Simon

1 0