November 2006 - Haskell

ANN YCR2JS, a Yhc Core to Javascript Converter
by Dimitry Golubovsky 13 Nov '06

13 Nov '06

Hi, Ycr2js is a sub-project within the York Haskell Compiler (Yhc) project. It is aimed to create a tool to convert an arbitrary Haskell program into Javascript which in turn may be executed in any Web browser. I am pleased to announce that, with great amount of help from the Yhc Team, the converter has been integrated into the Yhc project, and initial stage of coding and development has been completed. Interested members of the Haskell community are invited to experiment with the Converter. It can be obtained with current Yhc snapshot from http://darcs.haskell.org/yhc At this point, it is possible to convert a Haskell program into Javascript and create a XHTML page for viewing in a Web browser. No framework is available to access DOM in type safe way, and/or support for AJAX. Not all low-level primitives have been mapped to Javascript or optimized for the Javascript environment. These are tasks for next stages and will be worked on in near future. It was by no means only my idea to generate Javascript from Haskell. Several people expressed this idea earlier in blogs and mailing lists. I was interested in this myself, and just decided to go ahead and implement it. Documentation (partially written) is available: http://haskell.org/haskellwiki/Yhc/Javascript At the moment of this announce, there is one live demo: http://darcs.haskell.org/yhc/web/jsdemos/Echo.html also referred to from the Wiki page mentioned. Type any text in the input field provided, and see it echoed right above after Enter is pressed. Just for fun, type any decimal number and see it converted to a Roman number, and vice versa. Roman numerals module (C) Malcolm Wallace, originally from ftp://ftp.cs.york.ac.uk/pub/haskell/contrib/Roman.hs On not so fast computers, the demo may show some delays (e. g. 3 - 5 seconds on a 375 MHz Intel Celeron, Netscape7, Linux) between the text is typed and echoed (mostly due to Roman number conversion). This is being worked on. Ycr2js is work in progress. What is most needed is users feedback that would help improve it. Any feedback will be greatly appreciated. Thanks everyone who helped me in any way. Feel free to contact me at golubovsky(a)gmail.com -- Dimitry Golubovsky Anywhere on the Web

1 0

Research position in spatial cogntion (Haskell-related)
by Till Mossakowski 10 Nov '06

10 Nov '06

