April 2004 - Haskell - Haskell.org

APLAS'04: Second Call For Papers
by QIN Shengchao 30 Apr '04

30 Apr '04

CALL FOR PAPERS The Second ASIAN Symposium on Programming Languages and Systems (APLAS 2004) Taipei, Taiwan, November 4-6 2004 http://www.comp.nus.edu.sg/~aplas (co-located with ATVA 2004 in Taipei) [Apologies if you received multiple copies] APLAS aims at stimulating programming language research by providing a forum for the presentation of recent results and the exchange of ideas and experience in topics concerned with programming languages and systems. APLAS is based in Asia, but is an international forum that serves the worldwide programming languages community. The APLAS series is sponsored by the Asian Association for Foundation of Software (AAFS), which has recently been founded by Asian researchers in cooperation with many researchers from Europe and the USA. The first formal APLAS symposium was successfully held in Beijing in November 2003, after three informal workshops held in Singapore (2000), Daejeon (2001), and Shanghai (2002). TOPICS The symposium is devoted to both foundational and practical issues in programming languages and systems. Papers are solicited on, but not limited, to the following topics: * semantics and theoretical foundations * type systems and language design * language interpreters and compilers * program analysis, optimization and transformation * models and tools for parallel and distributed systems * language support for security and safety * domain-specific languages and systems * storage management techniques * software development methods and systems * techniques for embedded and mobile code * process algebra and concurrency Original results that bear on these and related topics are solicited. Papers investigating novel uses and applications of language systems are especially encouraged. Authors concerned about the appropriateness of a topic are welcome to consult with the program chair (chinwn(a)comp.nus.edu.sg) prior to submission. GENERAL CHAIR D. T. Lee (Academia Sinica, Taiwan) PROGRAM CHAIR Wei-Ngan Chin (National Univ. of Singapore) PROGRAM COMMITTEE Jifeng He (United Nations Univ, Macau) Thomas Henzinger (Univ. of California, Berkeley, USA) Yuh-Jzer Joung (National Taiwan Univ, Taiwan) Gabriele Keller (Univ. of New South Wales, Australia) Jenq Kuen Lee (National Tsinghua Univ, Taiwan) Luc Maranget (INRIA, France) Hidehiko Masuhara (Univ. of Tokyo, Japan) Luke Ong (Univ. of Oxford, UK) Tamiya Onodera (IBM Research, Japan) Zongyan Qiu (Peking Univ., China) Martin Rinard (MIT, USA) David Sands (Chalmers Univ. of Tech., Sweden) Akihiko Takano (Natl. Inst. of Informatics, Japan) Kazunori Ueda (Waseda Univ., Japan) Chengyong Wu (Chinese Academy of Sc., China) Hongwei Xi (Boston Univ., USA) Kwangkeun Yi (Seoul National Univ., Korea) LOCAL ARRANGEMENT Tyng-Ruey Chuang (Academia Sinica, Taiwan) PUBLICITY Shengchao Qin (National Univ. of Singapore) SUBMISSIONS INFORMATION Papers should be submitted electronically online via the conference submission webpage. Acceptable formats are PostScript or PDF, viewable by gv. Submissions should not exceed 15 pages in LNCS format, excluding bibliography and figures. Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should clearly identify what has been accomplished and why it is significant. The work described should not have been previously published in a journal and conference proceedings. Authors must indicate if a closely related paper is also being considered for another conference or journal. The proceedings of the symposium will be published by Springer-Verlag's Lecture Notes in Computer Science series. IMPORTANT DATES Abstract & Title: May 29, 2004 Full Paper Submissions: June 5, 2004 Notifications of Acceptance: July 31, 2004 Camera Ready: August 25, 2004

1 0

RE: [Haskell] Re: sizeFM type
by Simon Marlow 28 Apr '04

28 Apr '04

On 26 April 2004 19:45, Don Groves wrote: > Hello, Haskell newbie here. > > Some languages handle the Int/Integer question automatically, > determined by the size of the integer in question. Int is used > until the integer excedes what the underlying architecture can > handle, then the switch is made to Integer (bignum). Is this > something that could be handled similarly by the Haskell compiler > without violating anything? Just thinking out loud... This is exactly how GHC implements Integer, FWIW. Cheers, Simon

1 0

CoLoPS04: Call for Papers
by Frank D. Valencia 28 Apr '04

