September 2009 - Haskell

Announcing Djinn, version 2004-12-11, a coding wizard
by Lennart Augustsson 07 Apr '11

07 Apr '11

Howdy, y'all! I've written a small program that takes a (Haskell) type and gives you back a function of that type if one exists. It's kind of fun, so I thought I'd share it. It's probably best explained with a sample session. calvin% djinn Welcome to Djinn version 2005-12-11. Type :h to get help. # Djinn is interactive if not given any arguments. # Let's see if it can find the identity function. Djinn> f ? a->a f :: a -> a f x1 = x1 # Yes, that was easy. Let's try some tuple munging. Djinn> sel ? ((a,b),(c,d)) -> (b,c) sel :: ((a, b), (c, d)) -> (b, c) sel ((_, v5), (v6, _)) = (v5, v6) # We can ask for the impossible, but then we get what we # deserve. Djinn> cast ? a->b -- cast cannot be realized. # OK, let's be bold and try some functions that are tricky to write: # return, bind, and callCC in the continuation monad Djinn> type C a = (a -> r) -> r Djinn> returnC ? a -> C a returnC :: a -> C a returnC x1 x2 = x2 x1 Djinn> bindC ? C a -> (a -> C b) -> C b bindC :: C a -> (a -> C b) -> C b bindC x1 x2 x3 = x1 (\ c15 -> x2 c15 (\ c17 -> x3 c17)) Djinn> callCC ? ((a -> C b) -> C a) -> C a callCC :: ((a -> C b) -> C a) -> C a callCC x1 x2 = x1 (\ c15 _ -> x2 c15) (\ c11 -> x2 c11) # Well, poor Djinn has a sweaty brow after deducing the code # for callCC so we had better quit. Djinn> :q Bye. To play with Djinn do a darcs get http://darcs.augustsson.net/Darcs/Djinn or get http://darcs.augustsson.net/Darcs/Djinn/Djinn.tar.gz Then just type make. (You need a Haskell 98 implementation and some libraries.) And then start djinn. For the curious, Djinn uses a decision procedure for intuitionistic propositional calculus due to Roy Dyckhoff. It's a variation of Gentzen's LJ system. This means that (in theory) Djinn will always find a function if one exists, and if one doesn't exist Djinn will terminate telling you so. This is the very first version, so expect bugs. :) Share and enjoy. -- Lennart

8 13

Call For Papers: APLAS 2009 (Korea, Dec 14-16, 2009)
by Zhenjiang Hu 09 Oct '09

09 Oct '09

=============================================================== FIRST CALL FOR PAPERS The Seventh Asian Symposium on Programming Languages and Systems (APLAS 2009) Seoul, December 14-16, 2009 http://ropas.snu.ac.kr/aplas09/ =============================================================== APLAS aims at stimulating programming language research by providing a forum for the presentation of recent results and the exchange of ideas and experience in topics concerned with programming languages and systems. APLAS is based in Asia, but is an international forum that serves the worldwide programming languages community. The APLAS series is sponsored by the Asian Association for Foundation of Software (AAFS), which has recently been founded by Asian researchers in cooperation with many researchers from Europe and the USA. The past formal APLAS symposiums were successfully held in Bangalore (2008, India), Singapore (2007), Sydney (2006, Australia), Tsukuba (2005, Japan), Taipei (2004, Taiwan) and Beijing (2003, China) after three informal workshops held in Shanghai (2002, China), Daejeon (2001, Korea) and Singapore (2000). Proceedings of the past symposiums were published in Springer-Verlag's LNCS 2895, 3302, 3780, 4279, and 5356. TOPICS: The symposium is devoted to both foundational and practical issues in programming languages and systems. Papers are solicited on, but not limited, to the following topics: * semantics, logics, foundational theory * type systems, language design * program analysis, optimization, transformation * software security, safety, verification * compiler systems, interpreters, abstract machines * domain-specific languages and systems * programming tools and environments INVITED SPEAKERS: TBA IMPORTANT DATES: Abstract Deadline: June 8 (Monday), 2009 Paper Submission Deadline: 24:00 AM (in Samoan Time), June 15 (Monday), 2009 Author Notification: August 17, 2009 Camera Ready: September 14, 2009 Conference: December 14-16, 2009 SUBMISSIONS INFORMATION: Papers should be submitted electronically online via the conference submission web page at URL <http://www.easychair.org/conferences/?conf=aplas2009>. Acceptable formats are PostScript or PDF, viewable by Ghostview or Adobe Reader. Submissions should not exceed 16 pages in LNCS format, including bibliography and figures. Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should clearly identify what has been accomplished and why it is significant. Submitted papers must be unpublished and not submitted for publication elsewhere. The proceedings of the symposium is planned to be published as a volume in Springer-Verlag's Lecture Notes in Computer Science series. Authors of selected papers will be invited after the symposium to submit a full version for publication in a special issue of New Generation Computing. GENERAL CHAIR Kwangkeun Yi (Seoul National University, Korea) PROGRAM CHAIR Zhenjiang Hu (National Institute of Inforamtics, Japan) PROGRAM COMMITTEE Manuel M. T. Chakravarty (University of New South Wales, Australia) Wei-Ngan Chin (National University of Singapore, Singapore) Nate Foster (University of Pennsylvania, USA) Ralf Hinze (Oxford University, United Kingdom) Zhenjiang Hu (National Institute of Informatics, Japan), Chair Ik-Soon Kim (Electronics and Telecommunications Research Institute, Korea) Julia Lawall (DIKU, Denmark) Sebastian Maneth (NICTA and University of New South Wales, Australia) Sungwoo Park (Pohang University of Science and Technology, Korea) G. Ramalingam (Microsoft Research, India) Peter Thiemann (University of Freiburg, Germany) Kazushige Terui (Kyoto University, Japan) Janis Voigtländer (Technical University of Dresden, Germany) Chung-chieh Shan (Rutgers University, USA) Kazunori Ueda (Waseda University, Japan) Bow-Yaw Wang (Academia Sinica, Taiwan) Jianjun Zhao (Shanghai Jiaotong University, China) POSTER CHAIR Kiminori Matsuzaki (University of Tokyo, Japan)

