July 2006 - Haskell - Haskell.org

CFP: IEEE ICDM'06 Workshops
by Jia Hu 19 Jul '06

19 Jul '06

[Apologies if you receive this more than once] ================================================================== Call for Workshop Papers ICDM'06: The 6th IEEE International Conference on Data Mining Hong Kong Convention and Exhibition Centre, Hong Kong, China, 18-22 December 2006 Sponsored by the IEEE Computer Society http://www.comp.hkbu.edu.hk/iwi06/icdm/?index=workshop (Full Workshop Papers Due: 30 July 2006) Accepted papers will be published in the conference proceedings by the IEEE Computer Society Press that are indexed by EI. Note: we will not have a separate workshop registration fee this year (i.e., conference registration covers everything). =================================================================== As an important part of the conference, the workshop program will focus on new research challenges and initiatives. All papers accepted for workshops will be included in the Workshop Proceedings published by the IEEE Computer Society Press that are indexed by EI, which will be available at the workshops. ------------------- Accepted Workshops: ------------------- 1. ICDM 2006 Workshop on Ontology Mining and Knowledge Discovery from Semistructured Documents (http://sky.fit.qut.edu.au/~nayak/MSD06/overview.html) 2. ICDM 2006 Workshop on Data Mining in Bioinformatics (http://icdm06.biomap.org/) 3. ICDM 2006 Workshop on Mining Complex Data (http://eric.univ-lyon2.fr/~mcd06/) 4. ICDM 2006 Workshop on Mining Spatial and Spatio-temporal Data (http://www.cs.hku.hk/~nikos/sstdm06/) 5. ICDM 2006 Workshop on Foundation of Data Mining and Novel Techniques in High Dimensional Structural and Unstructured Data (http://www.cs.sjsu.edu/~tylin/ICDM06/index.html) 6. ICDM 2006 Workshop on Privacy Aspects of Data Mining (http://www-kdd.isti.cnr.it/padm06/) 7. ICDM 2006 Workshop on Data Mining for Design and Marketing (http://www2.ipcku.kansai-u.ac.jp/~yada/conf/dmdm06/) 8. ICDM 2006 Workshop on Mining Stream/Evolving Data (http://www.csse.monash.edu.au/~mgaber/iwmesd/) 9. ICDM 2006 Workshop on Risk Mining (http://www.med.shimane-u.ac.jp/med_info/risk_mining/cfp.html) 10. ICDM 2006 Workshop on Reliability Issues in Knowledge Discovery (http://www3.it.deakin.edu.au/~hdai/RIKD06/) 11. ICDM 2006 Workshop on Data Mining and Wireless Sensor Networks (http://cs.acadiau.ca/~shussain/dm-wsn/cfp.html) 12. ICDM 2006 Workshop on Optimization-based Data Mining Techniques with Applications (http://www.dtke.ac.cn/meeting/meeting_5.htm) Note: we will not have a separate workshop registration fee this year (i.e., conference registration covers everything). For more information, please visit the conference website at http://www.comp.hkbu.edu.hk/iwi06/icdm/?index=workshop. ++++++++++++++++++++++++++ Workshop Paper Submission ++++++++++++++++++++++++++ http://wi-lab.com/cyberchair/icdm06/scripts/ws_submit.php (Until Jul 30, 2006, 11.59pm *Pacific Daylight Time*.) *** Contact Information *** Yiuming Cheung Hong Kong Baptist University, HK E-mail: ymc(a)Comp.HKBU.Edu.HK

1 0

CFP: IEEE/WIC/ACM WI-IAT'06 Workshops
by Jia Hu 19 Jul '06

19 Jul '06

