- Haskell - Haskell.org

ICALP 2006 -- Call For Workshop Proposals
by Convegno ICALP '06 11 Nov '05

11 Nov '05

***** Apologies for multiple copies ***** 33rd International Colloquium on Automata, Languages and Programming ICALP 2006 S. Servolo, Venice - Italy Call for Affiliated Workshops Conference Dates: July 10-14, 2006 Affiliated Workshop Dates: July 9, 15, and 16, 2006 Researchers and practitioners are invited to submit proposals for workshops on topics related the conference tracks, namely: Algorithms, Automata, Complexity and Games (track A); Logic, Semantics, and Theory of Programming (track B); and Security and Cryptography Foundations (special track C). The purpose of the workshops is to provide participants a forum for presenting novel ideas and for discussing in a small and interactive atmosphere. The main responsibility of organising a workshop goes to the chairperson of the workshop. The format of each workshop is determined by its organisers. The workshop proposals will be selected by the ICALP organization, under advice of the ICALP PC chairs and EATCS. Proposals should include: * Name and duration (from half a day to two days) of the proposed workshop. * A short scientific summary of the topic, including a discussion on the relation with the ICALP topics. * A description of past versions of the workshop, including dates, organisers, submission and acceptance counts, attendance. * Procedures for selecting participants and papers, and expected number of participants. * Plans for dissemination (for example, published proceedings or special issues of journals). IMPORTANT DATES: November 27, 2005: Deadline for submitting workshop proposals December 16, 2005: Notification of acceptance Workshop proposals must be submitted in plain text, PDF or Postscript format by e-mail to icalp06(a)dsi.unive.it For further information consult the ICALP 2006 web site: http://icalp06.dsi.unive.it/ or contact the ICALP 2006 Workshops Chairs: - Andrea Pietracaprina <andrea.pietracaprina(a)unipd.it> - Francesco Ranzato <francesco.ranzato(a)unipd.it> - Sabina Rossi <srossi(a)dsi.unive.it>

1 0

Non-Copyleft Haskell SOAP/WSDL library?
by Ashley Yakeley 11 Nov '05

11 Nov '05

Does anyone know of a non-copyleft open-source SOAP/WSDL library for Haskell? HAIFA is GPL apparently. Something like the usual BSD license would be perfect. -- Ashley Yakeley, Seattle WA

1 0

Haskell users survey--please respond!
by John Hughes 10 Nov '05

10 Nov '05

I'm conducting a web-based survey of Haskell users to gather material for an article on the history of Haskell, and I need your help. I want to stress that I'm interested in responses from ALL users--if you're a complete beginner writing your first Haskell programs on a course, I'd like to know that, just as if you're one of the designers using it for your next POPL article. If I'm to get an accurate picture of how Haskell is used today, I need responses from as many users as possible. The survey consists of eight multiple-choice questions, and should only take a minute or so to complete. Please help by doing so! As a reward, you'll get to see a summary of the responses so far. The survey is at this URL: http://www.cs.chalmers.se/~rjmh/Wash/Survey/Survey.cgi Thanks for your help! I'll post a summary of the results to the list. John Hughes

11 27

why I need so much memory????
by Alberto Fuentes Rodriguez 10 Nov '05

10 Nov '05

Hi, I am trying to make a program to generate all the poker hands. I have done it yet and it only need a few of seconds. Each card is represented with a Char (to make the structure smaller) and then all the hands are a [[Char]] in total the structure has a size of arround 20Mb. Now I like be sure that I have all the hands and that they are not repeated. To do that I have done the next function: isRepeated :: Eq a => [a] -> Bool isRepeated [] = False isRepeated (p:r) = (any (\x -> x == p) r) || isRepeated r I call it with a [[Char]] of 2598960 elements and each element with 5 Characters. Ok the complexity is high but.... why this program needs 1GB (the structure only has 20MB) of memory?? The problem is that it begins to use the swap zone and due to that It can only use the 10% of the processor. I have compiled with the latest version of GHC (ghc --make -C ppal.hs). I attach you the source files (the backtr works well) and the map memory of the process. Alberto Fuentes _________________________________________________________________ Un amor, una aventura, compañía para un viaje. Regístrate gratis en MSN Amor & Amistad. http://match.msn.es/match/mt.cfm?pg=channel&tcid=162349