1 1

ANNOUNCE: vty-ui 0.1
by Jonathan Daugherty 01 Oct '09

01 Oct '09

vty-ui is: An extensible library of user interface widgets for composing and laying out Vty user interfaces. This library provides a collection of widgets and a type class for rendering widgets to Vty Images. Get it from Hackage: http://hackage.haskell.org/package/vty-ui Or get the source with darcs: http://repos.codevine.org/vty-ui This package is motivated by the desire to create terminal user interfaces easily without having to worry about doing all of the structural book-keeping that so often comes with such an approach. Future releases will probably include more widget composition tools, more interesting widgets, and helper code for building interesting things. For now, the library contains some basic widgets (including horizontal and vertical box layout) and a List widget. See the vty-ui-demo program and source for an interactive demonstration of the available widgets. Future releases may also address performance, as I honestly don't have a very clear idea of how well my approach is going to scale for non-trivial interfaces. Please don't hesitate to send patches, feedback, and criticism directly to me at drcygnus AT gmail DOT com. Lastly, thanks a ton to the authors of Vty. It's a pleasure to use. Enjoy! -- Jonathan Daugherty

2 1

ANNOUNCE: SourceGraph-0.5.0.0
by Ivan Lazar Miljenovic 29 Sep '09

29 Sep '09

SourceGraph [1] is a tool to statically analyse your Haskell code by applying graph-theoretic techniques on the call graph. It utilised the Graphalyze [2] library to do so, both of which were originally written as part of my Honours thesis last year [3]. [1] http://hackage.haskell.org/package/SourceGraph [2] http://hackage.haskell.org/package/Graphalyze [3] http://ivanmiljenovic.wordpress.com/2008/11/03/graph-theoretic-analysis-of-… I have been meaning to update SourceGraph since last year, but was waiting for improvements to the graphviz [4] library first. Now that these are done and I have fewer excuses, I've started to improve upon it. [4] http://hackage.haskell.org/package/graphviz When I first released SourceGraph last year, several people (e.g. Gwern) wanted support for CPP and command-line options. Unfortunately, I haven't yet gotten around to that; what I have done is added support for type classes and data structures, something I originally said I wasn't going to do. This support isn't perfect, especially when dealing with type classes from outside the scope of the code base, but in most cases works (except that the virtual instance functions don't always get positioned in the correct spots for some reason). The produced graphs are now also much prettier, with various colours and shapes being used. The useful features that SourceGraph offers include: * Visualisation of each module, the relations between modules and the entire code base. * Finds functions that are exported from a module that isn't in exposed in the .cabal file. * Alternate module splits. Please note that SourceGraph is _not_ a refactoring tool: it is designed to give you the programmer more information about what is in your code. I'd appreciate it if people could give SourceGraph a whirl and at least check how well the conversion from Haskell code to the graph is, as I'm not that sure how well I've converted haskel-src-ext's [5] internal state to SourceGraph's state. Please note that there are already various aspects that I know don't work properly; these can be found in the ParsingProblems.txt file (KnownProblems.txt contains other non-parsing problems that I'm aware of). In particular, TH, etc. aren't supported. [5] http://hackage.haskell.org/package/haskell-src-exts-1.1.4 To use SourceGraph after it's been installed, at a prompt do the following: > SourceGraph path/to/project.cabal The resulting report will then be found in a directory called "SourceGraph" in the same directory as the cabal file. -- Ivan Lazar Miljenovic Ivan.Miljenovic(a)gmail.com IvanMiljenovic.wordpress.com