28 Apr '04

[[ -- Apologies for multiple copies of this message -- ]] =================================================================== CoLoPS 2004 International Workshop on COnstraint & LOgic Programming in Security December 5-11th, 2004 - Saint-Malo, France Satellite Workshop to ICLP 2004 ==================================================================== Scope of the workshop: Due to its practical relevance and complexity, the study of security has become a serious challenge involving several disciplines of computer science. A noteworthy aspect is that in several instances this study has used directly or indirectly tools and techniques from (Concurrent) Constraint Programming and (Linear) Logic Programming. For example, constraint solving has successfully been used for verifying security protocols, and several process algebras for modelling cryptographic protocols (e.g., recent variants of the spi calculus, SPL) have remarkable similarities with Concurrent Constraint Programming. Also (Linear) Logic Programming has been used as a framework for security protocols, and one of its central notions, unification, has been used for the symbolic execution of cryptographic calculi. CoLoPS aims at getting a broader perspective on the role of Constraint and Logic Programming in the study of security. Topics of interest include (but are not restricted to) frameworks for security using algorithms, verification techniques, process algebras or programming languages, with a Constraint or Logic Programming flavor. Submission and publication: Paper submissions should not exceed 15 pages. Submissions should be sent as a PDF or Postscript le via email to Frank D. Valencia (frankv(a)it.uu.se) The email should have: 1. "COLOPS Submission" as subject, 2. submission title and authors' relevant information as body, and 3. submission le as an attachment. The accepted papers will be included in the workshop proceedings as a research report of Uppsala University. Accepted papers will be published in an ENTCS (Electronic Notes in Theoretical Computer Science) volume dedicated to ICLP 2004 workshops. Papers describing ongoing work or already published are also welcome but will not be part of the proceedings. Please mark your paper accordingly. Program Committee: Elvira Albert (UC Madrid, Spain) Maria Alpulente (UP Valencia, Spain) Stefano Bistarelli (ITT-CNR, Italy) Martin Leucker (TU Munich, Germany) Sebastian Moedersheim (ETH Zurich, Switzerland) Ugo Montanari (Universita di Pisa, Italy) Catuscia Palamidessi (INRIA, France) Justin Pearson (Uppsala University, Sweden) Fred Spiessens (Universit e catholique de Louvain, Belgium) Frank D. Valencia (Uppsala University, Sweden) Pascal Van Hentenryck (Brown University, USA) Vijay Saraswat (IBM, USA) Bjorn Victor (Uppsala University, Sweden) Alicia Villanueva (UP Valencia, Spain) Organizing Committee: Martin Leucker (TU Munich, Germany), Justin Pearson (Uppsala University, Sweden), Fred Spiessens (Universit e catholique de Louvain, Belgium), Frank D. Valencia (Uppsala University, Sweden) Important dates: Submission deadline: June 27, 2004 Notification of acceptance: July 18, 2004 Final version: August 15, 2004 Workshop: September 5th or 11th, 2004 (Dependent on ICLP organizers) For more and up-to-date information see the www page http://www.info.ucl.ac.be/people/fsp/colops2004/

1 0

2004 ICFP Programming Contest Announcement
by Nate Foster 27 Apr '04

27 Apr '04

The Seventh Annual ICFP PROGRAMMING CONTEST 4 June - 7 June 2004 http://icfpcontest.org/ Convinced your favorite programming language provides unbeatable productivity? Convinced you and your friends are world-class programmers? If so, we're providing you the opportunity to prove it! We are pleased to announce the Seventh ICFP Programming Contest to be held in conjunction with the 2004 International Conference on Functional Programming (ICFP 2004). All programmers are invited to enter the contest, either individually or in teams; we especially encourage students to enter. You may use any programming language (or combination of languages) to show your skill. On Friday, 4 June 2004 at 12:00 Noon (EDT), we will publish a challenge task on the Web site and by e-mail to the contest mailing list. Teams will have 72 hours until Monday, 7 June 2004, 12:00 Noon (EDT) to implement a program to perform this task and submit it to the contest judges. We have designed the contest for direct, head-to-head comparison of language technology and programming skill. We have a range of prizes including cash awards and, of course, unlimited bragging rights for the winners. For more information about the contest, prizes, and registration, point your browser to the contest website. - 2004 ICFP Contest Team http://icfpcontest.org/