4 3

CFP: European Conference on Logics in AI [JELIA'06]
by Michael Fisher 10 Nov '05

10 Nov '05

+---------------------------------------------------------------+ | ***** CALL FOR PAPERS ***** | | ****** JELIA'06 ****** | | --------------------------- | | 10th European Conference on Logics in Artificial Intelligence | | Liverpool, U.K., September 13-15, 2006 | | http://www.csc.liv.ac.uk/~jelia | | | | ----> Submission deadline: 1st May 2006 <---- | +---------------------------------------------------------------+ JELIA'06 will bring together researchers interested in all aspects concerning the use of logics in AI to discuss current research, results, problems and applications of both a theoretical and practical nature. Authors are invited to submit papers presenting original and unpublished research in all areas related to the use of Logics in AI. Proceedings will be published by Springer-Verlag in the Lecture Notes on Artificial Intelligence series. All submissions must be received (in PS or PDF only) by 1st May, 2006, and should be submitted via the form available at the JELIA-06 web page. Papers should be written in English, and should be formatted according to the Springer LNCS style (with standard margins). There are two categories of submission: A. Regular papers. Submissions should not exceed 13 pages including figures, references, etc., and should contain original research, and sufficient detail to assess the merits and relevance of the contribution. B. Tool descriptions. Submissions should not exceed 4 pages, and should describe the implemented tool and its novel features. A demonstration is expected to accompany a tool presentation. IMPORTANT DATES Deadline for submission: 1st May, 2006 Notification of acceptance: 8th June, 2006 Camera Ready Copy: 26th June, 2006 For further details, including lists of Conference Officials and Programme Committee, see http://www.csc.liv.ac.uk/~jelia Send your questions and comments to jelia06(a)csc.liv.ac.uk -------------------------------------------------------------------- ---------------------------------------------------------------- This message was sent using IMP, the Internet Messaging Program.

1 0

Haskell Weekly News: November 8, 2005
by John Goerzen 08 Nov '05

08 Nov '05

Haskell Weekly News: November 8, 2005 Greetings, and thanks for reading the 14th issue of HWN, a weekly newsletter for the Haskell community. Each Tuesday, new editions will be posted (as text) to [1]the Haskell mailing list and (as HTML) to [2]The Haskell Sequence. 1. http://www.haskell.org/mailman/listinfo/haskell 2. http://sequence.complete.org/ New Releases * Haskell-mode 2.1. Stefan Monnier recently [3]released version 2.1 of his haskell editing mode for Emacs. 3. http://article.gmane.org/gmane.comp.lang.haskell.general/12445 * Gtk2hs 0.9.10. Duncan Coutts announced that the latest version of the GTK bindings for Haskell is now [4]available. Major new features include the Cairo vector graphics library bindings, Pango text layout code, new Gtk+ 2.8 APIs, and a Windows installer. 4. http://article.gmane.org/gmane.comp.lang.haskell.general/12436 * Frown 0.6. Ralf Hinze [5]announced the first release of Frown, a LALR(k) parser generator for Haskell. Frown has a number of interesting features and is considered beta-quality at this time. 5. http://article.gmane.org/gmane.comp.lang.haskell.general/12403 * network-alt 0.3 and hsgnutls 0.2.1. Einar Karttunen [6]announced the availability of new versions of these two libraries. network-alt is an alternative networking library designed to have a nicer API and better performance. hsgnutls is a TLS/SSL layer atop the GNU TLS library, supporting both client and server applications. 6. http://thread.gmane.org/gmane.comp.lang.haskell.libraries/3904 Calls for Participation Top 10 articles. Kenneth Hoste posted a [7]request for people to contribute articles about various Haskell subjects. Each article will list the 10 most famous or frequently used things about that particular subject, and will be posted through The Monad.Reader. 7. http://article.gmane.org/gmane.comp.lang.haskell.cafe/9050 Discussion Time libraries. Ashley Yakeley started a lively [8]thread about time libraries in Haskell. 8. http://thread.gmane.org/gmane.comp.lang.haskell.libraries/3882 Conferences Haskell Workshop Steering Committee. Johan Jeuring [9]announced that ACM SIGPLAN has approved a Haskell Workshop Steering Committee to offer help and advice to the organizers of the workshop. 9. http://article.gmane.org/gmane.comp.lang.haskell.cafe/8975 Darcs Corner Darcs 1.0.4rc2 is out. David Roundy [10]announced the release of Darcs 1.0.4rc2, the second and hopefully last candidate before the 1.0.4 release. 10. http://thread.gmane.org/gmane.comp.version-control.darcs.user/8620 About Haskell Weekly News Want to continue reading HWN? Please help us create new editions of this newsletter. Please see the [11]contributing information, or send stories to hwn -at- complete -dot- org. There is also a Darcs repository available. 11. http://sequence.complete.org/hwn-contrib

1 0

RTA'06: 1st Call for Papers
by Ralf Treinen 08 Nov '05

08 Nov '05

************************************ * * * RTA'06 FIRST CALL FOR PAPERS * * * ************************************ http://rta06.csl.sri.com/ Seattle, WA, USA August 12-14, 2006 Affiliated workshops Aug 11 & 15 The 17th International Conference on Rewriting Techniques and Applications (RTA'06) is organized as part of the Federated Logic Conference (FLoC), collocated with CAV, ICLP, IJCAR, LICS, SAT, and several affiliated workshops. IMPORTANT DATES: Feb 15, 2006: Deadline for electronic submission of title and abstract Feb 22, 2006: Deadline for electronic submission of papers May 01, 2006: Notification of acceptance of papers Jun 01, 2006: Deadline for final versions of accepted papers RTA is the major forum for the presentation of research on all aspects of rewriting. Typical areas of interest include (but are not limited to): * Applications: case studies; rule-based (functional and logic) programming; symbolic and algebraic computation; theorem proving; system synthesis and verification; proof checking; reasoning about programming languages and logics; * Foundations: matching and unification; narrowing; completion techniques; strategies; constraint solving; explicit substitutions; tree automata; termination; * Frameworks: string, term, graph, and proof rewriting; lambda-calculus and higher-order rewriting; proof nets; constrained rewriting/deduction; categorical and infinitary rewriting; * Implementation: compilation techniques; parallel execution; rewrite tools; termination checking; * Semantics: equational logic; rewriting logic. The following workshops are affiliated with RTA'06: * HOR'06: 3rd International Workshop on Higher-Order Rewriting * RULE'06: 7th International Workshop on Rule-Based Programming * UNIF'06: 20th International Workshop on Unification * WG1.6: Annual meeting of the IFIP Working Group 1.6 on Term Rewriting. * WRS'06: 6th International Workshop on Reduction Strategies in Rewriting and Programming * WST'06: 8th International Workshop on Termination Please refer to the RTA'06 web site for further information on the workshops. INVITED SPEAKERS: Randy Bryant will be the joint plenary speaker of LICS, RTA and SAT. More RTA invited speakers will be announced later. BEST PAPER AWARDS AND TRAVEL GRANTS: An award is given to the best paper or papers as decided by the program committee. A limited number of travel grants may be available for students who are (co-)authors of RTA-papers. To apply for grants, students should send an e-mail to the PC chair together with their submission. RTA'06 PROGRAM COMMITTEE CHAIR: * Frank Pfenning, Carnegie Mellon University RTA'06 PROGRAM COMMITTEE: * Zena Ariola, University of Oregon * Franz Baader, Technical University Dresden * Gilles Dowek, Ecole Polytechnique and INRIA * Guillem Godoy, Technical University of Catalonia * Deepak Kapur, University of New Mexico * Delia Kesner, University Paris 7 * Denis Lugiez, University of Provence * Claude Marche, University Paris-Sud * Jose Meseguer, University of Illinois at Urbana-Champaign * Frank Pfenning, Carnegie Mellon University (Chair) * Ashish Tiwari, SRI International * Yoshihito Toyama, Tohoku University * Eelco Visser, Utrecht University * Hans Zantema, Eindhoven University of Technology RTA'06 CONFERENCE CHAIR: * Ashish Tiwari, SRI International RTA'06 SUBMISSIONS: Submissions must be original and not submitted for publication elsewhere. Submission categories include regular research papers and system descriptions. Problem sets and submissions describing interesting applications of rewriting techniques are also welcome. The page limit for submissions is 15 pages in Springer Verlag LNCS style (10 pages for system descriptions). Please consult http://rta06.csl.sri.com/ for further instructions. LOCATION, TRAVEL, ACCOMMODATION, AND REGISTRATION: RTA'06 will be part of the 2006 Federated Logic Conference (FLoC 2006) which will be held August 10-22, 2006, at the Seattle Sheraton Hotel and Towers, in Seattle, Washington state, USA. Further information will be made available at the FLoC 2006 home page http://research.microsoft.com/floc06/index.htm.

