- Haskell - Haskell.org

ANNOUNCE: SourceGraph-0.1 and Graphalyze-0.3
by Ivan Miljenovic 05 Oct '08

05 Oct '08

I've now uploaded my SourceGraph program to Hackage [1]. It's rather simple at the moment, but if you pass in the .cabal file as a parameter (e.g. run it as "SourceGraph Foo.cabal"), it will create in the same directory as the .cabal file a Directory called "SourceGraph" that contains an html report of some basic graph-theoretic analysis of your code. The output format isn't ideal, but it should serve it's purpose for now (I'll fix it up and actually make it usable once my Thesis has been handed in). What I'd appreciate if people could try it out and tell me if there's any code, etc. that it can't parse. At the moment, it ignores all Data-based functions (e.g. class and instance declarations as well as record functions) and only looks at "stand-alone" functions (i.e. normal functions). SourceGraph requires version 0.3 of my Graphalyze library (version 0.2 added the reports in, but had some bugs that 0.3 fixes). [1] http://hackage.haskell.org/cgi-bin/hackage-scripts/package/SourceGraph -- Ivan Lazar Miljenovic Ivan.Miljenovic(a)gmail.com IvanMiljenovic.wordpress.com

2 1

Haskell Weekly News: Issue 88 - October 4, 2008
by Brent Yorgey 04 Oct '08

04 Oct '08

--------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20081004 Issue 88 - October 04, 2008 --------------------------------------------------------------------------- Welcome to issue 88 of HWN, a newsletter covering developments in the [1]Haskell community. An extra-short HWN this week, so you get an extra ten minutes to do something else during the time you would have normally spent reading the HWN! HWN-editor-approved activities for your ten minutes include eating cookies, playing [2]Fantastic Contraption, and writing a type checker in the type system while eating cookies. Announcements Arch Haskell News: Oct 4 2008. Don Stewart [3]sent out the newest Arch Haskell news --- now with 609 Haskell packages! Announcing OneTuple-0.1.0. John Dorsey [4]announced the release of the ground-breaking [5]OneTuple library, which adds the long neglected one-tuple to Haskell. It also turns out that the denizens of Haskell-cafe are completely unable to refrain from turning jokes into long-winded technical discussions about strictness and lifted types. Haskell protocol-buffers version 0.3.1. Chris Kuklewicz [6]announced the release of [7]protocol-buffers 0.3.1, with some functionality also split off into [8]protocol-buffers-descriptor and [9]hprotoc. The 'hprotoc' compiler for proto files to Haskell source code now takes a "-u" command-line option. When given, this turns on code generation to support loading, storing, and saving unknown fields. Discussion Stacking monads. Andrew Coppin began a long [10]discussion on monads, monad transformers, Applicative, MonadPlus, and related topics. planning for ghc-6.10.1 and hackage. Duncan Coutts began a [11]discussion on how to make the transition to GHC 6.10 as painless as possible, especially as it relates to the new base-4 package and Cabal. Proposal #2629: Data.List: Replace nub; add nubOrd, nubInt, nubWith. Bart Massey [12]proposed refactoring nub into a 'nubWith' function which can be specialized to efficient versions for Int and Ord. Blog noise [13]Haskell news from the [14]blogosphere. * Luke Palmer: [15]Laziness and the monad laws. Luke explains why making a Functor or Monad instance too lazy can be just as bad as making it too strict. * Paul R Brown: [16]The Haskell Platform and Lessons Learned Elsewhere. * Eric Kow (kowey): [17]darcs weekly news #6. * Mads Lindstroem: [18]Overlapping Instances in Haskell. * >>> Bill Six: [19]Dabbling with Haskell. Bill explores palindromic pangrams using Haskell. Quotes of the Week * ozy`: [on RWH] most authors are like "FUNCTIONAL PROGRAMMING IS FUNCTIONAL!!!" whereas these guys are more like "yeah but practical programming is practical. map wash_dish dishes" * BMeph: * wants an "Everything I know about computing I learned from sigfpe" T-shirt * OlegFacts: Oleg can evaluate bottom. With his fists. * quicksilver: my computer starts to play 'Dies Irae' when shapr gets ops, automatically. About the Haskell Weekly News New editions are posted to [20]the Haskell mailing list as well as to [21]the Haskell Sequence and [22]Planet Haskell. [23]RSS is also available, and headlines appear on [24]haskell.org. To help create new editions of this newsletter, please see the information on [25]how to contribute. Send stories to byorgey at cis dot upenn dot edu. The darcs repository is available at darcs get [26]http://code.haskell.org/~byorgey/code/hwn/ . References 1. http://haskell.org/ 2. http://fantasticcontraption.com/ 3. http://article.gmane.org/gmane.comp.lang.haskell.cafe/45786 4. http://article.gmane.org/gmane.comp.lang.haskell.cafe/45586 5. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/OneTuple 6. http://article.gmane.org/gmane.comp.lang.haskell.libraries/10134 7. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/protocol-buffers 8. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/protocol-buffers… 9. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hprotoc 10. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/45634 11. http://thread.gmane.org/gmane.comp.lang.haskell.glasgow.user/15339 12. http://thread.gmane.org/gmane.comp.lang.haskell.libraries/10133 13. http://planet.haskell.org/ 14. http://haskell.org/haskellwiki/Blog_articles 15. http://luqui.org/blog/archives/2008/10/03/laziness-and-the-monad-laws/ 16. http://mult.ifario.us/p/the-haskell-platform-and-lessons-learned-elsewhere 17. http://koweycode.blogspot.com/2008/10/darcs-weekly-news-6.html 18. http://lindstroem.wordpress.com/2008/09/27/inheritance-in-composites-and-ov… 19. http://billsix.blogspot.com/2008/10/dabbling-with-haskell.html 20. http://www.haskell.org/mailman/listinfo/haskell 21. http://sequence.complete.org/ 22. http://planet.haskell.org/ 23. http://sequence.complete.org/node/feed 24. http://haskell.org/ 25. http://haskell.org/haskellwiki/HWN 26. http://code.haskell.org/~byorgey/code/hwn/

1 0

PEPM 2009 - final call for papers
by German Vidal 03 Oct '08

03 Oct '08

F I N A L C A L L F O R P A P E R S === P E P M 2009 === ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation http://www.clip.dia.fi.upm.es/Conferences/PEPM09 January 19-20, 2009 Savannah, Georgia, USA (Affiliated with POPL 2009) IMPORTANT DATES Abstract due: October 12, 2008 Submission: October 17, 2008 Author Notification: November 10, 2008 Camera-Ready Paper: November 17, 2008 SCOPE The PEPM Symposium/Workshop series aims at bringing together researchers and practitioners working in the areas of program manipulation, partial evaluation, and program generation. PEPM focuses on techniques, theory, tools, and applications of analysis and manipulation of programs. PEPM is classified as category A in the CORE ranking of ICT conferences. The 2009 PEPM workshop will be based on a broad interpretation of semantics-based program manipulation and continue last years' successful effort to expand the scope of PEPM significantly beyond the traditionally covered areas of partial evaluation and specialization and include practical applications of program transformations such as refactoring tools, and practical implementation techniques such as rule-based transformation systems. In addition, the scope of PEPM covers manipulation and transformations of program and system representations such as structural and semantic models that occur in the context of model-driven development. In order to reach out to practitioners, a separate category of tool demonstration papers will be solicited. Topics of interest for PEPM'09 include, but are not limited to: * Program and model manipulation techniques such as transformations driven by rules, patterns, or analyses, partial evaluation, specialization, program inversion, program composition, slicing, symbolic execution, refactoring, aspect weaving, decompilation, and obfuscation. * Program analysis techniques that are used to drive program/model manipulation such as abstract interpretation, static analysis, binding-time analysis, dynamic analysis, constraint solving, and type systems. * Analysis and transformation for programs/models with advanced features such as objects, generics, ownership types, aspects, reflection, XML type systems, component frameworks, and middleware. * Techniques that treat programs/models as data objects including meta-programming, generative programming, staged computation, and model-driven program generation and transformation. * Application of the above techniques including experimental studies, engineering needed for scalability, and benchmarking. Examples of application domains include legacy program understanding and transformation, domain-specific language implementations, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications, resource-limited computation, and security. We especially encourage papers that break new ground including descriptions of how program/model manipulation tools can be integrated into realistic software development processes, descriptions of robust tools capable of effectively handling realistic applications, and new areas of application such as rapidly evolving systems, distributed and webbased programming including middleware manipulation, model-driven development, and on-the-fly program adaptation driven by run-time or statistical analysis. SUBMISSION GUIDELINES, CATEGORIES, AND PROCEEDINGS Two submission categories will be considered. Regular Research papers must not exceed 10 pages in ACM Proceedings style. Tool Demonstration papers must not exceed 4 pages in ACM Proceedings style and they should include an appendix of up to 6 additional pages giving an outline, screenshots, examples, etc. to indicate the content of the proposed live demo at the workshop. At least one author of each accepted contribution must attend the workshop and present the work. In the case of tool demonstration papers, a live demonstration of the described tool is expected. Suggested topics, evaluation criteria, and writing guidelines for both research tool demonstration papers is available on the PEPM'09 Web-site. Papers should be submitted electronically via the workshop web site. The workshop proceedings will be published in the ACM Digital Library and hardcopies will be distributed at the workshop. A journal special issue dedicated to PEPM'09 including selected papers is under consideration. PROGRAM CO-CHAIRS German Puebla, Technical University of Madrid, Spain German Vidal, Technical University of Valencia, Spain PEPM 2009 PROGRAM COMMITTEE David Binkley, Loyola College, USA Radhia Cousot, CNRS, France Silvia Crafa, University of Padova, Italy Stephen A. Edwards, Columbia University, USA Lidia Fuentes, University of Malaga, Spain John P. Gallagher, Roskilde University, Denmark Thomas Jensen,IRISA, France Yukiyoshi Kameyama, University of Tsukuba, Japan Siau Cheng Khoo, National University of Singapore Julia Lawall, University of Copenhagen (DIKU), Denmark Shin-Cheng Mu, Academia Sinica, Taiwan Naoki Nishida, Nagoya University, Japan Maurizio Proietti, CNR, Italy Armin Rigo, Switzerland Simon Thompson, Kent University, UK Tarmo Uustalu, Tallinn University of Technology, Estonia Wim Vanhoof, Namur University, Belgium Joost Visser, Software Improvement Group, The Netherlands Janis Voigtlander, TU Dresden, Germany

1 0

Haskell Weekly News: Issue 87 - October 1, 2008
by Brent Yorgey 02 Oct '08

02 Oct '08

--------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20081001 Issue 87 - October 01, 2008 --------------------------------------------------------------------------- Welcome to issue 87 of HWN, a newsletter covering developments in the [1]Haskell community. ICFP was held last week in Victoria, and by all accounts was a great success! This edition of the HWN includes much ICFP and Haskell Symposium-related content, including [2]videos of the Haskell symposium presentations, [3]programming contest results, some [4]notes on the future of Haskell, and slides from [5]a Haskell tutorial and [6]a talk about the Haskell Platform. But ICFP didn't seem to slow down the community all that much: you'll find the usual mix of newly released and updated packages, blog posts, mailing list discussions, and silly quotes as well. Announcements Haskell-Embedded System Design: ForSyDe 3.0 and Tutorial. Alfonso Acosta [7]announced the [8]3.0 release of [9]ForSyDe. The ForSyDe (Formal System Design) methodology has been developed with the objective to move system design (e.g. System on Chip, Hardware and Software systems) to a higher level of abstraction. ForSyDe is implemented as a Haskell-embedded behavioral DSL (Domain Specific Language). The 3.0 release includes a new deep-embedded DSL and embedded compiler, as well as a new user-friendly tutorial. Graphalyze-0.1. Ivan Miljenovic [10]announced the initial release of his graph-theoretic analysis library, [11]Graphalyze. This is a pre-release of the library he is writing for his mathematics honours thesis, "Graph-Theoretic Analysis of the Relationships in Discrete Data". Symposium videos. Malcolm Wallace [12]announced [13]guerrilla videos of the Haskell Symposium 2008 presentations. ICFP programming contest results. Malcolm Wallace [14]sent a link to [15]a video of the ICFP programming contest results presentation. Version 0.4.3 of happs-tutorial is a HAppS job board, done in HAppS.. Thomas Hartman [16]announced version 4 of the [17]self-demoing HAppS tutorial, a HAppS job board. TH code for deriving Binary and NFData instances. Tim Newsham [18]announced some [19]Template Haskell code for automatically deriving Data.Binary and Control.Parallel.Strategies.NFData instances. Notes on the future of Haskell from ICFP. Bryan O'Sullivan [20]posted a [21]writeup from the ICFP conference floor on the future of Haskell and functional programming. datapacker 1.0.1. John Goerzen [22]announced the [23]release of datapacker 1.0.1. A Functional Implementation of the Garsia-Wachs Algorithm. Nicolas Pouillard [24]announced a [25]Haskell implementation of an algorithm that builds a binary tree with minimum weighted path length from weighted leaf nodes given in symmetric order. This can be used to build optimum search tables, to balance a 'ropes' data structure in an optimal way. graphviz-2008.9.20. Ivan Miljenovic [26]announced a new version of [27]Matthew Sackman's Haskell bindings to Graphviz. See Ivan's original announcement for information on what new features are included, and what the difference is among the various graphviz-related packages on Hackage. darcs 2.1.0pre2. Eric Kow [28]announced the release of darcs 2.1.0pre2, formerly known as 2.0.3. See Eric's announcement for a list of new features and bug fixes in this release. protocol-buffers-0.2.9 for Haskell is ready. ChrisK [29]announced the release of the [30]protocol-buffers package, which generates Haskell data types that can be converted back and forth to lazy ByteStrings that interoperate with Google's generated code in C++/Java/python. panda blog engine. Jinjing Wang [31]announced the release of [32]panda, a simple blog engine written in Haskell. OpenSPARC project applicant chosen. Duncan Coutts [33]announced that Ben Lippmeier has been chosen for the [34]OpenSPARC project. Ben will spend three months hacking on GHC to make it perform well on the latest multi-core OpenSPARC chips. Hugs on the iPhone. Alberto Galdo [35]announced that he has gotten Hugs to run on the iPhone, and has made packages available for others who would like to install it as well. Discussion Shooting yourself in the foot in Haskell. John Van Enk [36]asked how to shoot yourself in the foot with Haskell, with humorous results. Total Functional Programming in Haskell. Jason Dagit started a [37]discussion on total functional programming, Haskell, abstraction boundaries and the IO monad, and related topics. Health effects. Andrew Coppin told a [38]story about a chocolate bar and recursion, which led to a discussion of optimization problems, Dedekind cuts, some meta-discussion of the discussion, and entirely too many puns. The container problem. Andrew Coppin [39]asked about the possibility if abstracting over various sorts of containers in Haskell, and why there isn't a widely used library that does this. A discussion of various container libraries and the language issues that arise followed. Red-Blue Stack. Matthew Eastman [40]asked how to implement a certain data structure (red-blue stacks) in Haskell. Several people responded with increasingly clever solutions, and a comparison of mutating vs. non-mutating algorithms. Climbing up the shootout.... Don Stewart began a long and ongoing [41]discussion about improving Haskell's performance on benchmarks in the [42]Shootout, now that there is a quad core machine for running benchmarks! Line noise. Andrew Coppin started an [43]interesting discussion about perceptions of Haskell syntax by programmers who aren't familiar with it. Jobs London FP job in asset management. Michael Bott [44]announced an opportunity for two functional programmers based in London, with a software house specialising in asset management. Blog noise [45]Haskell news from the [46]blogosphere. * Creighton Hogg: [47]Some first steps with Data.Reactive. Creighton gives some simple examples of using Conal Elliott's Reactive library. More to come! * Bryan O'Sullivan: [48]Unix hacking in Haskell: better pseudoterminal support. * Creighton Hogg: [49]One last thought on laziness. In Creighton's opinion, laziness is the single hardest thing to get used to in Haskell. If you're learning Haskell, don't despair, break out the pencil and paper! * Douglas M. Auclair (geophf): [50]Animal as RDR, part III. * Neil Mitchell: [51]General Updates. * Don Stewart (dons): [52]Newest Mersenne Prime. Haskell doesn't even break a sweat computing the largest known prime number. * Douglas M. Auclair (geophf): [53]Animal as RDR, part II. * Bryan O'Sullivan: [54]Using Bloom filters for large scale gene sequence analysis in Haskell. A paper that Bryan and Ketil Malde submitted to PADL 09. "The Cliff's Notes version: Bloom filters are almost unused in bioinformatics; they're tremendously useful; and our Haskell code is really fast. * >>> Zubin Wadia: [55]Simon Peyton Jones & Microsoft Research Cambridge. Zubin thinks quite highly of SPJ and MSR Cambridge. * Bryan O'Sullivan: [56]Slides from my DEFUN 2008 Haskell tutorial. * Mads Lindstroem: [57]Inheritance in Composites and Overlapping Instances. * >>> Micah Cowan: [58]Adventures in Haskell. Micah shares some thoughts on learning Haskell. * Bryan O'Sullivan: [59]Some notes on the future of Haskell and FP. * Well-Typed.Com: [60]Slides from the Haskell Platform talk. * Paul Johnson: [61]Why the banks collapsed, and how a paper on Haskell programming can help stop it happening next time. * >>> Nathan Sanders: [62]Two weeks of Haskell. Nathan shares some thoughts on his first two weeks learning Haskell. * Bryan O'Sullivan: [63]Twittering from ICFP / Haskell symposium / CUFP. * Real-World Haskell: [64]Slides from ACCU talk. * Eric Kow (kowey): [65]darcs weekly news #5. * John Goerzen (CosmicRay): [66]New version of datapacker. * >>> James Cowie: [67]Haskell, the verdict!. James is impressed with Haskell after using it for a few weeks. * >>> Alex Combas: [68]What's all this fuss about Haskell?. Alex is thinking of learning Haskell in his spare time. * Aaron Tomb: [69]Parsing the Linux kernel with Haskell: experience with Language.C. Aaron is impressed by the new Language.C libraries, which parses all 18 million pre-processed lines of Linux kernel source with no problems! Quotes of the Week * Fuse_: Oh, sorry for hijacking mathematical purity with dirty fiscal dynamical systems. :o * mauke: <mauke> data Mushroom badger = Mushroom badger badger badger badger badger badger badger badger badger <leimy> where's the snake <mauke> deriving Snake * ddarius: higher order of lambdabot deployment and management engineers or HOLDME * Botje: #haskell: parallellising your homework answers! * olsner: most everything gives nicer everything than perl * Botje: fuzzy feelings aren't always aerodynamic, unfortunately. * chrisdone: benchmarks only exist to make fun of ruby * Claus Reinke: [on breaking code up into smaller bits] Once your readers understand your code, you can add the one-liner and ask for applause. * Jake Mcarthur: A fold by any other name would smell as sweet. * lispy: Schroedinger's cat is really in a thunk not a box * Bulat: Haskell was developed with goal to hide implementation details from egg-headed scientists and this obviously should have some drawbacks About the Haskell Weekly News New editions are posted to [70]the Haskell mailing list as well as to [71]the Haskell Sequence and [72]Planet Haskell. [73]RSS is also available, and headlines appear on [74]haskell.org. To help create new editions of this newsletter, please see the information on [75]how to contribute. Send stories to byorgey at cis dot upenn dot edu. The darcs repository is available at darcs get [76]http://code.haskell.org/~byorgey/code/hwn/ . References 1. http://haskell.org/ 2. http://haskell.org/haskellwiki/Video_presentations/Haskell_Symposium_2008 3. http://video.google.com/videoplay?docid=-4697764813432201693 4. http://www.serpentine.com/blog/2008/09/26/some-notes-on-the-future-of-haske… 5. http://www.serpentine.com/blog/2008/09/27/slides-from-my-defun-2008-haskell… 6. http://blog.well-typed.com/2008/09/slides-from-the-haskell-platform-talk/ 7. http://article.gmane.org/gmane.comp.lang.haskell.general/16443 8. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/ForSyDe 9. http://www.ict.kth.se/org/ict/ecs/sam/projects/forsyde/www/ 10. http://article.gmane.org/gmane.comp.lang.haskell.general/16442 11. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/Graphalyze 12. http://article.gmane.org/gmane.comp.lang.haskell.general/16440 13. http://haskell.org/haskellwiki/Video_presentations/Haskell_Symposium_2008 14. http://article.gmane.org/gmane.comp.lang.haskell.general/16438 15. http://video.google.com/videoplay?docid=-4697764813432201693 16. http://article.gmane.org/gmane.comp.lang.haskell.cafe/45332 17. http://happstutorial.com:5001/ 18. http://article.gmane.org/gmane.comp.lang.haskell.cafe/45305 19. http://www.thenewsh.com/~newsham/store/DeriveBinary.hs 20. http://article.gmane.org/gmane.comp.lang.haskell.cafe/45272 21. http://www.serpentine.com/blog/2008/09/26/some-notes-on-the-future-of-haske… 22. http://article.gmane.org/gmane.comp.lang.haskell.cafe/45185 23. http://changelog.complete.org/posts/760-New-version-of-datapacker.html 24. http://article.gmane.org/gmane.comp.lang.haskell.cafe/45002 25. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/garsia-wachs 26. http://article.gmane.org/gmane.comp.lang.haskell.cafe/44863 27. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/graphviz 28. http://www.haskell.org//pipermail/haskell-cafe/2008-September/048094.html 29. http://article.gmane.org/gmane.comp.lang.haskell.cafe/44845 30. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/protocol-buffers 31. http://article.gmane.org/gmane.comp.lang.haskell.cafe/44840 32. http://jinjing.blog.easymic.com/ 33. http://article.gmane.org/gmane.comp.lang.haskell.cafe/44836 34. http://haskell.org/opensparc/ 35. http://www.haskell.org//pipermail/haskell-cafe/2008-September/047838.html 36. http://www.haskell.org//pipermail/haskell-cafe/2008-October/048506.html 37. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/45393 38. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/45370 39. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/45242 40. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/45122 41. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/44916 42. http://shootout.alioth.debian.org/u64q/benchmark.php?test=all&lang=all 43. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/44886 44. http://article.gmane.org/gmane.comp.lang.haskell.cafe/45506 45. http://planet.haskell.org/ 46. http://haskell.org/haskellwiki/Blog_articles 47. http://abstractabsurd.blogspot.com/2008/09/some-first-steps-with-datareacti… 48. http://www.serpentine.com/blog/2008/09/30/unix-hacking-in-haskell-better-ps… 49. http://abstractabsurd.blogspot.com/2008/09/one-last-thought-on-laziness.html 50. http://logicaltypes.blogspot.com/2008/09/animal-as-rdr-part-iii.html 51. http://neilmitchell.blogspot.com/2008/09/general-updates.html 52. http://www.cse.unsw.edu.au/~dons/blog/2008/09/30#primes 53. http://logicaltypes.blogspot.com/2008/09/animal-as-rdr-part-ii.html 54. http://www.serpentine.com/blog/2008/09/28/using-bloom-filters-for-large-sca… 55. http://zwadia.com/?p=58 56. http://www.serpentine.com/blog/2008/09/27/slides-from-my-defun-2008-haskell… 57. http://lindstroem.wordpress.com/2008/09/27/inheritance-in-composites-and-ov… 58. http://micah.cowan.name/2008/09/26/computers/software-development/adventure… 59. http://www.serpentine.com/blog/2008/09/26/some-notes-on-the-future-of-haske… 60. http://blog.well-typed.com/2008/09/slides-from-the-haskell-platform-talk/ 61. http://paulspontifications.blogspot.com/2008/09/why-banks-collapsed-and-how… 62. http://sandersn.com/blog/index.php?title=two_weeks_of_haskell 63. http://www.serpentine.com/blog/2008/09/25/twittering-from-icfp-haskell-symp… 64. http://www.realworldhaskell.org/blog/2008/09/25/slides-from-accu-talk/ 65. http://koweycode.blogspot.com/2008/09/darcs-weekly-news-5.html 66. http://changelog.complete.org/posts/760-New-version-of-datapacker.html 67. http://www.jcowie.co.uk/2008/09/haskell-the-verdict/ 68. http://combas3d.com/2008/09/whats-all-this-fuss-about-haskell/ 69. http://www.galois.com/blog/2008/09/17/parsing-the-linux-kernel-with-haskell… 70. http://www.haskell.org/mailman/listinfo/haskell 71. http://sequence.complete.org/ 72. http://planet.haskell.org/ 73. http://sequence.complete.org/node/feed 74. http://haskell.org/ 75. http://haskell.org/haskellwiki/HWN 76. http://code.haskell.org/~byorgey/code/hwn/

1 0

TLDI 2009: call for papers
by Amal Ahmed 01 Oct '08

01 Oct '08

[Just a quick reminder that the TLDI deadline is Oct 8th...] ********************************************************************* CALL FOR PAPERS TLDI 2009 ACM SIGPLAN Workshop on Types in Language Design and Implementation 24 January 2009 Savannah, Georgia, USA To be held in conjunction with POPL 2009 http://ttic.uchicago.edu/~amal/tldi2009/ ********************************************************************* IMPORTANT DATES Submission: 8 Oct 2008, 5PM EDT (Wed) Notification: 8 Nov 2008 (Sat) Camera ready: 19 Nov 2008 (Wed) TLDI'09: 24 January 2009 (Sat) SCOPE The role of types and proofs in all aspects of language design, compiler construction, and software development has expanded greatly in recent years. Type systems, type analyses, and formal deduction have led to new concepts in compilation techniques for modern programming languages, verification of safety and security properties of programs, program transformation and optimization, and many other areas. In light of this expanding role of types, the ACM SIGPLAN Workshop on Types in Language Design and Implementation (TLDI'09) follows six previous International Workshops on types in compilation and language design (TIC'97, TIC'98, TIC'00, TLDI'03, TLDI'05, and TLDI'07), with the hope of bringing together researchers to share new ideas and results in this area. Submissions for this event are invited on all interactions of types with language design, implementation, and programming methodology. This includes both practical applications and theoretical aspects. TLDI'09 specifically encourages papers from a broad field of programming language and compiler researchers, including those working in object-oriented, dynamically-typed, late-binding, systems programming, and mobile-code paradigms, as well as traditional fully-static type systems. Topics of interest include: - Typed intermediate languages and type-directed compilation - Type-based language support for safety and security - Types for interoperability - Type systems for system programming languages - Type-based program analysis, transformation, and optimization - Dependent types and type-based proof assistants - Types for security protocols, concurrency, and distributed computing - Type inference and type reconstruction - Type-based specifications of data structures and program invariants - Type-based memory management - Proof-carrying code and certifying compilation This is not meant to be an exhaustive list; papers on novel utilizations of type information are welcome. Authors concerned about the suitability of a topic are encouraged to inquire via electronic mail to the program chair prior to submission. SUBMISSION GUIDELINES Authors should submit a full paper of no more than 12 pages (including bibliography and appendices) by Wednesday, October 8, 2008 5PM Eastern Daylight Savings Time. The submission deadline and length limitations are firm. Submissions that do not meet these guidelines will not be considered. All submissions should be in standard ACM SIGPLAN conference format: two columns, nine-point font on a ten-point baseline. Detailed formatting guidelines are available on the SIGPLAN Author Information page, along with a LaTeX class file and template: http://www.sigplan.org/authorInformation.htm Papers must be submitted in Adobe Portable Document Format (PDF) and must be formatted for US Letter size (8.5"x11") paper. Authors for whom this is a hardship should contact the program chair before the deadline. Submitted papers must adhere to the SIGPLAN Republication Policy: http://www.sigplan.org/republicationpolicy.htm Submissions should contain original research not published or submitted for publication elsewhere. The URL for submission will be announced closer to the deadline. GENERAL CHAIR Andrew Kennedy Microsoft Research, Cambridge PROGRAM CHAIR Amal Ahmed Toyota Technological Institute, Chicago PROGRAM COMMITTEE Amal Ahmed Toyota Technological Institute, Chicago (Chair) Juan Chen Microsoft Research Peter Dybjer Chalmers University of Technology Jeff Foster University of Maryland, College Park Neal Glew Intel Robert Harper Carnegie Mellon University Andrew Myers Cornell University Atsushi Ohori Tohoku University Matthew Parkinson University of Cambridge Didier Remy INRIA Paris-Rocquencourt Andreas Rossberg Max Planck Institute for Software Systems STEERING COMMITTEE Craig Chambers University of Washington Robert Harper Carnegie Mellon University (Chair) Xavier Leroy INRIA Paris-Rocquencourt Greg Morrisett Harvard University George Necula Rinera Networks and UC Berkeley Atsushi Ohori Tohoku University Francois Pottier INRIA Paris-Rocquencourt Zhong Shao Yale University

1 0

ANN: Haskell-Embedded System Design: ForSyDe 3.0 and Tutorial
by Alfonso Acosta 01 Oct '08

01 Oct '08

Hi everyone, I am glad to announce the 3.0 release of ForSyDe's implementation, now available from HackageDB. The ForSyDe (Formal System Design) methodology has been developed with the objective to move system design (e.g. System on Chip, Hardware and Software systems) to a higher level of abstraction. ForSyDe is implemented as a Haskell-embedded behavioral DSL (Domain Specific Language). >From this release, ForSyDe includes a new deep-embedded DSL and embedded compiler. We have also published tutorial which should be much more user-friendly than the Haddock documentation and the ForSyDe research papers. ForSyDe includes two DSL flavours which offer different features: 1) Deep-embedded DSL (ForSyDe.Signal) Deep-embedded signals, based on the same concepts as Lava, are aware of the system structure. Based on that structural information ForSyDe's embedded compiler, can perform different analysis and transformations. o Thanks to Template Haskell, computations are expressed in Haskell, not needing to specifically design a DSL for that purpose. o Embedded compiler backends: + Simulation + VHDL (with support for Modelsim and Quartus II) + GraphML (with yFiles graphical markup support.) o Synchronous model of computation. o Support for components. o Support for fixed-sized vectors à la VHDL. 2) Shallow-embedded DSL (ForSyDe.Shallow.Signal) Shallow-embedded signals are modeled as streams of data isomorphic to lists. Systems built with them are unfortunately restricted to simulation, however, shallow-embedded signals provide a rapid-prototyping framework with which to experiment with Models of Computation (MoCs). o Synchronous MoC. o Untimed MoC. o Continuous Time MoC. o Domain Interfaces allow connecting various subsystems with different timing (domains) regardless of their MoC. o Deep-embedded models can be integrated through simulation. Links ==== ForSyDe website: http://www.ict.kth.se/org/ict/ecs/sam/projects/forsyde/www/ ForSyDe tutorial: http://www.ict.kth.se/org/ict/ecs/sam/projects/forsyde/www/files/tutorial/t… HackageDB package page: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/ForSyDe Darcs repository: darcs get http://www.ict.kth.se/org/ict/ecs/sam/projects/forsyde/www/darcs/ForSyDe/