[Apologies if you receive this more than once] ============================================================== Call for Workshop Papers 2006 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT'06) Hong Kong Convention and Exhibition Centre, Hong Kong, China, 18-22 December 2006 http://www.comp.hkbu.edu.hk/iwi06/wi/?index=workshop or http://www.comp.hkbu.edu.hk/iwi06/iat/?index=workshop (Full Workshop Papers Due: 30 July 2006) Accepted papers will be published in the conference proceedings by the IEEE Computer Society Press that are indexed by EI. Note: we will not have a separate workshop registration fee this year (i.e., conference registration covers everything). =================================================================== As an important part of the conference, the workshop program will focus on new research challenges and initiatives. All papers accepted for workshops will be included in the Workshop Proceedings published by the IEEE Computer Society Press that are indexed by EI, and will be available at the workshops. Detailed information is available at the conference homepage. We will not have a separate workshop registration fee this year (i.e., conference registration covers everything). --------------------------------- I. Accepted as Fullday Workshops: --------------------------------- 1. International Workshop on Agent and Data Mining Interaction (ADMI) (http://datamining.it.uts.edu.au/iadm/about.php) 2. International Workshop on Web Privacy Intelligence (http://cusp.smu.ca/Workshop/) 3. International Workshop on Service Composition (http://events.deri.at/sercomp2006/) 4. The 3rd International Workshop on Web-based Support Systems (WSS'06) (http://www2.cs.uregina.ca/~wss/wss06/index.html) ---------------------------------- II. Accepted as Halfday Workshops: ---------------------------------- 5. International Workshop on Intelligent Agents in Wireless Sensor Networks (IA-WSN) (http://cs.acadiau.ca/~eshakshu/IA-WSN-2006.htm) 6. International Workshop on Adaptation and Personalisation for e-Business Intelligence (http://www.ru5.cti.gr/WI06/) 7. International Workshop on Semantics in VO and WS (http://www.dur.ac.uk/w.w.song/SVO&WS2006-main.html) 8. International Workshop on Communication between Human and Artificial Agents (http://www.cs.umanitoba.ca/~ckemke/IAT06Workshop/workshop.html) 9. International Workshop on Intelligent Web Interaction (IWI-2006) (http://ymd.ex.nii.ac.jp/ws/iwi/06/) 10. International Workshop on P2P Computing and Autonomous Agents (http://www.yl.is.s.u-tokyo.ac.jp/~ragab/P2PAA2006_WI.html) 11. International Workshop on GrC and Brain Informatics (BI) for WI (http://cs.tongji.edu.cn/prog/InforWeb/publish/newsdetail.jsp?newsno=716) 12. International Workshop on Multi-Agent Systems in E-Business: Concepts, Technologies and Applications (MASeB'06) (http://software.ucv.ro/%7Ebadica_costin/maseb2006/) 13. International Workshop on Research of Agent-based Government Horizon Business Integration Management Systems (http://management.dlut.edu.cn/wi-iat/index.htm) 14. International Workshop on Technologies and Applications of Knowledge Computing on the Web (http://charade.kuis.kyoto-u.ac.jp/%7Esyed/KCW.html) Note: we will not have a separate workshop registration fee this year (i.e., conference registration covers everything). For more information, please visit the conference website at http://www.comp.hkbu.edu.hk/iwi06/wi/?index=workshop or http://www.comp.hkbu.edu.hk/iwi06/iat/?index=workshop ++++++++++++++++++++++++++ Workshop Paper Submission ++++++++++++++++++++++++++ http://wi-consortium.org/wiiat06/scripts/ws_submit.php (Until Jul 30, 2006, 11.59pm *Pacific Standard Time*.) *** Contact Information *** Yiuming Cheung Hong Kong Baptist University, HK E-mail: ymc(a)Comp.HKBU.Edu.HK

1 0

ANN: hdbc-odbc 1.0.0.1
by John Goerzen 18 Jul '06

18 Jul '06

Hi, I have released HDBC-odbc, the ODBC backend driver for HDBC, version 1.0.0.1. This update contains compatibility fixes for those that use Windows -- it will now build correctly out of the box on that platform. Download from http://quux.org/devel/hdbc -- John

1 0

ICFP 2006 --- Call for Participation
by John Reppy 18 Jul '06

18 Jul '06

------------------------------------------------------------------------ CALL FOR PARTICIPATION The 11th ACM SIGPLAN International Conference on Functional Programming (ICFP 2006) Portland, Oregon September 18-20, 2005 http://icfp06.cs.uchicago.edu ------------------------------------------------------------------------ ICFP 2006 provides a forum for researchers and developers to hear about the latest work on the design, implementations, principles, and uses of functional programming. The conference covers the entire spectrum of work, from practice to theory, including its peripheries. Conference Organizers: General Chair: John Reppy, University of Chicago Program Chair: Julia Lawall, DIKU Local Arrangements Chair: James Hook, Portland State University Workshop Chairs: Matthias Blume, Toyota Technological Institute at Chicago Patricia Johann, Rutgers University Programming Contest Chairs: Carl Krary, CMU Robert Harper, CMU ------------------------------------------------------------------------ For more details, see http://icfp06.cs.uchicago.edu Preliminary Program: http://icfp06.cs.uchicago.edu/schedule.html Registration information: http://regmaster2.com/conf/icfp2006.html Hotel information: http://icfp06.cs.uchicago.edu/hotel.html ------------------------------------------------------------------------

1 0

FOOL/WOOD 2007 --- Call for papers
by John Reppy 18 Jul '06

18 Jul '06

Call For Papers 2007 International Workshop on Foundations and Developments of Object-Oriented Languages (FOOL/WOOD '07) Sponsored by ACM SIGPLAN Saturday, 20 January 2007 Nice, France Following POPL '07 http://foolwood07.cs.uchicago.edu Deadlines Submissions: Friday, 6 October 2006, 12:00 noon CDT (19:00 UTC) Notifications: Friday, 24 November 2006 Final versions: Friday, 22 December 2006 Workshop Description The search for sound principles for object-oriented languages has given rise to much work during the past two decades, leading to a better understanding of the key concepts of object-oriented languages and to important developments in type theory, semantics, program verification, and program development. The merger of the FOOL and WOOD workshops is intended to bring together researchers to share new ideas and results in these areas. The second joint workshop, FOOL/WOOD '07, will be held in Nice, France on Saturday, 20 January 2007, the day after POPL. Submissions for this event are invited in the general area of foundations of object-oriented languages and program analysis. Topics of interest include language semantics, type systems, program analysis and verification, formal calculi, concurrent and distributed languages, database languages, and language-based security issues. Papers are welcome to include formal descriptions and proofs, but these are not required; the key consideration is that papers should present novel and valuable ideas or experiences. 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 an informal electronic proceedings. Historically, presentation at FOOL/WOOD does not count as prior publication, and many of the results presented at FOOL/WOOD have later been published ECOOP, OOPSLA, POPL, and other conferences. Submission Instructions We solicit submissions on original research not previously published or currently submitted for publication elsewhere. The program chair should be informed of any related submissions; see the ACM SIGPLAN Republication Policy. Submissions should be PDF or PostScript in standard SIGPLAN 9pt conference format for a US-letter size page; templates are available at http://www.acm.org/sigs/sigplan/authorInformation.htm While submissions can be up to 12 pages, shorter papers describing promising preliminary work are also encouraged. Program Chair John Reppy (University of Chicago) e-mail: foolwood07 at mailman.cs.uchicago.edu Program Committee Derek Dreyer (Toyota Technological Institute at Chicago) Erik Ernst (University of Aarhus) Atsushi Igarashi (Kyoto University) Rustan Leino (Microsoft) Luigi Liquori (INRIA Sophia Antipolis) Todd Millstein (University of California - Los Angeles) David Walker (Princeton University) Elena Zucca (University of Genova) Steering Committee Viviana Bono (Universita di Torino) Michele Bugliesi (Universita Ca' Foscari) Sophia Drossopoulou (Imperial College) Kathleen Fisher (AT&T Labs) [Chair] Martin Odersky (Ecole Polytechnique Federale de Lausanne) Benjamin Pierce (University of Pennsylvania) Philip Wadler (University of Edinburgh)

1 0

Re: [Haskell] What would Haskell middleware look like?
by Clemens Grelck 18 Jul '06

18 Jul '06

Hi Paul, Paul Johnson wrote: > I've noticed that many other languages have a middleware to handle > distribution and concurrency issues. Haskell has STM for shared-memory > concurrency, but there is no mechanism (AFAIK) for distribution. You may interested into the Eden project jointly developed at Marburg and Madrid: http://www.mathematik.uni-marburg.de/~eden/ Eden is a kind of Haskell extension for describing process networks and the communication within them. Clemens -- Dr. Clemens Grelck University of Hertfordshire Dept of Computer Science College Lane, Hatfield, AL10 9AB United Kingdom

1 0

Visual Haskell for Visual Studio 2005
by Krasimir Angelov 18 Jul '06

18 Jul '06

Hello Guys, In the past year I had a lot of requests for Visual Haskell for Visual Studio 2005. Unfortunately the Visual Haskell code was broken after the latest GHC changes. These days I had enough time to fix it and now it is working well with VStudio 2003. There are very few changes that are required to run it under VStudio 2005 and they are already implemented. The problem is that I can't test it because I had only VStudio 2005 beta and its evaluation period is expired. If there are volunteers to do the port I would be happy to cooperate. Cheers, Krasimir

1 0

Package "mounting" proposal
by Sven Moritz Hallberg 17 Jul '06

17 Jul '06

Hi lists, (I hope my cross-posting is okay, but somehow this post seems to apply to all of you, so here goes...) I've recently noticed that folks at GHC HQ are working on a way to resolve the problem of importing two modules with the same name from different packages. There is a proposal[1] on the GHC wiki calling for a syntax extension for 'import' statements in Haskell modules so that the package (and version) to import from can be specified explicitly. There is a second ("extended") proposal[2], which calls for the ability to import (subtrees of) the module hierarchy exposed by a package and attach it to the global module namespace at an arbitrary point, analogous to mounting a filesystem in Unix. This proposal was appearently inspired by a post to the libraries mailing list by Frederik Eaton[3]. I agree with Frederik that it would be very nice to remove the burden of writing out long package or hierarchy prefixes in modules, and just work in some previously defined context. I'd like to propose yet another alternative to the existing two proposals that follows [2] in trying to satisfy [3] but differes from it in the following ways: - It doesn't require an extension of the existing Haskell syntax. - It can be implemented by extending Cabal alone (AFAICT). In particular, I propose to drop the assumption that Haskell modules are closed entities but rather always consider them to be seen in the context of a particular _package_. The package is now made responsible for assembling an appropriate (hierarchical) module namespace to which imports in the packaged modules are taken to refer. To this end, the current 'depends:' entry in a package description would be replaced by a more general "mounting" construct, i.e. "mount package foo at Foo.Bar in the module hierarchy". Optionally, as in [2], only a subtree of "foo" could be selected, or only a specific version of "foo". While I'm at it, I had to evaluate how this proposal would interact with the "ECT" module versioning scheme, I've proposed earlier[4]. I'd like to rework that scheme to this proposal. In ECT, a library author guarantees to his users that their imports will never break by providing different (numbered) variants of the library modules whenever their interface changes. By keeping the old variants as re-exports of updated versions, the author can record compatibilities. This carries the burden for users to annotate each import with a version number. If we lift the principles of ECT to the package level in accord with this proposal, that burden largely evaporates. Keeping the promise of "eternal backwards-compatibility", however, requires an (obvious) extension to the way Cabal deals with version numbers... First of all, package "mounts" must be able to say "this version, or any compatible one". Obviously, that's actually always what one wants, so it can be taken to be the only meaning of specifying "mount foo-1.3 at Foo.Bar". Then the question is just when to consider another version of foo compatible to 1.3. Obviously, only later versions should be considered, but when does compatibility end? Only the author of foo knows! She must specify it somehow. Two possibilities come to mind: 1. Add a field to the package description of foo (v1.4, say) that says "I'm backwards-compatible with 1.3." When building, this relation would have to be inspected to see whether any currently installed version of foo satisfies the dependency specified by the mount. 2. Declare a convention for version numbers to carry compatibility information, like the OpenGL standard, for example: If the new version is backwards-compatible, only the minor version number changes. If it isn't, the major version number must be incremented. I'd personally favour 2, as it would be easier to maintain for the author of foo (no compatiblity-field in the package description to update all the time) and also to implement in the build system (just a simple version comparison instead of a relation traversal to check a dependency). As a (more conservative?) variant of alternative 2, the third (instead of second) version component could be declared as "stays compatible", i.e. if only the third (or later) version component changes, the new version is assumed backwards-compatible, otherwise it's assumed incompatible. This would allow frequent incompatible updates without quickly getting large major version numbers... As for wasting space by keeping old versions around: Of course, if the new one is backwards-compatible, any old version can be removed. Otherwise, if it's "half-way" compatible, the author of foo can release a new backwards-compatible revision of the old version that reimplements (part of) the functionality in terms of the new operations, so the old version can be replaced by this leaner revision. Comments? Best regards, Sven [1]: http://cvs.haskell.org/trac/ghc/wiki/GhcPackages [2]: http://cvs.haskell.org/trac/ghc/wiki/GhcPackageNamespaces [3]: http://www.haskell.org/pipermail/libraries/2005-June/004009.html [4]: http://www.haskell.org/tmrwiki/EternalCompatibilityInTheory

3 2

What would Haskell middleware look like?
by Paul Johnson 15 Jul '06

15 Jul '06

I've noticed that many other languages have a middleware to handle distribution and concurrency issues. Haskell has STM for shared-memory concurrency, but there is no mechanism (AFAIK) for distribution. So I've been having a think about what one might look like. The primary requirements seem to me to be: * Transactions: STM is great, and the concept should work for distributed computation as well. So you should be able to say something like: atomic $ do { send message1 remote1; send message2 remote2} Both remote1 and remote2 processes will have world-visible state modified by the messages, but either they both happen atomically or neither happens. * Pi Calculus I've been reading a bit about this, and I think I see the basic ideas. The middleware operations should have a formal semantics specified in the Pi calculus, on the grounds that its the best formalism currently available. That way we can prove that the operations preserve desirable properties. * Replication If you want a reliable distributed system you absolutely have to have replicated tasks. Haskell's strict control over side effects is a big strength here: the headache for reliable replication has always been threads doing non-deterministic stuff that gets them out of sync. How does the IO monad interact with this? Replicated threads cannot be in the IO monad because that doesn't guarantee determinism, but they need to interact with the real world somehow. * Configuration management Another big headache for middleware. If you are not careful it can turn out that the only way to upgrade a component in the system is to upgrade all the components simultaneously, which is not really an option in a big system that has to stay up 24x7. Component names are not the right place for version numbers, and you need some formal definition of upward compatibility. Could XML have a place here? It does let you do duck typing. Or can we come up with something stronger? * Serialization of circular data structures. "show" is fine for non-looping structures, but what about: let x = 1 : y y = 2 : x Can we find a way of transmitting such a structure? Thats all I can think of for now. Paul.

3 2

The History of Haskell
by Simon Peyton-Jones 15 Jul '06

15 Jul '06

Friends, Phil Wadler, John Hughes, Paul Hudak and I have been writing a paper about the The History of Haskell We've submitted an earlier draft to the History Of Programming Languages conference (HOPL'07), and it's been accepted. We have to submit a more-or-less final draft by 1 September. This message is to invite you to read it, tell us what you think, and help us improve it. Here it is, along with a Wiki page for you to write comments: http://haskell.org/haskellwiki/History_of_Haskell Enjoy! Simon PS: If you followed a link earlier today, and have a version dated Feb, discard it. The one you want is dated July 14th.

2 1