1 0

Re: lambda calculus theory
by Marc A. Ziegert 07 Nov '05

07 Nov '05

(this duplicates that inquiry from glasgow-haskell-users@ to haskell@) Am Sonntag, 6. November 2005 15:53 schrieb Hans N Beck: > Hi, > > I'm searching for a good mathematical oriented introduction to the > theory of lambda calculus or other theoretical foundations of Lisp/ > Haskell, i.e. monads or such (of course in the web there are much > hints, but what is the best for mathematicans foreign to this field) > > Regards > > Hans > _______________________________________________ > Glasgow-haskell-users mailing list > Glasgow-haskell-users(a)haskell.org > http://www.haskell.org/mailman/listinfo/glasgow-haskell-users > > Hi Hans, i'm searching for such lectures/papers/scripts, too. well, untill there is a better answer, i send you some links, which i think could be interesting to you. the first real mathematical definition of "monad", i read, was in the paper "The essence of dataflow programming". i approve to not omit that paper, if you like both, haskell and that theory. beside that, i attended a german lecture about Algebraic Topology. one chapter was about cathegory theory. it was not that much, but interesting. lambda: <http://en.wikipedia.org/wiki/Lambda_calculus> (<http://de.wikipedia.org/wiki/Lambda-Kalk%C3%BCl>) very interesting is the "typed lambda calculus", which allows effective bug-prevention, which you do not have in most variants of lisp (or lisp's derivatives) but in haskell. functor: <http://haskell.org/hawiki/CategoryTheory_2fFunctor> monad: there is a mathematical definition in the paper "The essence of dataflow programming", see 'comonad:' below. cathegory theory: <http://haskell.org/hawiki/CategoryTheory> <http://haskell.org/hawiki/CategoryTheory_2fPapers> <http://en.wikipedia.org/wiki/List_of_category_theory_topics> <http://www.eyrie.org/~zednenem/2004/hsce/> arrow: <http://www.haskell.org/arrows/> <http://www.soi.city.ac.uk/~ross/papers/fop.html> comonad: <http://comments.gmane.org/gmane.comp.lang.haskell.general/12171> beside these links, do not abstain from reading parts of the haskell library. (Data.Maybe, Data.Monoid, Control.Monad, Data.FunctorM, Control.Arrow) <http://www.haskell.org/ghc/docs/latest/html/libraries/> - marc