1 Doctoral Research Assistant / Postdoctoral Researcher SFB/TR 8 project I4-[SPIN], Universität Bremen (TVL 13, approx. € 35,000 to € 50,000 p.a. gross) The research project I4-[SPIN] is concerned with classification and formalization of qualitative spatial calculi, relations among these calculi, spatial ontologies, and route graphs. Research tasks include both further development of the mathematical theory, the formalization and verification of critical results (like composition tables) using suitable specification languages and theorem proving tools, as well as further enhancement of these tools. The goal is to obtain both a trustworthy and efficient framework for qualitative spatial reasoning, which is applicable to reasoning tasks occurring in interactive wheelchair and robot navigation. The applicant should have a degree in computer science or in a related field (diploma, master's, or Ph.D.). Strong interest in formal methods and in interdisciplinary collaboration is expected. Especially, the applicant should have qualifications and/or interests in some of the following fields: . Qualitative spatial reasoning . Formal methods and theorem proving . Category theory . Functional programming (Haskell) We offer the opportunity to gain research experience in a modern and enthusiastic research environment with strong interdisciplinary and international links. Responsibilities include project work and research, publication of research results, supervision of student projects, participation in the activities of the SFB/TR 8, and contribution to research proposals. The position is available immediately / from January 2007 until the end of 2010. Extension is possible. Application deadline: 01 December 2006 (or until a suitable candidate is found). Universität Bremen is an equal opportunity employer. Women are especially encouraged to apply. Handicapped applicants with equal qualifications will be given preferential treatment. More information about this project can be found at www.sfbtr8.uni-bremen.de/i4. The Transregional Collaborative Research Center SFB/TR 8 Spatial Cognition: Reasoning, Action, Interaction at the Universities of Bremen and Freiburg, Germany pursues interdisciplinary long-term research in Spatial Cognition. Particular emphasis is given to: . Spatial Reasoning: Knowledge representation, human spatial thinking, computational modeling, diagrammatic reasoning, cognitive and computational complexity, qualitative spatio-temporal calculi; . Action in Space: Cognitive robotics, explorative localization and mapping, robot navigation, human navigation and wayfinding, sensorimotor representations of spatio-temporal structures, embodied cognition; . Communication and Interaction in Space: Formal methods, spatial and linguistic onto¬logies, computational linguistics, environmental cognition, integration of spatial methods. A description of the current research projects of the SFB/TR 8 can be found at www.sfbtr8.uni-bremen.de The SFB/TR 8 is funded by the German Research Foundation (DFG). Please address questions about the position and send your application (preferably by email) to: Dr. Till Mossakowski <tm(a)sfbtr8.uni-bremen.de> SFB/TR 8 - Spatial Cognition Universität Bremen P.O. Box 330 440 28334 Bremen / Germany -- Till Mossakowski Office: Phone +49-421-218-64226 DFKI Lab Bremen Cartesium Fax +49-421-218-9864226 Robert-Hooke-Str. 5 Enrique-Schmidt-Str. 5 till(a)tzi.de D-28359 Bremen Room 2.051 http://www.tzi.de/~till

1 0

ANN: System.FilePath 0.10
by Neil Mitchell 08 Nov '06

08 Nov '06

Hi Haskell, ANNOUNCEMENT: I am hereby announcing System.FilePath 0.10, which hopefully is pretty close to final now. This library manipulates FilePath's correctly on both Posix and Windows. http://www-users.cs.york.ac.uk/~ndm/projects/libraries.php#filepath (Includes a darcs repo, a .tar.gz, haddock documentation etc) In this version I have made reasonably large changes: * Lots of functions gone (temporary file handling, canonicalization, drive manipulation, directory creation, directory enumeration) - pretty much down to only pure (non-IO methods) left. * 3 new methods (asFile, isFile, asDirectory - look up the docs for their meanings, but they are pretty small) * Renamed functions to follow the scheme replace/take/drop instead of set/get/drop - as suggested by Simon Marlow (since set/get implies state operations in Haskell) * Eliminated some duplicate functions (all functions are now different) * Better handling of some obscure corner cases, particularly on Windows with drive specifiers. * Even more automated testing (211 properties, 75 of them QuickCheck properties) This incorporates a large proportion of the suggestions that were applicable to my library and its underlying design decisions. COMPATIBILITY: Since this is a fairly large API change I have created System.FilePath.Compat, which is identical to the old API. As a quick fix import System.FilePath ==> import System.FilePath.Compat will work fine. In the haddock documentation of the Compat module I have included descriptions of what the new name of functions are (http://www-users.cs.york.ac.uk/~ndm/projects/filepath/System-FilePath-Compa…) I really don't like breaking things for existing users, but the Compat module should make it pretty easy to convert. If you do need any help with the migration email me and I'll help as required. The Compat module will remain around for the lifetime of this library, but will not be submitted for inclusion into base. FOLLOW UP DISCUSSION: As last time I released System.FilePath there was an 84 email long thread, I think its probably best if I try and structure the discussion this time so people can keep up with whats going on. Can we start a discussion on haskell-cafe related to this announcement, API names, API semantics and other general comments regarding this library. What should be removed? What should be added? What should be changed? I am very interested to see what people think, and to make something everyone can use. Please do not email on the main thread with anything related: * objections to the concept of putting a FilePath library in base (I'm not asking for that now, but I will be in future, feel free to flame me then) * objections to the concept of "type FilePath = String". This is the way it is (although feel free to start a separate discussion on this, if you want) THANKS: Thanks for everyone who gave suggestions and help on this (Lemmih, dcoutts, JaffaCake, the rest of the Yhc team, Issac, shapr, #haskell, Marc Webber, David House, Matt, lots of others). Thanks also to QuickCheck, without which this library would be much less reliable. Thanks Neil

1 1

wxHaskell for GHC 6.6 and wxWidget 2.6.2
by Sukit Tretriluxana 08 Nov '06

08 Nov '06

Hi, I saw someone posting a comment (http://sequence.complete.org/node/214) about the build of wxHaskell for GHC 6.6 and wxWidget 2.6.2 but it's not currently hosted anywhere yet. Does anyone know where can I get the Windows binary build of it for the time being? Thanks, Ed

2 2

Haskell Weekly News: November 08, 2006
by dons＠cse.unsw.edu.au 08 Nov '06

08 Nov '06

--------------------------------------------------------------------------- Haskell Weekly News http://haskell.org/haskellwiki/HWN Issue 48 - November 08, 2006 --------------------------------------------------------------------------- Welcome to issue 48 of HWN, a weekly newsletter covering developments in the Haskell community. Announcements * SmallCheck 0.2. Colin Runciman [1]announced that SmallCheck 0.2, a lightweight testing library for Haskell, is out, and can be [2]obtained. Since version 0.1: there's now a choice of interactive or non-interactive test-drivers using iterative deepening; more pre-defined test-data generators, including revised Int, Integer, Float, Double, Nat and Natural and additional examples. SmallCheck is similar to QuickCheck but instead of testing for a sample of randomly generated values, SmallCheck tests properties for all the finitely many values up to some depth, progressively increasing the depth used. 1. http://article.gmane.org/gmane.comp.lang.haskell.general/14461 2. http://www.cs.york.ac.uk/fp/smallcheck0.2.tar * Hoogle Command Line 3 Beta. Neil Mitchell [3]released Hoogle Command Line version 3 Beta, an alternative to [4]the Hoogle website. Hoogle lets you search for Haskell functions by name and by type signature. 3. http://article.gmane.org/gmane.comp.lang.haskell.general/14464 4. http://haskell.org/hoogle * The Monad.Reader. Wouter Swierstra [5]issued a call for submissions for articles for the next issue of [6]The Monad.Reader. There are a large number of conferences and journals that accept research papers related to Haskell; unfortunately, the platform for non-academic publications is far less developed. This is where The Monad.Reader fits in. So if you are tossing around some ideas, write it up, and submit! Deadline for submissions is January 19th, 2007. 5. http://article.gmane.org/gmane.comp.lang.haskell.general/14449 6. http://www.haskell.org/haskellwiki/TheMonadReader * Haskell Communities and Activities Report. Andres Loeh [7]reminded us that the deadline for the November 2006 edition of the Haskell Communities and Activities Report is now! -- there may still be just enough time to make sure that the report contains a section on *your* project, on the interesting stuff that you've been doing; using or affecting Haskell in some way. For more info see [8]the call for contributions. 7. http://article.gmane.org/gmane.comp.lang.haskell.general/14453 8. http://www.haskell.org/pipermail/haskell/2006-October/018646.html * HsMan. Frederik Eaton [9]announced hsman, a tool that indexes Haddock-generated HTML files, and allows users to search for functions and also GHC manual topics. 9. http://thread.gmane.org/gmane.comp.lang.haskell.glasgow.user/11153/focus=11… * HaL, Haskell meeting in Leipzig. Johannes Waldmann [10]announced that a local Haskell meeting is to take place on December 5th in Leipzig, Germany. The meeting will be hosted by IBA Consulting. It will be quite informal, with some very short talks (most probably in German). Interessenten sind herzlich eingeladen. [11]Details and (free) registration. 10. http://article.gmane.org/gmane.comp.lang.haskell.general/14454 11. http://iba-cg.de/haskell.html Haskell' This section covers the [12]Haskell' standardisation process. * [13]Introduce lambda-match (explicit match failure and fall-through) * [14]Importing and exporting instance declarations * [15]Patches! 12. http://hackage.haskell.org/trac/haskell-prime 13. http://article.gmane.org/gmane.comp.lang.haskell.prime/1847 14. http://thread.gmane.org/gmane.comp.lang.haskell.prime/1835/focus=1835 15. http://thread.gmane.org/gmane.comp.lang.haskell.prime/1850/focus=1850 Libraries This week's proposals and extensions to the [16]standard libraries. * [17]unsafeShift operations for Data.Bits * [18]map* for Data.List * [19](*) `on` f = \x y -> f x * f y * [20]forkChild, waitForChild, parIO, timeout * [21]isLeft and isRight 16. http://haskell.org/haskellwiki/Library_submissions 17. http://thread.gmane.org/gmane.comp.lang.haskell.libraries/5569/focus=5569 18. http://thread.gmane.org/gmane.comp.lang.haskell.libraries/5552/focus=5552 19. http://thread.gmane.org/gmane.comp.lang.haskell.libraries/5519/focus=5519 20. http://thread.gmane.org/gmane.comp.lang.haskell.libraries/5488/focus=5488 21. http://thread.gmane.org/gmane.comp.lang.haskell.libraries/5461/focus=5461 Discussion * The OI comonad. Sven Biedermann [22]invoked a discussion about the OI [23]comonad, and provided an example of a simple OI-comonad for stdin/stdout only, that preserves referential integrity. 22. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/16278/focus=16278 23. http://www.haskell.org/haskellwiki/Research_papers/Monads_and_arrows#Comona… * The Bits between the Lambdas. Nuno Pinto [24]asked about Binary IO in Haskell. Several solutions were suggested. 24. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/16245/focus=16245 * Translating Haskell to VHDL. Alfonso Acosta [25]pondered how to write a translator from [26]Haskell to VHDL. 25. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/16337/focus=16337 26. http://haskell.org/haskellwiki/Research_papers/Domain_specific_languages#Ha… * New maintainers for wxHaskell. Jeremy O'Donoghue [27]announced that a new team of maintainers in place for wxHaskell, so we're hoping that will see a significant increase in wxHaskell activtiy in the future. Great! 27. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/16364/focus=16364 * Permutation with k levels. Nuno Pinto [28]wondered about generic permute algorithms in Haskell. 28. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/16365/focus=16365 Blog noise [29]Haskell news from the blogosphere. * [30]Introductory Haskell: Solving the Sorting-It-Out Kata * [31]Writing A Lisp Interpreter In Haskell * [32]Standardising Concurrency in C++ * [33]Living with a ghost: concurrency and state * [34]Concatenative programming in Haskell's Arrows * [35]Functional programming is functional * [36]LaTeX YAHT on darcs.haskell.org * [37]My next programming language * [38]Haskell Bowling * [39]Variable substitution gives a ... monad * [40]Modeling the Semantics of Geographic Categories through Conceptual Integration (in Haskell) * [41]Keeping it simple * [42]In the beginning... * [43]Testing ... testing ... * [44]Livecoding music with Haskell * [45]Why I recommend Haskell * [46]Win for Type Theory? * [47]That problem when the ideas come too thick and fast 29. http://planet.haskell.org/ 30. http://blog.moertel.com/articles/2006/10/31/introductory-haskell-solving-th… 31. http://www.defmacro.org/ramblings/lisp-in-haskell.html 32. http://www.artima.com/cppsource/threads_meeting.html 33. http://damienkatz.net/2006/10/living_with_a_g_1.html 34. http://kpreid.livejournal.com/7351.html 35. http://gearon.blogspot.com/2006/10/functional-programming-is-functional.html 36. http://koweycode.blogspot.com/2006/11/yaht-on-darcshaskellorg.html 37. http://khigia.wordpress.com/2006/11/02/what-is-my-next-programming-language/ 38. http://www.xprogramming.com/xpmag/dbcHaskellBowling.htm 39. http://sigfpe.blogspot.com/2006/11/variable-substitution-gives.html 40. http://virginia-gis.spaces.live.com/Blog/cns!45E7F65393A53E20!117.entry 41. http://vastusutra.blogspot.com/2006/10/keeping-it-simple.html 42. http://samplerate.blogspot.com/2006/11/in-beginning.html 43. http://chiralos.blogspot.com/2006/11/testing-testing.html 44. http://doc.gold.ac.uk/~ma503am/alex/haskellmusic 45. http://lambda-the-ultimate.org/node/1807#comment-22019 46. http://nolacoaster.livejournal.com/20789.html 47. http://brokenhut.livejournal.com/176006.html Quotes of the Week * coffeemug: There don't seem to be any definitive sources that suggest Haskell isn't good at something. * stevan: Haskell is like all the other functional languages I have read about, but totally different at the same time * coffeemug: you can do more with Haskell in less code that's easier to read and maintain in the long run * Jeannette Wing: Computational thinking will have become ingrained in everyone's lives when ... trees are drawn upside down * monochrom: recursive directory search is an alpha-beta with boring values of alpha and beta * skew: Types are largely about writing down the contract of a function once and telling the compiler to keep track of things, rather than trying to get it all straight yourself, and being rewarded with bugs that only manifest during demos... * monochrom: They say Mozarts Mass in C minor K427 is uplifting. I'm going to name my next monad transformer or arrow transformer MozartMassInCMinorK427T * Ron Jeffries: Dan's assertion, as I recall it, was that Haskell lets us express the program 'in the way we think'. On the contrary, what Haskell does in my opinion is let us express the program in the way Haskell thinks * sedd: [On the improving Haskell and Lua scores on the language shootout] This is awesome. It's like watching a match between the team of the town where you're from, and the team of the town where you live. Either way you've got a reason to get drunk after the game. * emeijer: Functional programming has finally arrived to the masses. It's name is not Lisp, ML or Haskell: it's Visual Basic * audreyt: Because Haskell is such a reasonable language, we reason about it all the time, and we also have a bot to reason it for us when we are lazy * spiffy: needs to stop trying to understand monads at night * psykotic: spiffy: they're just monoids on the category of endofunctors over some category, what's the big deal? * skew: also, if you use ST you know the code is just using mutable variables, rather than formatting your hard drive * Baughn: I once explained monads to a non-programmer: 'And? What's so hard about that?' * monochrom: The problem is that bad programmers will assess tutorials for good programmers as 'ivory tower', and moreover bad programmers are the vocal majority. It gets you bad press * scodil: you say 'sledgehammer' like its a bad thing * sjanssen: I suspect that planet.haskell.org has more content on catamorphisms than cats Code Watch * Wed Nov 1 08:43:29 PST 2006. Simon Peyton Jones. Major overhaul of the Simplifier. This big patch completely overhauls the Simplifier. The simplifier had grown old and crufty, and was hard to understand and maintain. This new version is still quite complicated, because the simplifier does a lot, but it's much easier to understand, for me at least. About the Haskell Weekly News Each week, new editions are posted to [48]the Haskell mailing list as well as to [49]the Haskell Sequence and [50]Planet Haskell. [51]RSS is also available, and headlines appear on [52]haskell.org. The Haskell Weekly News is also [53]available in Spanish translation. To help create new editions of this newsletter, please see the [54]contributing information. Send stories to dons at cse.unsw.edu.au. The darcs repository is available at darcs get http://www.cse.unsw.edu.au/~dons/code/hwn 48. http://www.haskell.org/mailman/listinfo/haskell 49. http://sequence.complete.org/ 50. http://planet.haskell.org/ 51. http://sequence.complete.org/node/feed 52. http://haskell.org/ 53. http://haskell.org/haskellwiki/HWN/es 54. http://haskell.org/haskellwiki/HWN

1 0

ANN: Hoogle Command Line 3 Beta
by Neil Mitchell 07 Nov '06

07 Nov '06

Hi, I am pleased to announce Hoogle Command Line version 3 Beta, an alternative to the Hoogle website (http://haskell.org/hoogle) If you don't know what Hoogle is, go to the website above and have a play - it searches for Haskell functions by name and by type signature. There are two versions of this release: * Cross platform source: http://haskell.org/hoogle/download/hoogle-cmdline-nov-2006-source.tar.gz * Windows binaries: http://haskell.org/hoogle/download/hoogle-cmdline-nov-2006-windows.zip This is intended as an intermediate release - Hoogle 4 is still under development and not ready for others to play with yet - but I accidentally broke the console version in the darcs repository. This should hopefully let people play with the hoogle command line until Hoogle 4 comes along. Thanks Neil

1 0

ANN: SmallCheck0.2
by Colin Runciman 06 Nov '06

06 Nov '06

SmallCheck 0.2: another lightweight testing library in Haskell -------------------------------------------------------------- A new version of SmallCheck can be obtained from: http://www.cs.york.ac.uk/fp/smallcheck0.2.tar Main differences from 0.1: * choice of interactive or non-interactive test-drivers using iterative deepening; * more pre-defined test-data generators, including revised Int, Integer, Float, Double, Nat and Natural. * Additional examples. SmallCheck is similar to QuickCheck (Claessen and Hughes 2000-) but instead of testing for a sample of randomly generated values, SmallCheck tests properties for all the finitely many values up to some depth, progressively increasing the depth used. Folk-law: if there is any case in which a program fails, there is almost always a simple one. Corollary: if a program does not fail in any simple case, it almost never fails. Other possible sales pitches: * write test generators for your own types more easily * be sure any counter-examples found are minimal * write properties using existentials as well as universals * establish complete coverage of a defined test-space * display counter-examples of functional type Comments and suggestions welcome. Colin R

1 0

ESSLLI 2007 Student Session - Call for Papers
by Ville Nurmi 06 Nov '06

06 Nov '06

[Our apologies for multiple postings of this announcement.] ESSLLI 2007 STUDENT SESSION CALL FOR PAPERS August 6-17 2007, Dublin, Ireland Deadline: February 11, 2007 http://www.loria.fr/~sustreto/stus07/ We are pleased to announce the Student Session of the 19th European Summer School in Logic, Language and Information, which will be held in Dublin, Ireland on August 6-17, 2007. We invite submission of papers in the areas of Logic, Language and Computation for presentation at the Student Session and for appearance in the proceedings. AIM Student Session exists to bring together young researchers to present and discuss their work in progress with a possibility to get feedback from senior researchers. SUBMISSION Only original publications are accepted, previous published works are not allowed. All authors of the paper must be students: undergraduate (before the completion of the Masters degree) or graduate (before the completion of the PhD degree). Papers can be submitted either for oral (20min talk+10 min discussion), or poster presentation. There are three subject areas: Logic and Language (lola), Language and Computation (laco) and Logic and Computation (loco). The submissions should be sent by email before 11 February 2007 to dmitry.sustretov(a)loria.fr (the message should have subject "ESSLLI STUS submission") along with an identification file in plain text of the following format: Title: title of the submission First author: firstname lastname Affiliation: affiliation of the first author E-mail: e-mail of the first author ...... Last author: firstname lastname Affiliation: affiliation of the last author E-mail: e-mail of the last author Abstract: (5 lines) Subject area: Logic and Language or Language and Computation or Logic and Computation Modality: Poster or Oral The submission should be in one of the following formats: PostScript, PDF or RTF. (In case of acceptance, the final version of the paper will have to be submitted in LaTeX format.) The papers must use single column A4 size pages, 11pt or 12pt fonts, and standard margins, and may not exceed 7 pages of length exclusive of references. The paper and identification file should be named by the following convention: category-modality-last name(s) of author(s) (for example, "loco-oral-martin.pdf" and "loco-oral-martin.txt"). At least one of the authors of the paper must register as a participant of ESSLLI. Accepted papers will be published in the proceedings which will be available during ESSLLI. TIMELINE Submission deadline: February 11, 2007 Notification of authors: April 20, 2007 Full paper deadline: May 20, 2007 ESSLLI: August 6-17, 2007 PROGRAM COMMITTEE Chairs: Ville Nurmi and Dmitry Sustretov Co-chairs: Logic and Computation Bryan Renne, City University of New York Levan Uridia, University of Amsterdam Language & Computation Luciana Benotti, INRIA Lorraine Michael Kaisser, University of Edinburgh Logic & Language Jana Häussler, University of Konstanz Miltiadis Kokkonidis, University of Oxford CONTACT The Student Session webpage is the place for relevant information. http://www.loria.fr/~sustreto/stus07/ Feel free to contact the chairs for any questions about the submissions or the Student Session in general. Ville Nurmi Phone: +358 9 191 51497 Fax: +358 9 191 51400 E-mail: ville.v.nurmi(a)helsinki.fi Dmitry Sustretov Phone: +33 3 83 59 20 35 Fax: +33 3 83 41 30 79 E-mail: dmitry.sustretov(a)loria.fr

1 0

RE: package mounting
by Simon Peyton-Jones 06 Nov '06

06 Nov '06

| > http://hackage.haskell.org/trac/ghc/wiki/PackageMounting | | It looks nice, but don't you think the -package-base flag ought to | take both the package name *and* the mountpoint? | | Otherwise, this looks like what I've wanted all along, if only I knew it ;-). I think most of you know that GHC 6.6 made (IHMO) a significant step forward, by allowing a program to contain multiple modules with the same name, if they are from different packages. That means that package authors can choose module names freely, rather than worry about accidentally colliding with other packages. (We'd regard it as unacceptable if the local variables of a function could not have the same name as the local variables of another procedure!) That still leaves an open question, not resolved by GHC 6.6: what to do if you want to import module M from two different packages into the same module? (A related question is when you have to decide what your module is called.) This can be tackled in at least three different ways, one being Frederik's proposal. Simon and I are not wedded to any particular one, and we'd welcome a consensus on what to do. The state of play is summarised here http://hackage.haskell.org/trac/ghc/wiki/GhcPackages which includes a link to the package-mounting proposal. If you care about this stuff, do debate it -- and please record points that survive a bit of discussion on the Wiki pages. None of this is very hard to implement; the difficulty is settling on a good design. Simon

3 2

TASE 2007: 1st IEEE & IFIP International Symposium on Theoretical Aspects of Software Engineering
by Huibiao Zhu 04 Nov '06

04 Nov '06

[We apologise for multiple copies.] TASE 2007 1st IEEE & IFIP International Symposium on Theoretical Aspects of Software Engineering June 6 - 8, 2007, Shanghai, China http://www.sei.ecnu.edu.cn/TASE2007/ Call For Papers Submission Deadline: January 5, 2007 For more information e-mail: jifeng(a)sei.ecnu.edu.cn The 1st IEEE & IFIP Theoretical Aspects of Software Engineering Conference (TASE 2007), sponsored by IFIP and IEEE, will be held in Shanghai, China June 2007. Large scale software systems and Internet are of growing concern to academia and industry. This poses new challenges to the various aspects of software engineering, for instance, the reliability of software development, Web-oriented software architecture and Aspect & Object-orientation techniques. As a result, new concepts and methodologies are required to enhance the development of software engineering from theoretical aspects. TASE 2007 is a forum for researchers from academia, industry and government to present ideas, results, and ongoing research on theoretical advances in Software Engineering. Topics of Interest: Authors are invited to submit manuscripts of original unpublished research in all theoretical areas of software engineering (Requirements, Specification, Testing, Workflows, Architectures, Verification, Languages, and Logics). The topics of interest include, but are not limited to: * Requirements Engineering * Specification and Validation * Software Testing * Component-based Development * Model Checking for Software * Software Processes and Workflows * Software Frameworks and Middleware * Software Architectures and Design * Software safety and reliability * Reverse Engineering and Software Maintenance * Aspect and Objected �Corientation Techniques * Embedded and Real-time Software * Service-oriented Computing and Web Services * Model-driven Development * Coordination and Feature Interaction * Parallel and Distributed Computing * Logics of Programs * Program Analysis * Semantics and Design of Programming Languages * Type Theory Submission Guidelines: Authors should submit and register their paper through our web-interface at: http://www.sei.ecnu.edu.cn/TASE07/submit by January 5, 2007(Web interface will be accessible after December 1, 2006). Submissions must not have been published or be concurrently considered for publication elsewhere. All submissions will be reviewed by at least three members of the program committee. They will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. The proceedings of the conference will be published by the IEEE Computer Society Press. Papers must be written in English and not exceed 10 pages in IEEE format. Instructions for authors are available at http://computer.org/cspress/instruct.htm. Latex document classes can be downloaded from the website at ftp://pubftp.computer.org/Press/Outgoing/proceedings/. Important Dates: * December 29, 2006: Title and abstract submission deadline * January 5, 2007: Paper submission deadline * February 22, 2007: Acceptance/rejection notification * March 23, 2007: Camera-ready version due * June 4-5, 2007: Tutorials * June 6-8, 2006: TASE 2007 Organization: General Chair: Michael Hinchey, NASA, USA Program Co-chairs: Jifeng He, East China Normal University, China Jeff Sanders, Oxford University, UK Steering Committee chair: Michael Hinchey, NASA, USA Publicity Chair(Asia): Naixiao Zhang, Peking University, China Publicity Chair(Europe,USA): Meng Sun, CWI, The Netherlands Local Organization Chair: Geguang Pu, East China Normal University, China Program Committee: Bernhard Aichernig (Graz University of Technology, Austria) Keijiro Araki (Kyzushu University, Japan) Farhad Arbab (CWI and Leiden University, The Netherlands) Jonathan Bowen (Museophile Limited, UK) Michael Butler (University of Southampton, UK) Ana Cavalcanti (University of York, UK) Jim Davies (Oxford University, UK) Geoff Dromey (Griffith University, Australia) Jin Song Dong (National University of Singapore, Singapore) Zhenhua Duan (Xi'dian University, China) Colin Fidge (Queensland University of Technology, Australia) Dieter Gollmann (Hamburg University of Technology, Germany) Ning Gu (Fudan University, China) Xuandong Li (Nanjing University, China) Jing Liu (East China Normal University, China) Kung-Kiu Lau (Manchester University, UK) Shaoying Liu (Hosei University, Japan) Zhiming Liu (UNU/IIST, Macau, China) Tom Maibaum (McMaster University, Canada) Annabelle McIver (Macquarie University, Australia) Hong Mei (Peking University, China) Huaikou Miao (Shanghai University, China) Shankar Natarajan (SRI International, USA) Nimal Nissanke (London South Bank University, UK) Shengchao Qin (Durham University, UK) Zongyan Qiu (Peking University, China) Joseph Sifakis (Verimag, France) Zhong Shao (Yale University, USA) Margus Veanes (Microsoft, USA) Sergiy Vilkomir (University of Limerick, Ireland) Farn Wang (National Taiwan University, Taiwan) Ji Wang (Changsha Institute of Technology, China) Jim Webber (ThoughtWorks, Australia) Heike Wehrheim (University of Paderborn, Germany) Jim Woodcock (University of York, UK) Wang Yi (Uppsala University, Sweden) Gianluigi Zavattaro (University of Bologna, Italy) Jian Zhang (Institute of Software, China) Huibiao Zhu (East China Normal University, China) Steering Program Committee: Keijiro Araki, Japan Michael Hinchey (Chair), USA Jifeng He, China Zhiming Liu, Macau Mike Reed, Macau Huibiao Zhu, China Keynote Speakers: Jeannette M. Wing (Carnegie Mellon University, USA) Bertrand Meyer (ETH Zurich, Switzerland) Mathai Joseph (Tata Consultancy Services, India)

1 0