2 3

Re: [Haskell-cafe] ANNOUNCE: Graphalyze-0.7.0.0
by Ivan Lazar Miljenovic 29 Sep '09

29 Sep '09

Eugene Kirpichov <ekirpichov(a)gmail.com> writes: > Ivan, could you please mention some examples of things you can do with > the library here in the mailing list? I am intrigued by the idea. Couldn't you wait until you read my announcement email for SourceGraph? :p Other ideas I had for this kind of analysis: * Examine the internal structure of a company/department/etc. in terms of the employee hierarchy. * Who-knows-who: analyse address books (whether it's traditional, email, Facebook, etc.); this is related to the six-degree problem. > > 2009/9/29 Ivan Lazar Miljenovic <ivan.miljenovic(a)gmail.com>: >> Graphalyze [1] is a library for using graph-theoretic techniques to >> analyse the relationships inherent within discrete data. It was >> originally written for my Honours thesis [2] last year, and I have now >> started updating it. >> >> [1] http://hackage.haskell.org/package/Graphalyze >> [2] http://ivanmiljenovic.wordpress.com/2008/11/03/graph-theoretic-analysis-of-… >> >> Graphalyze provides helper functions to import discrete data, analyse it >> using various algorithms (a dodgy term, I know, but I couldn't think of >> a better one) and then create a report with the results. >> >> The main changes since the previous version are: >> >> * The ability to have graphs with edge labels. >> >> * More of a focus on applying changes to the overall information state >> of the data rather than just extracting the graph and applying a >> function to it. >> >> * Usage of the updated features in the graphviz library >> (http://hackage.haskell.org/package/graphviz) to visualise graphs. >> >> Changes to come: >> >> * Re-do the reporting framework to use more of a pretty-printing >> approach and make it more customisable. >> >> -- >> Ivan Lazar Miljenovic >> Ivan.Miljenovic(a)gmail.com >> IvanMiljenovic.wordpress.com >> _______________________________________________ >> Haskell-Cafe mailing list >> Haskell-Cafe(a)haskell.org >> http://www.haskell.org/mailman/listinfo/haskell-cafe >> -- Ivan Lazar Miljenovic Ivan.Miljenovic(a)gmail.com IvanMiljenovic.wordpress.com

1 0

ANNOUNCE: Graphalyze-0.7.0.0
by Ivan Lazar Miljenovic 29 Sep '09

29 Sep '09

Graphalyze [1] is a library for using graph-theoretic techniques to analyse the relationships inherent within discrete data. It was originally written for my Honours thesis [2] last year, and I have now started updating it. [1] http://hackage.haskell.org/package/Graphalyze [2] http://ivanmiljenovic.wordpress.com/2008/11/03/graph-theoretic-analysis-of-… Graphalyze provides helper functions to import discrete data, analyse it using various algorithms (a dodgy term, I know, but I couldn't think of a better one) and then create a report with the results. The main changes since the previous version are: * The ability to have graphs with edge labels. * More of a focus on applying changes to the overall information state of the data rather than just extracting the graph and applying a function to it. * Usage of the updated features in the graphviz library (http://hackage.haskell.org/package/graphviz) to visualise graphs. Changes to come: * Re-do the reporting framework to use more of a pretty-printing approach and make it more customisable. -- Ivan Lazar Miljenovic Ivan.Miljenovic(a)gmail.com IvanMiljenovic.wordpress.com

1 0

ANNOUNCE: graphviz-2999.6.0.0
by Ivan Lazar Miljenovic 29 Sep '09