4 3

Haskell-mode 2.1
by Stefan Monnier 07 Nov '05

07 Nov '05

Haskell-mode 2.0 is now almost a year old, so I thought it was time to make a new release. You can find it at http://www-perso.iro.umontreal.ca/~monnier/elisp/ This release has few visible changes. Most of the changes are in the haskell-indent module. Those changes have not been heavily tested, buyer beware: you get what you pay for.The intention is to make indentation work better, but it's not always easy to guarantee forward progress. Some of the changes have to do with making sure that the correct indentation is among the provided indentation points (e.g. the `let' without `in' in the `do' notation) while others try to trim the number of indentation points (e.g. `in' has only one possible indentation point), and yet others allow finer control (e.g. the haskell-indent-after-keywords variable which allows to indent each branch of a `case' (or `where') by some 2 spaces). Please report any unexpected behavior. See appended the NEWS file that describes some of the noteworthy changes. Stefan Changes since 2.0: * inf-haskell uses ghci if hugs is absent. * Fix up some binding conflicts (C-c C-o in haskell-doc) * Many (hopefully minor) changes to the indentation. * New symbols in haskell-font-lock-symbols-alist.

1 0

REMINDER: Proposals for workshops (ICFP '06) due this Friday!
by Matthias Blume 07 Nov '05

07 Nov '05

The deadline for workshop proposals is coming up on November 11, 2005. If you are planning to organize a workshop to be co-located with ICFP 2006, please, send us your proposal before the deadline expires! Many thanks, and kind regards, Matthias Blume ------------------------------------------------------------------------ ---- ICFP '06 CALL FOR WORKSHOP PROPOSALS The ICFP 2006 ACM SIGPLAN International Conference on Functional Programming will be held in Portland, Oregon from September 18 to September 20, 2006. Proposals for workshops are invited for consideration of ACM SIGPLAN sponsorship and affiliation with ICFP 2006. Affiliated workshops will be held on September 16 and 17 (as well as on September 21, if necessary). The purpose of these workshops is to provide a forum for presenting novel ideas in a less formal and possibly more focused way than at ICFP itself. They may also provide good opportunities for young researchers to present their work to, and to obtain feedback from, a specialized community. The format of each workshop is to be determined by its organizers, but it is expected that each workshop allows ample time for general discussion. The preference is for workshops which span only one day, but other schedules will also be considered. Researchers and practitioners are invited to submit workshop proposals to the ICFP 2006 Workshop Chairs, Matthias Blume and Patricia Johann, via e-mail (icfp06-workshops(a)cs.uchicago.edu) NO LATER THAN NOVEMBER 11, 2005. Submission may be made by e-mail (Postscript, PDF, or ASCII) with "ICFP06 Workshop Submission" in the subject header. Following ACM SIGPLAN's sponsorship procedures, proposals must include: 1. The name of the workshop. 2. A statement of goals for the workshop. 3. The names and addresses of the organizers. 4. The names of potential participants, such as program committee members. (It would be wise to inform your potential comittee members that they have been selected pending SIGPLAN approval.) 5. A description of plans for calls for participation (e.g., calls for papers). 6. The expected number of attendees and planned length of the workshop. 7. A description of plans for publicity. 8. An explanation of any plans for a published proceedings. 9. A description of past versions of the workshop, including dates, organizers, submission and acceptance counts, attendance, sites, registration fees and summary budget information. 10. The URL of the workshop web site. Note that should a proposal be accepted, a final report about the workshop, suitable for publication in SIGPLAN Notices, will be required. Notification of acceptance will be made by DECEMBER 15, 2005. Accepted workshops will be sponsored by SIGPLAN (see http://www.acm.org/sigplan/sigplan_workshop_proposal.htm for more information). A committee chaired by the ICFP 2006 Workshop Chairs and consisting of the ICFP Program and General Chairs and the SIGPLAN Executive Committee will evaluate all proposals. The workshop selection committee members are: * Matthias Blume, TTI-Chicago, Workshop co-Chair for ICFP 2006 * Patricia Johann, Rutgers University, Workshop co-Chair for ICFP 2006 * Julia Lawall, DIKU, Program Chair for ICFP 2006 * John Reppy, University of Chicago, General Chair for ICFP 2006 The maximum number of workshop proposals to be accepted is 6. Any further information needed for preparing a workshop proposal can be obtained by sending email to the workshop chairs (icfp06-workshops(a)cs.uchicago.edu) or consulting the ICFP 2006 web site at http://icfp06.cs.uchicago.edu/.

1 0