2 1

ANNOUNCE: Graphalyze-0.1
by Ivan Miljenovic 29 Sep '08

29 Sep '08

I'd like to announce the initial release of my graph-theoretic analysis library, Graphalyze [1], the darcs repo for which is also available [2]. This is a pre-release of the library that I'm writing for my mathematics honours thesis, "Graph-Theoretic Analysis of the Relationships in Discrete Data". I'll also be releasing a tool that uses this library to analyse the structure of Haskell code, that I'm tentatively calling SourceGraph. As it stands, the library has a number of algorithms included, some of which I've developed from scratch (e.g. clique finder), and others are implementations of published algorithms (mainly the two clustering algorithms). The code is meant to be more readable than efficient, and I wanted to explore ways of developing algorithms that match more closely the way graphs work (which makes FGL a much nicer fit than matrix-based or list-based graph data structures). This library is only a pre-release, as whilst everything in there works (at least it does for me), I'd like to get some feedback from the community, especially since this is my first ever released solo piece of code (I've coded assignments, and worked on projects with others, but have never released anything that I've been solely responsible for before). In particular, have I written the .cabal file correctly? Also, I'd like advice on something else: the part of the library that I'd like to develop still is the reporting framework. The end goal of the library is for the user to specify which algorithms they want applied to their data, and then the library produces a document with the results. This document is _not_ meant to be machine readable. As such, I can think of three options: 1) Plain text, with graphs either in seperate image files (using graphviz) or else as plaintext (FGL's show function). 2) Generate LaTeX code. 3) Generate Pandoc [3] compatible Markdown, and let the user convert it into whatever format they prefer. I'm not a big fan of option 1), as it is probably the most unreadable in general. I'd like to use Pandoc, as it is theoretically possible to convert it to numerous other filetypes, however with inline linking there's still no way (at least I can find) to have images scaled to the correct size automatically. So unless I pre-scale the images, using option 3) and then converting to PDF via LaTex generation of the Markdown sources is probably out. As such, what would you all prefer to read as a documentation-style report of your software? 1) A PDF via LaTeX, which has the advantage of being printable and all in one file 2) HTML via Pandoc, which lets you have the images linked separately from the document, and thus no need to shrink them down (they can stay at the natively generated size, and thus easier to zoom in, etc.). Finally, I'll be giving my honours talk on this next Monday. So if you're in Brisbane on 6 October and interested, it'll be on at 2PM at the University of Queensland (where as part of it I'll be explaining to mathematicians why Haskell is a great language to use for mathematics... or at least trying to!). [1] http://hackage.haskell.org/cgi-bin/hackage-scripts/package/Graphalyze [2] http://code.haskell.org/Graphalyze/ [3] http://johnmacfarlane.net/pandoc -- Ivan Lazar Miljenovic Ivan.Miljenovic(a)gmail.com IvanMiljenovic.wordpress.com