29 Sep '09

I'm pleased to announce version 2999.6.0.0 [1] of the graphviz library, which provides bindings to the GraphViz [2] suite of tools for drawing graphs. [1] http://hackage.haskell.org/package/graphviz-2999.6.0.0 [2] http://www.graphviz.org/ Changes since the previous version are: * Remove some Shape aliases and change capitalisation of others. * Properly parse and print IDs of clusters. * Allow NodeCluster values have node types different from the LNode they come from. Since the node type is only used for passing to the function to create the appropriate Attributes for that node, this can mean avoiding having to apply a transformation function before getting the attributes if you have a composite type for node value/cluster. -- Ivan Lazar Miljenovic Ivan.Miljenovic(a)gmail.com IvanMiljenovic.wordpress.com

1 0

ANN: rss2irc 0.4 released
by Simon Michael 27 Sep '09

27 Sep '09

I have released rss2irc 0.4, with some improvements from the field: - fix a problem connecting with irc.quakenet.org (Radoslav Dorcik) - feed polling now recovers from transient failures - can poll a local file: uri as well as remote uris - more robust new item detection, with some alternate strategies available - --idle option, waits for channel inactivity before announcing - limit individual field sizes, preventing too many irc messages per item - misc. output improvements - logging improvements - --delay now takes minutes, not seconds See hackage for more detail. Note the new contributor! Thanks Radoslav. home: http://hackage.haskell.org/package/rss2irc darcs repo: http://joyful.com/darcsweb/darcsweb.cgi?r=rss2irc I am currently using this to run hackagebot, darcscommitbot and other announce-bots on freenode. A tip: if you experiment, avoid joining the irc server too frequently; once per minute may be ok. Feedback and patches welcome. Best, -Simon

1 1

Sorry about the triple post
by Joe Fredette 26 Sep '09

26 Sep '09

Trying to work out how to make sendmail do what I want, my computer is a fickle beast. Also- it should be HWN issue 133. But I'm an idiot, and just copied the value without thinking. Someday, when I automate all the uploading/sending to the list business, this will not be an issue... :/ /Joe

1 0

Haskell Weekly News: Issue 131 - Semptember 25, 2009
by Joe Fredette 26 Sep '09

26 Sep '09

