- Haskell - Haskell.org

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

07 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

GHC inferred type different for pointed/point-free defs?
by Dan Weston 03 Nov '06

03 Nov '06

Help! One of two things is going on: 1) I don't understand what I'm doing 2) GHC is inferring different types for pointed and point-free function definition. I wanted to define Haskell equivalents to the C ternary operator. Basically, predicate ??? doIfTrue ||| doIfFalse For some reason, though, in GHC 6.4 and 6.7, the types inferred for abs1 and ab2 (defined below) are different: *Main> :t abs1 abs1 :: (Num a, Ord a) => a -> a *Main> :t abs2 abs2 :: Integer -> Integer How is abs2 less general just because I use point-free notation instead of pointed notation? They should have the same type, no? I'm stumped... > import Control.Arrow > import Data.Either > > infix 1 ?, ??, ???, ???? > > (?) True = Left > (?) False = Right > > (??) True = Left . fst > (??) False = Right . snd > > p ??? q = (p &&& arr id) >>> uncurry (?) >>> q > p ???? q = (p &&& arr id) >>> uncurry (??) >>> q > > abs1 x = (< 0) ??? negate ||| id $ x > abs2 = (< 0) ??? negate ||| id > > checks :: [Bool] > checks = > [ > (True ? 3 ) == (Left 3), > (False ? 4 ) == (Right 4), > (True ?? (3,4)) == (Left 3), > (False ?? (3,4)) == (Right 4), > (even ??? (`div` 2) ||| (+1).(*3) $ 3 ) == ( 10), > (even ??? (`div` 2) ||| (+1).(*3) $ 4 ) == ( 2), > (uncurry (==) ???? (+1) ||| (*3) $ (3,3)) == ( 4), > (uncurry (==) ???? (+1) ||| (*3) $ (3,4)) == ( 12), > (uncurry (==) ???? (+1) +++ (*3) $ (3,3)) == (Left 4), > (uncurry (==) ???? (+1) +++ (*3) $ (3,4)) == (Right 12), > (abs1 5 ) == ( 5), > (abs1 (-5) ) == ( 5), > (abs2 5 ) == ( 5), > (abs2 (-5) ) == ( 5) > ] > > main = print (and checks)

2 1

Local Haskell meeting in Leipzig/Germany 5 December
by Johannes Waldmann 03 Nov '06

03 Nov '06

We're planning a local Haskell meeting 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. Details and (free) registration: http://iba-cg.de/haskell.html -- -- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 -- ---- http://www.imn.htwk-leipzig.de/~waldmann/ -------

2 1

REMINDER: HC&A Report (November 2006 edition)
by Andres Loeh 03 Nov '06

03 Nov '06

Dear Haskellers, the deadline for the November 2006 edition of the Haskell Communities and Activities Report is only a few days away -- but this is still 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. Many projects that have been included in former reports have not yet updated their entries. Please have a look at the June 2006 edition for reference. * Has your project been listed in previous Reports, but is not yet updated? Please write a short update! * Are you no longer working on a project that was included in the Report? Write up what you are working on instead, and tell me if someone else has picked up the project. * Is some project you have heard about not included in any previous Report? Please let me know ... There is still time to write a completely new entry, on a new compiler, tool, library, company, user group, idea, ... -- as long as there is a connection to the Haskell language, there is a place for it in the Report! The general deadline is Monday, 06 November 2006, but I can extend it by a few days on an individual basis. Just please contact me before the deadline so that I know you are writing. Please mail your entries to <hcar at haskell dot org>, in plain text or pseudo-(La)TeX format. More information can be found in the original Call for Contributions at http://www.haskell.org/pipermail/haskell/2006-October/018646.html I look forward to receiving your contributions. Thanks a lot, Andres (current editor)

1 0

[news.announce.newgroups, news.groups, comp.lang.functional, alt.comp.lang.haskell] RESULT: comp.lang.haskell will be created
by mark＠ixod.org 01 Nov '06

01 Nov '06

1 0