1 0

LOPSTR'04 call for papers (extended deadlines!)
by Sandro Etalle 27 Apr '04

27 Apr '04

LOPSTR 2004 Verona, Italy, August 26-28, 2004 http://www.sci.univr.it/~lopstr04 CALL FOR PAPERS ***EXTENDED DEADLINE*** The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development, and the workshop is open to contributions in logic-based program development in any language paradigm. Starting this year, LOPSTR will put extra emphasis to the field of verification; in fact LOPSTR will also incorporate the VCL (verification in computational logic) workshop series. LOPSTR'04 will be held at the University of Verona http://www.univr.it co-located with SAS 2004 http://www.sci.univr.it/~sas04, the International Static Analysis Symposium, PEPM 2004 http://www.sci.univr.it/~pepm04 - ACM SIGPLAN 2004 Workshop on Partial Evaluation and Semantics Based Program Manipulation, and PPDP 2004 http://www.sci.univr.it/~ppdp04 - 6th ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming. Past workshops were held in Manchester, UK (1991, 1992, 1998), Louvain-la-Neuve, Belgium (1993), Pisa, Italy (1994), Arnhem, the Netherlands (1995), Stockholm, Sweden (1996), Leuven, Belgium (1997), Venice, Italy (1999), London, UK (2000), Paphos, Cyprus (2001), Madrid, Spain (2002), Uppsala, Sweden (2003). Since 1994 the proceedings have been published in the LNCS series of Springer-Verlag. LOPSTR also aims to be a lively, friendly forum for presenting and discussing work in progress, so it is a real workshop in the sense that it is also intended to provide useful feedback to authors on their preliminary research. Formal proceedings of the workshop are produced only after the workshop, so that authors can incorporate this feedback in the published papers. Scope of the Workshop We solicit extended abstracts and full papers. Topics of interest cover all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming-in-the-small and programming-in-the-large. The following is a non-exhaustive list of topics: * specification * synthesis * verification * transformation * specialisation * analysis * optimisation * composition * reuse * applications and tools * proofs as programs * component-based software development * agent-based software development * software architectures * design patterns and frameworks * program refinement and logics for refinement Submission Guidelines Authors can either submit extended abstracts (short papers) describing work in progress or they can choose to submit full papers. Contributions should be written in English and should be submitted electronically in Postscript or PDF format at http://profs.sci.univr.it/~lopstr04/index.html. Authors are also asked to send the title and abstract of their submission three days before the deadline to lopstr04(a)sci.univr.it. Prospective authors who have difficulties for the electronic submission may contact the chairman at lopstr04(a)sci.univr.it. Extended abstracts should not exceed 6 pages in llncs format and may describe work in progress. Promising abstracts relevant to the scope of LOPSTR will be selected for presentation at the workshop. The submission deadline for extended abstract is May 17, 2004 (extended, strict). Full papers should not exceed 16 pages (including references) in llncs format. These papers will be judged using ordinary conference quality criteria and accepted papers will have to be presented at the workshop and will automatically appear in the pre-proceedings as well as in the final collection of papers, published in the LNCS series. The submission deadline for full papers is May 7, 2004 (extended, strict). Accepted papers and abstracts will be collected in informal pre-proceedings which will be available at the workshop. After the workshop, authors of extended abstract which are judged mature for publication will be invited to submit full papers. These will be reviewed according to the usual refereeing procedures, and accepted papers will be published in the final collection of papers (together with the accepted full papers) which is expected to be published in the Lecture Notes in Computer Science series by Springer-Verlag. All the full papers accepted before the workshop will automatically appear in that book as well; there will be no additional refereeing (although authors will be given a chance to revise their paper, if they so wish, based upon the feedback from the LOPSTR event). Program Committee * Annalisa Bossi (Italy) * Gilles Barthe (France) * Francisco Bueno (Spain) * Maurice Bruynooghe (Belgium) * Giorgio Delzanno (Italy) * Sandro Etalle (The Netherlands) program chair * Tom Ellman (USA) * Patricia M. Hill (UK) * Norbert Fuchs (Switzerland) * Gopal Gupta (USA) * Kung-Kiu Lau (UK) * Fabio Martinelli (Italy) * Alberto Pettorossi (Italy) * Andreas Podelski (Germany) * Abhik Roychoudhury (Singapore) * C.R. Ramakrishnan (USA) * Wim Vanhoof (Belgium) * German Vidal (Spain) Important dates * submission deadline for full papers: May 7, 2004 (extended, strict) * submission deadline for extended abstracts: May 17, 2004 (extended, strict) * Notification: June 6 * Camera-ready: June 16 Sponsor Lopstr 2004 is sponsored by the Association for Logic Programming (ALP) http::/www.cwi.nl/projects/alp