This week is an experiment, I'm eliminating the mail client from the sendout, and simply using sendmail directly. If this doesn't fix the line ending problem, then I'm pretty sure it's a software issue, and not a client issue. If you notice problems, please email me at this address, put [HWN] in the subject line so my filters will catch it. Please _don't_ email me if there are no problems. Thanks, /Joe --------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20090926 Issue 133 - September 26, 2009 --------------------------------------------------------------------------- Welcome to issue 133 of HWN, a newsletter covering developments in the [1]Haskell community. This week, we have a few new libraries, some interesting discussion about EDSLs, a comment from Oleg, and dons extolling the virtues of SCIENCE! On the new HWN software front, I've decided to jump right into something I had planned for far further down the development chain. Specifically, rather than scraping GMane for messages, I've been working on a way to grab the messages directly from the mailing-lists. I'm not entirely sure how I'm going to create links as they are now for the messages, but one crisis at a time. Till next week, here's the Haskell Weekly News! Announcements epoll bindings 0.2. Toralf Wittner [2]announced the release of epoll bindings 0.2 available [3]here. Epoll is an I/O event notification facility for Linux similar to poll but with good scaling characteristics. This release adds a buffer abstraction on top of the existing low-level bindings, so client code can write and read to buffers without having to deal directly with the underlying epoll event handling. diagrams 0.2.1, and planned major improvements. Brent Yorgey [4]announced version 0.2.1 of the diagrams library, available now on [5]Hackage. This minor release which fixes a few bugs and adds a few new combinators, most notably a grid layout combinator contributed by Ganesh Sittampalam. Workflow-0.5.5, TCache-0.6.4 RefSerialize-0.2.4. Alberto G. Corona [6]announced Workflow 0.5.5. Workflow provides a monad transformer that encapsulates any monad in a state monad that bring automatic state logging and recovery. A workflow can be viewed as a thread that persist across planeed or unplanned application shutdowns. When recovering the execution is resumed at the last action that was logged. The process continues at the same state as if not interruption took place. graphviz-2999.5.1.1. Ivan Lazar Miljenovic [7]announced version 2999.5.1.1 of the [8]graphviz library. This is another bug-fix release, fixing the problem spotted by Kathleen Fisher where Dot keywords need to be explicitly quoted if used as labels, etc. There is no change to the API. histogram-fill, library for creating histograms. Khudyakov Alexey [9]announced [10]histogram-fill. histogram-fill provides a generic and convenient API for making histograms. Features include, multiple simultaneous histogram creation, Immutable histograms, and Serialization to and from human readable text. Darcs Hacking Sprint - 14-15 November Vienna. Eric Kow [11]announced the third Darcs Hacking Sprint. Which will take place 14-15 November, 2009 at the University of Technology, Vienna, Austria. Anybody who wants to hack on Darcs (or Camp, Focal, SO6, etc) -- Beginners especially -- are welcome! 2nd CFP: TLDI 2010. Andrew Kennedy [12]announced a second call for papers for TLDI2010, the Types in Language Design and Implementation Workshop. darcs 2.3.1: better docs, fewer bugs. Reinier Lamers [13]announced a new stable version of darcs, with bugfixes from 2.3.0, improved documentation, and removal of the old autoconf build system. TFM09: Call for Participation (FMWeek, Eindhoven, November 2009). J.N. Oliveira [14]announced a Call for Participation in TFM2009 2nd Int. FME Conference on Teaching Formal Methods Friday, November 6th 2009, co-located with FM2009 : 16th Int. Symposium on Formal Methods Eindhoven, the Netherlands, November 2 - November 6, 2009. Discussion Monad Tutorial in C++. Adrian May [15]wrote a tutorial about monads in some other niche language... Beginning of a meta-Haskell. Oleg -- [16]as if he needs any introduction -- commented on things far above my ability to understand. Evidently, however, it involves extensible, modular interpreters in the ``tagless final'' style. It was a reply to an earlier thread [17]here. An issue with EDSLs in the ``finally tagless'' tradition. Brad Larsen [18]talked about his run in with [19]the expression problem while experimenting with EDSLs. Blog noise [20]Haskell news from the [21]blogosphere. Blog posts from people new to the Haskell community are marked with >>>, be sure to welcome them! * Bryan O'Sullivan: [22]Riddle me this. * David Amos: [23]Finite geometries, part 3: Points in PG(n,Fq). David's continuing series on Finite Geometries. * Neil Brown: [24]Concurrent Pearl: The Expanding Prime Pipeline. * Mikael Vejdemo Johansson (Syzygy-): [25][MATH198] Lecture 1 now online. Mikael's first Category Theory Lecture is up online. * Brent Yorgey: [26]diagrams 0.2.1, and future plans. * Alex McLean: [27]hackpact week 4. Part of the continuing series on Alex's hackpact progress. * Manuel M T Chakravarty: [28]Heads Up: GHC devs on Macs - GHC's testsuite crashes spotlight indexer on SL. * Clint Moore: [29]8 Cores of Awesome. * Bryan O'Sullivan: [30]Video of my CUFP keynote. * Chris Smith: [31]Thoughts on Hackage and the Haskell Platform. * Manuel M T Chakravarty: [32]Haskell Bindings to C -> c2hs. * Neil Brown: [33]Functions into processes, using arrows. * Brent Yorgey: [34]Functional MetaPost. * Malcolm Wallace: [35]Haskell Symposium 2009 - videos now online. * DEFUN 2009: [36]DEFUN and CUFP 2009 registration are now open!. * Chris Smith: [37]Type Classes With An Easier Example. * Darcs: [38]darcs weekly news #41. * Greg Bacon: [39]Haskell craps. * Bryan O'Sullivan: [40]A new pseudo-random number generator for Haskell. * Thomas M. DuBuisson: [41]HacPDX is Coming. * Dan Piponi (sigfpe): [42]More Parsing With Best First Search. * Osfameron: [43]Coin Tricks. Quotes of the Week * lilac: ponders whether unsafePerformIO would be better as simonSaysPerformIO * bos: [On the type signature of hPrintf] This makes me a sad Irish panda. * ksf: (But if (on the other hand)) (I think only a number in general (whether it be five or a hundred)) (this thought is rather the representation of a method (whereby a multiplicity (for instance a thousand) may be represented (in an image in conformity with a certain concept)) than the image itself. * dons: ah, via the magic of SCIENCE * dobblego: many of my colleagues used to be [fond of ruby] as well until I was let loose on them * dons: (on whether a library is wanted) *yes* put it on Hackage! * BMeph: (about parsec) 'Cause it's light-years ahead of the competition! * switch: Comeon people! You make the news! * ray: I think programmers make the worst programmers, also the worst people, and I'm saying this having not looked at programming reddit in a while. * Orclev: ... a lot of haskell still looks greek to me, and I'm not talking about lambdas. * Jason Dusek: "Some day, we're going to need a short, catchy name for Cabal packages. Let's call them cabbages." [see http://thread.gmane.org/gmane.comp.lang.haskell.cafe/63649] * Reinier Lamers: If we keep up the current pace of performance hacking, darcs will be complete before you even hit the enter key in a few years * Trent Buck: [To Reiner Lamers] With the appropriate (ie unbuffered) terminal, this is already the case for interactive prompts. About the Haskell Weekly News New editions are posted to [44]the Haskell mailing list as well as to [45]the Haskell Sequence and [46]Planet Haskell. [47]RSS is also available, and headlines appear on [48]haskell.org. To help create new editions of this newsletter, please see the information on [49]how to contribute. Send stories to jfredett . at . gmail . dot . com. The darcs repository is available at darcs get [50]http://patch-tag.com/r/HWN2/home . References 1. http://haskell.org/ 2. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63815 3. http://hackage.haskell.org/package/epoll 4. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63791 5. http://hackage.haskell.org/package/diagrams 6. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63786 7. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63770 8. http://hackage.haskell.org/package/graphviz-2999.5.1.1 9. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63640 10. http://hackage.haskell.org/package/histogram-fill 11. http://article.gmane.org/gmane.comp.lang.haskell.general/17511 12. http://article.gmane.org/gmane.comp.lang.haskell.general/17508 13. http://article.gmane.org/gmane.comp.lang.haskell.general/17507 14. http://article.gmane.org/gmane.comp.lang.haskell.general/17506 15. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/63800 16. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/63761 17. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/63751 18. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/63751 19. http://www.daimi.au.dk/~madst/tool/papers/expression.txt 20. http://planet.haskell.org/ 21. http://haskell.org/haskellwiki/Blog_articles 22. http://www.serpentine.com/blog/2009/09/25/riddle-me-this/ 23. http://haskellformaths.blogspot.com/2009/09/finite-geometries-part-3-points… 24. http://chplib.wordpress.com/2009/09/24/the-expanding-prime-pipeline/ 25. http://blog.mikael.johanssons.org/archive/2009/09/math198-lecture-1-now-onl… 26. http://byorgey.wordpress.com/2009/09/24/diagrams-0-2-1-and-future-plans/ 27. http://yaxu.org/hackpact-week-3-2/ 28. http://justtesting.org/post/195668539 29. http://www.l2mlogistics.com/2009/09/8-cores-of-awesome.html 30. http://www.serpentine.com/blog/2009/09/23/video-of-my-cufp-keynote/ 31. http://cdsmith.wordpress.com/2009/09/23/thoughts-on-hackage-and-the-haskell… 32. http://justtesting.org/post/194790750 33. http://chplib.wordpress.com/2009/09/22/functions-into-processes-using-arrow… 34. http://byorgey.wordpress.com/2009/09/21/functional-metapost/ 35. http://feedproxy.google.com/~r/malcolm/~3/wxsdwfUArJ8/haskell-symposium-200… 36. http://www.defun2009.info/blog/2009/06/defun-2009-registration-is-now-open/ 37. http://cdsmith.wordpress.com/2009/09/20/side-computations-via-type-classes/ 38. http://blog.darcs.net/2009/09/darcs-weekly-news-41.html 39. http://feedproxy.google.com/~r/gbacon/~3/QILx5EtQN4o/haskell-craps.html 40. http://www.serpentine.com/blog/2009/09/19/a-new-pseudo-random-number-genera… 41. http://tommd.wordpress.com/2009/09/19/hacpdx-is-coming/ 42. http://blog.sigfpe.com/2009/09/language-nomonomorphismrestrictiongener.html 43. http://greenokapi.net/blog/2009/09/19/coin-tricks/ 44. http://www.haskell.org/mailman/listinfo/haskell 45. http://sequence.complete.org/ 46. http://planet.haskell.org/ 47. http://sequence.complete.org/node/feed 48. http://haskell.org/ 49. http://haskell.org/haskellwiki/HWN 50. http://patch-tag.com/r/HWN2/home

1 0