1 0

Symposium videos
by Malcolm Wallace 27 Sep '08

27 Sep '08

Guerilla videos of the Haskell Symposium 2008 presentations. Enjoy. Regards, Malcolm

2 1

ICFP programming contest results
by Malcolm Wallace 24 Sep '08

24 Sep '08

The ICFP programming contest results presentation: http://video.google.com/videoplay?docid=-4697764813432201693 Feel free to pass on this link to any other appropriate forum. Regards, Malcolm

1 0

ANNOUNCE: graphviz-2008.9.20
by Ivan Miljenovic 21 Sep '08

21 Sep '08

The latest version of Matthew Sackman's Haskell bindings to Graphviz [1] are now available on Hackage [2]. The reason there's a new release only two weeks after the previous one is that I've made some extensions to it (hence why I'm writing the announcement) that Matthew has kindly included. Since Matthew doesn't recall writing an announcement for graphviz before, here is a brief synopsis of what it does. The Graphviz program is probably _the_ way of drawing graphs (note: this is graph-theory graphs, not function plotting). As it stands, there are currently at least four different Haskell bindings available for Graphviz that I've managed: * The inbuilt Graphviz module in FGL [3] * graphviz (which this announcement is for) * dotgen [4] * A really simple generator by Duncan Coutts [5] In addition to this, the following utilities on Hackage output graphs in Graphviz's .dot format (either using one of the above libraries or their own parser): * prof2dot : converts profiling information to .dot [custom, I think] [6] * flow2Dot : convert textual descriptions to .dot [also custom, I think] [7] * graphmod : draw the dependencies between Haskell modules [uses dotgen] [8] As it can be seen, there's a plethora of possible ways of creating .dot graphs in Haskell. What seperates the graphviz package from the others is: * It uses FGL graphs, rather than passing through lists of nodes and edges manually (of course, if you're not doing any other graph-related activity you might not want to use an FGL graph), whilst providing more control than the default FGL module. * A large list of attributes that can be used are available: http://hackage.haskell.org/packages/archive/graphviz/2008.9.20/doc/html/Dat… * A "sane" interface that provides a large degree of customizability (don't specify the attributes manually for each node/edge/etc., just pass through a function that will create the attribute you want). * Limited parsing of .dot format (note that as yet it can't convert a parsed DotGraph into an FGL graph). * The graphToGraph function allows you to pass a graph through Graphviz and then extract out positional information and combine it with the original graph. There are some things things that graphviz can't do, such as drawing undirected graphs and clusters (which dotgen can)... at least until now. The changes that I have made provide the additional functionality to graphviz: * Differentiate between undirected and directed graphs. Whilst FGL represents undirected graphs with a directed graph by duplicating all edges (an undirected edge {1,2} is represented by the two edges (1,2) and (2,1)), you don't really want to draw a graph this way. Furthermore, many reports say that graphviz's "neato" command is better at drawing undirected graphs than the normal "dot" command is. Thus, graphviz will now draw only one edge out of every directed pair. To do so, however, requires that the edge labels are an instance of Ord: if this is a problem for you, please contact either Matthew or myself and we'll see what else we can do (this is required because it's assumed that if two edges (1,2) and (2,1) are meant to represent the undirected edge {1,2}, then their labels must be the same). * Add clustering support. Graphs can be drawn (but as yet not parsed) to provide nested clustering support to arbitrary depth. To do so, you need to provide a function (LNode a -> NodeCluster c a), where NodeCluster is the following recursive data type that indicates in which subcluster a node in the graph belongs: data NodeCluster c a = N (LNode a) | C c (NodeCluster c a) The c type represents the cluster label, and is the parameter by which cluster attributes are assigned. Note that c has to be an instance of Ord. Clusters are not parseable, because there's no clear way of how to convert a cluster to an FGL graph. The interface for graphviz remains unchanged, so you can safely upgrade to this version. Here is an example function of how the library can be used to draw an FGL graph to a (very plain) Graphviz graph (well, it will convert it to the DotGraph datatype, which when shown produces the .dot graph code): graphviz :: (Graph g, Show a, Ord b, Show b) => String -> g a b -> DotGraph graphviz title g = graphToDot g attrs nattrs eattrs where attrs = [Label title] nattrs (_,a) = [Label (show a)] eattrs (_,_,b) = [Label (show b)] Enjoy! [1] http://graphviz.org/ [2] http://hackage.haskell.org/cgi-bin/hackage-scripts/package/graphviz [3] http://hackage.haskell.org/cgi-bin/hackage-scripts/package/fgl [4] http://hackage.haskell.org/cgi-bin/hackage-scripts/package/dotgen [5] http://haskell.org/~duncan/WriteDotGraph.hs [6] http://hackage.haskell.org/cgi-bin/hackage-scripts/package/prof2dot [7] http://hackage.haskell.org/cgi-bin/hackage-scripts/package/flow2dot [8] http://hackage.haskell.org/cgi-bin/hackage-scripts/package/graphmod -- Ivan Lazar Miljenovic Ivan.Miljenovic(a)gmail.com IvanMiljenovic.wordpress.com

3 3