1 0

Re: sizeFM type
by Serge D. Mechveliani 27 Apr '04

27 Apr '04

Alexander is right. Also as Integer has more sense than Int, I would suggest for the future standard Haskell library to have Integer as default. For example: length :: [a] -> Integer smallLength :: [a] -> Int ----------------- Serge Mechveliani mechvel(a)botik.ru On Sun, Apr 25, 2004 at 03:18:20PM -0400, S. Alexander Jacobson wrote: > >[..] > Dell's Poweredge servers address up to 32GB of > memory today! There are already 5.7 billion > people on the planet (>2^31) and 741 million phone > lines. In my mind, there is NO QUESTION that 2^31 > keys is a reasonable size for a FiniteMap or will > be in the very very near future. > > Moreover, it is not clear that the CPU/memory > overhead of returning Integer rather than Int for > sizeFM is sufficiently high to be worth bothering > the programmer about. On Sun, 2004-04-25 Serge D. Mechveliani wrote to glasgow-haskell-users > > > Dear GHC developers, > > > > > > Probably, it is better to provide Integer > > > or Integral a => a > > > instead of Int > > > in the function > > > sizeFM :: FiniteMap k e -> Int

12 18

4 Vacancies at St Andrews
by Kevin Hammond 27 Apr '04

27 Apr '04

A reminder that the deadline for application is tomorrow, 28th April. We have two chairs and two lectureships open to the best candidates. I would welcome some good functional programmers, of course, and am happy to answer any questions! Further details are found at http://www.dcs.st-andrews.ac.uk/news/jobs.php Application forms are available at http://www.st-andrews.ac.uk/hr/recruitment/vacancies Best Wishes, Kevin

1 0

RE: [Haskell] Re: sizeFM type
by Simon Peyton-Jones 27 Apr '04

27 Apr '04

Could we move this debate to Haskell-café? Simon | -----Original Message----- | From: haskell-bounces(a)haskell.org [mailto:haskell-bounces@haskell.org] On Behalf Of Serge D. | Mechveliani | Sent: 27 April 2004 05:49 | To: Ketil Malde | Cc: haskell(a)haskell.org | Subject: Re: [Haskell] Re: sizeFM type | | On Mon, Apr 26, 2004 at 10:09:18PM +0200, Ketil Malde wrote: | > "Serge D. Mechveliani" <mechvel(a)botik.ru> writes: | > | > > Alexander is right. | > > | > > Also as Integer has more sense than Int, | > > I would suggest for the future standard Haskell library to have | > > Integer as default. For example: | > > length :: [a] -> Integer | > > smallLength :: [a] -> Int | > | > Hmm...isn't it possible to use a class here? Perhaps even Num? | > | > class Num a where .... | > : | > length :: [b] -> a | > : | > | | I think, for many functions, like length, it is most natural to | return Integer only. | And it is also natural for many instances (domains) D to provide | maps like toInteger, fromInteger. | Just follow mathematics. | | Example: length xs :: (Rational, Rational) | looks unnatural, | but fromInteger (length xs) :: (Rational, Rational) | looks natural. | | ----------------- | Serge Mechveliani | mechvel(a)botik.ru | | | _______________________________________________ | Haskell mailing list | Haskell(a)haskell.org | http://www.haskell.org/mailman/listinfo/haskell

1 0

ANNOUNCE: GHC version 6.2.1
by Simon Marlow 26 Apr '04

26 Apr '04

============================================================ The (Interactive) Glasgow Haskell Compiler -- version 6.2.1 ============================================================ We are pleased to announce a new patchlevel release of the Glasgow Haskell Compiler (GHC), version 6.2.1. As usual for patchlevel releases, this is mainly a bugfix release and should not break any code that was working with the previous major release (6.2). We did sneak a couple of new features into the compiler: - The "threaded runtime system" is included by default. To link a program with this variant of the RTS, add the -threaded option when linking. The main advantage of the threaded RTS is that it allows calls to foreign functions which block, while allowing other concurrent Haskell threads to continue running. - A debugging variant of the RTS is also included. Use -debug when linking to get it. The debugging RTS includes lots of sanity checking and has some extra options for producing debugging output while your Haskell program is running. How to get it ~~~~~~~~~~~~~ The easy way is to go to the WWW page, which should be self-explanatory: http://www.haskell.org/ghc/ We supply binary builds in the native package format for various flavours of Linux and BSD, and in Windows Installer (MSI) form for Windows folks. Binary builds for other platforms are available as a .tar.gz which can be installed wherever you want. The source distribution is also available from the same place. Packages will appear as they are built - if the package for your system isn't available yet, please try again later. Background ~~~~~~~~~~ Haskell is a standard lazy functional programming language; the current language version is Haskell 98, agreed in December 1998 and revised December 2002. GHC is a state-of-the-art programming suite for Haskell. Included is an optimising compiler generating good code for a variety of platforms, together with an interactive system for convenient, quick development. The distribution includes space and time profiling facilities, a large collection of libraries, and support for various language extensions, including concurrency, exceptions, and foreign language interfaces (C, whatever). GHC is distributed under a BSD-style open source license. A wide variety of Haskell related resources (tutorials, libraries, specifications, documentation, compilers, interpreters, references, contact information, links to research groups) are available from the Haskell home page (see below). On-line GHC-related resources ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Relevant URLs on the World-Wide Web: GHC home page http://www.haskell.org/ghc/ Haskell home page http://www.haskell.org/ comp.lang.functional FAQ http://www.cs.nott.ac.uk/~gmh/faq.html System requirements ~~~~~~~~~~~~~~~~~~~ To compile programs with GHC, you need a machine with 64+MB memory, GCC and perl. This release is known to work on the following platforms: * i386-unknown-{linux,*bsd,mingw32} * sparc-sun-solaris2 * alpha-dec-osf3 * powerpc-apple-darwin (MacOS/X) Ports to the following platforms should be relatively easy (for a wunderhacker), but haven't been tested due to lack of time/hardware: * hppa1.1-hp-hpux{9,10} * i386-unknown-solaris2 * mips-sgi-irix{5,6} * {rs6000,powerpc}-ibm-aix The builder's guide on the web site gives a complete run-down of what ports work; it can be found at http://www.haskell.org/ghc/docs/latest/html/building/building-guide.html Mailing lists ~~~~~~~~~~~~~ We run mailing lists for GHC users and bug reports; to subscribe, use the web interfaces at http://www.haskell.org/mailman/listinfo/glasgow-haskell-users http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs There are several other haskell and ghc-related mailing lists on www.haskell.org; for the full list, see http://www.haskell.org/mailman/listinfo/ Please report bugs using our SourceForge page at http://sourceforge.net/projects/ghc/ or send them to glasgow-haskell-bugs(a)haskell.org. GHC users hang out on glasgow-haskell-users(a)haskell.org. Bleeding edge CVS users party on cvs-ghc(a)haskell.org.

3 2

RE: [Haskell] Why is newChan in the IO Monad?
by Nick Benton 26 Apr '04

26 Apr '04

Channels have identity, so allocating a new one is a side effecting operation. Having it outside the IO monad would require (for example): (newChan, newChan) = (let x = newChan in (x,x)) which is wrong. If you wrap newChan in unsafePerformIO then the compiler will feel free to apply rewrites like the above, which is unlikely to be what you wanted. Nick -----Original Message----- From: haskell-bounces(a)haskell.org [mailto:haskell-bounces@haskell.org] On Behalf Of S. Alexander Jacobson Sent: 23 April 2004 19:22 To: Haskell Mailing List Subject: [Haskell] Why is newChan in the IO Monad? Nothing actually happens when newChan is called except construction of a new datastructure. It would be nice to have non IO monad code be able to create a new Chan that gets passed to IO code that uses it somewhere else. Alternatively, is there a way to create a Chan outside the IO monad? -Alex- _________________________________________________________________ S. Alexander Jacobson mailto:me@alexjacobson.com tel:917-770-6565 http://alexjacobson.com _______________________________________________ Haskell mailing list Haskell(a)haskell.org http://www.haskell.org/mailman/listinfo/haskell

4 3