- Haskell - Haskell.org

ANN: random-access-list-0.1
by Stephan Friedrichs 11 Jun '08

11 Jun '08

Hello, I've implemented Chris Okasaki's random-access list[1] which provides typical list operations (cons, head, tail) in O(1) and yet offers indexed random-access in O(log n). It's uploaded on hackage[2]. It's still an early version which I'll extend, but especially at this eary stage I'd appreciate your feedback concerning what's still missing / to be fixed / to be improved. Regards, Stephan [1] Chris Okasaki: "Purely Functional Data Structures" [2] http://hackage.haskell.org/cgi-bin/hackage-scripts/package/random-access-li… -- Früher hieß es ja: Ich denke, also bin ich. Heute weiß man: Es geht auch so. - Dieter Nuhr

1 0

Haskell Weekly News: Issue 72 - June 11, 2008
by Brent Yorgey 11 Jun '08

11 Jun '08

--------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20080611 Issue 72 - June 11, 2008 --------------------------------------------------------------------------- Welcome to issue 72 of HWN, a newsletter covering developments in the [1]Haskell community. Greetings, Haskellites! As many of you have already heard, Don Stewart has passed on the editorship of the HWN to me (Brent Yorgey). I'd like to thank Don and John Goerzen for their great work putting it together in the past, and I'm excited to make the HWN once again into a reliable, useful compendium of happenings in the Haskell community. You can expect to see a few changes---for example, hackage uploads will no longer be listed in the HWN (unless they are announced on the haskell or haskell-cafe mailing lists), since you can now see a dynamically updated list on the front page of the Haskell wiki. This edition includes all the announcements going back to Issue 71, but only some of the blog posts, since I couldn't find a way to get old feed data from Planet Haskell. Hopefully next week things will settle down to something more normal(ish) and I can begin tinkering with the format. Feel free to send suggestions and/or stories for inclusion to me, byorgey at gmail dot com. Enjoy---'Putting the W back in HWN!' Announcements hfann. Olivier Boudry [2]announced the first release of the [3]hfann module, an interface to the [4]'Fast Artificial Neural Network (FANN)' library. funsat. Denis Bueno [5]announced a release of [6]funsat, a modern, DPLL-style SAT solver written in Haskell. Funsat solves formulas in conjunctive normal form and produces a total variable assignment for satisfiable problems. DEFUN08: Call for talks and tutorials. Matthew Fluet [7]announced the final call for talks and tutorials at [8]DEFUN 2008, to be held in conjunction with [9]ICFP. Cabal-1.4 Release Candidate. Duncan Coutts [10]announced the second release candidate for [11]Cabal-1.4. Programmer's Minesweeper. Bertram Felgenhauer [12]announced a Haskell implementation of [13]Programmer's Minesweeper, which allows programmers to implement minesweeper strategies and run them. hackage RSS feed. Don Stewart [14]announced a new [15]RSS feed for the most recently uploaded packages on [16]Hackage. BLAS bindings. Patrick Perry [17]announced a set of bindings for the [18]BLAS linear algebra library. Xen Control bindings. Thomas DuBuisson [19]announced the [20]hsXenCtrl package, with FFI bindings to [21]Xen. bloomfilter. Bryan O'Sullivan [22]announced the availability of a fast Bloom filter library for Haskell. A Bloom filter is a probabilistic data structure that provides a fast set membership querying capability. It does not give false negatives, but has a tunable false positive rate. HCAR. Janis Voigtlaender [23]announced the 14th edition of the [24]Haskell Community and Activities Report (HCAR). HSmugMug. Daniel Patterson [25]announced [26]HSmugMug, a Haskell wrapper to the photo hosting site [27]SmugMug's API. LIPL. Sam Lee [28]announced the release of [29]LIPL, a tiny functional language implemented as a term project to learn Haskell. Glome 0.51. Jim Snow [30]announced version 0.51 of [31]glome, a raytracer written in Haskell. ChessLibrary. Andrew Wagner [32]announced the [33]ChessLibrary project, and mentioned that he is looking for an experienced haskeller to serve as a mentor for this project. xmonad-utils. Gwern Branwen [34]announced the upload to hackage of [35]xmonad-utils, a couple of small Xlib programs which might be useful for xmonad users. Roguestar. Christopher Lane Hinson [36]announced the release of [37]Roguestar 0.2, a science fiction themed roguelike (turn-based, chessboard-tiled, role playing) game written in Haskell. Streaming Component Combinators. Mario Blazevic [38]announced the 0.1 release of [39]Streaming Component Combinators in Haskell, based on earlier work done in [40]OmniMark. Twitter client. Chris Eidhof [41]announced a simple [42]terminal-based Twitter client. Monad.Reader call for copy. Wouter Swierstra [43]issued a call for copy for [44]The Monad.Reader. The submission deadline for Issue 11 is August 1. category-extras. Edward Kmett [45]announced a new release of the [46]category-extras package, involving all sorts of new categorical goodness. Session Types for Haskell. Matthew Sackman [47]announced the availability of [48]Session Types for Haskell. Session types are a means of describing communication between multiple threads, and statically verifying that the communication being performed is safe and conforms to the specification. Haddock 2.1.0. David Waern [49]announced the release of [50]Haddock 2.1.0. ReviewBoard. Adam Smyczek [51]announced the release of [52]Haskell bindings to [53]ReviewBoard, a development tool designed to monitor code changes and analyze dependencies. diagrams. Brent Yorgey [54]announced the initial release of [55]Graphics.Rendering.Diagrams, an embedded domain-specific language for creating simple pictures and diagrams, built on top of the Cairo vector graphics library. HXT. Uwe Schmidt [56]announced a new release of the [57]Haskell XML Toolbox. GSoC. Malcolm Wallace [58]announced the seven student projects chosen to be funded by the [59]Google Summer of Code. bytestring. Don Stewart [60]announced a new major release of [61]bytestring, the efficient string library for Haskell, suitable for high-performance scenarios. HXQ. Leonidas Fegaras [62]announced the release of [63]HXQ, an [64]XQuery compiler/interpreter for Haskell. Win32-notify. Niklas Broberg [65]announced the first release of [66]Win32-notify, an inotify-alike for Windows. cpuid. Martin Grabmueller [67]announced the new [68]cpuid package, which provides functionality for accessing information about the currently running IA-32 processor. Emping. Hans van Thiel [69]announced version 0.5 of the [70]Emping package, a utility which derives the shortest rules from a table of rules. datapacker. John Goerzen [71]announced the first release of [72]datapacker, a tool to pack files into a minimum number of CDs, DVDs, or any other arbitrary bin. darcswatch. Joachim Breitner [73]announced the release of [74]darcswatch, a tool for tracking darcs patches and repositories. Generic Haskell. Thomas van Noort [75]announced the fifth release of [76]Generic Haskell, an extension of Haskell that facilitates generic programming. drawingcombinators. Luke Palmer [77]announced the release of [78]graphics-drawingcombinators, a wrapper around OpenGL with a functional interface. The Monad.Reader. Wouter Swierstra [79]announced the publication of Issue 10 of [80]The Monad.Reader, a quarterly magazine about functional programming. Well-Typed LLP. Ian Lynagh [81]announced that he, Björn Bringert and Duncan Coutts have set up a Haskell consultancy company, [82]Well-Typed LLP. Their services include application development, library and tool maintenance, project advice, and training. hgdbmi. Evan Martin [83]announced the [84]hgdbmi package, which wraps the operations of attaching GDB to a process and parsing the GDB/MI output. xmonad. Don Stewart [85]announced the release of [86]xmonad version 0.7. Updates include improved integration with GNOME, more flexible "rules", various stability fixes, and of course, many new and interesting features in the extension library. Haskell Server Pages. Niklas Broberg [87]announced a new release of [88]Haskell Server Pages, a programming model for writing dynamic web pages in Haskell, both server-side and client-side. Network.MiniHTTP. Adam Langley [89]announced a release of [90]network-minihttp, a small bytestring HTTP library. Disciplined Disciple Compiler. Ben Lippmeier [91]announced the initial alpha release of the [92]Disciplined Disciple Compiler, an explicitly lazy dialect of Haskell. haskell-src-exts. Niklas Broberg [93]announced a new release for [94]haskell-src-exts, a package for handling and manipulating Haskell source code. omnicodec. Magnus Therning [95]announced the package [96]omnicodec, containing two command line utilities for encoding and decoding data. Blog noise [97]Haskell news from the [98]blogosphere. * [99]Christophe Poucet (vincenz): ICFP Contest 2008 * [100]Real-World Haskell: CUFP 2007 videos now easier to view * [101]Wrap-up: mergesort in haskell * [102]jbofihe and Haskell * [103]Writing a Regular Expression parser in Haskell: Part 3 * [104]Real World Haskell * [105]London Haskell Users Group: Next meeting: Paradise, a DSEL for derivatives pricing * [106]Christophe Poucet (vincenz): Lazy memoization * [107]Neil Mitchell: GSoC Hoogle: Week 2 * [108]Magnus Therning: Google Treasure Hunt primes question * [109]Roman Cheplyaka: Status report: week 2 * [110]Andy Gill: The unknown cost of dictionaries * [111]Edward Kmett: Zapping Adjunctions * [112]Edward Kmett: Representing Adjunctions * [113]Andy Gill: Performance problems with functional representation of derivatives * [114]Conal Elliott: Functional linear maps Quotes of the Week * roconnor: if you click your heels and say ``there is no binding like gtk2hs'' then dcoutts will appear and answer your question. * mauke: the first rule of fix club is "the first rule of fix club is "the first rule of fix club is... * oerjan: so does this mean that a comonad is like a wildlife preserve on an island in a sea of nuclear waste? * quicksilver: head-explosion is the solution, not the problem. * Botje: [on googling for polyvariadic typeclasses] OH GOD THE FIRST HIT IS OLEGS SITE! / *ahum* / I meant, "yay, reading material" * Baughn: From my point of view, anyone who understands everything ghc can do is /scary/. I'm sure that will change once I reach that level myself, but then again, there's also the possibility that I'll be in a permanent state of autophobia. * newsham: I think the problem with people asking homework questions in this channel is that the people in this channel don't have enough homework questions of their own to do. * quicksilver: *** quicksilver beats Deewiant with the i-will-not-use-fail-stick [Deewiant] quicksilver: I'm willing to accept a good alternative. [quicksilver] no. all you are permitted to accept is a beating. * mar77a: MONAD ARGHH GHGRHGH HGHRGHR RUN * Cale: Types are a bit like the nubs on lego bricks which provide structural integrity while suggesting how the bricks should fit together. * quicksilver: zip`ap`tail the aztec god of consecutive numbers About the Haskell Weekly News New editions are posted to [115]the Haskell mailing list as well as to [116]the Haskell Sequence and [117]Planet Haskell. [118]RSS is also available, and headlines appear on [119]haskell.org. Headlines are available as [120]PDF. To help create new editions of this newsletter, please see the [121]contributing information. Send stories to byorgey at gmail dot com. The darcs repository is available at darcs get [122]http://code.haskell.org/~byorgey/code/hwn/ References 1. http://haskell.org/ 2. http://article.gmane.org/gmane.comp.lang.haskell.cafe/41154 3. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hfann 4. http://leenissen.dk/fann/ 5. http://article.gmane.org/gmane.comp.lang.haskell.cafe/41167 6. http://churn.ath.cx/funsat.html 7. http://article.gmane.org/gmane.comp.lang.haskell.cafe/38392 8. http://www.deinprogramm.de/defun-2008/ 9. http://www.icfpconference.org/icfp2008/ 10. http://article.gmane.org/gmane.comp.lang.haskell.cafe/41059 11. http://www.haskell.org/cabal/ 12. http://article.gmane.org/gmane.comp.lang.haskell.cafe/40950 13. http://www.ccs.neu.edu/home/ramsdell/pgms/index.html 14. http://article.gmane.org/gmane.comp.lang.haskell.cafe/41045 15. http://hackage.haskell.org/packages/archive/recent.rss 16. http://hackage.haskell.org/ 17. http://quantile95.com/?p=5 18. http://www.netlib.org/blas/ 19. http://article.gmane.org/gmane.comp.lang.haskell.cafe/40790 20. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hsXenCtrl 21. http://xen.org/ 22. http://article.gmane.org/gmane.comp.lang.haskell.cafe/40745 23. http://article.gmane.org/gmane.comp.lang.haskell.cafe/40703 24. http://www.haskell.org/communities/ 25. http://article.gmane.org/gmane.comp.lang.haskell.cafe/40546 26. http://dbpatterson.com/articles/10 27. http://www.smugmug.com/ 28. http://article.gmane.org/gmane.comp.lang.haskell.cafe/40500 29. http://www.lipl.googlepages.com/index.html#source 30. http://article.gmane.org/gmane.comp.lang.haskell.cafe/40479 31. http://syn.cs.pdx.edu/~jsnow/glome/ 32. http://article.gmane.org/gmane.comp.lang.haskell.cafe/40052 33. http://code.haskell.org/ChessLibrary/ 34. http://article.gmane.org/gmane.comp.lang.haskell.cafe/39773 35. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/xmonad-utils 36. http://article.gmane.org/gmane.comp.lang.haskell.cafe/39710 37. http://roguestar.downstairspeople.org/ 38. http://article.gmane.org/gmane.comp.lang.haskell.cafe/39654 39. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/scc-0.1 40. http://www.idealliance.org/papers/extreme/proceedings/html/2006/Blazevic01/… 41. http://article.gmane.org/gmane.comp.lang.haskell.cafe/39648 42. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/twitter 43. http://article.gmane.org/gmane.comp.lang.haskell.cafe/39522 44. http://www.haskell.org/haskellwiki/The_Monad.Reader 45. http://article.gmane.org/gmane.comp.lang.haskell.cafe/39492 46. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/category-extras 47. http://article.gmane.org/gmane.comp.lang.haskell.cafe/39482 48. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/sessions 49. http://article.gmane.org/gmane.comp.lang.haskell.cafe/39352 50. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/haddock-2.1.0 51. http://article.gmane.org/gmane.comp.lang.haskell.cafe/39347 52. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/ 53. http://code.google.com/p/reviewboard/ 54. http://article.gmane.org/gmane.comp.lang.haskell.cafe/39342 55. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/diagrams-0.1 56. http://article.gmane.org/gmane.comp.lang.haskell.cafe/39271 57. http://www.fh-wedel.de/~si/HXmlToolbox/index.html 58. http://article.gmane.org/gmane.comp.lang.haskell.cafe/39040 59. http://code.google.com/soc/2008/haskell/about.html 60. http://article.gmane.org/gmane.comp.lang.haskell.cafe/38992 61. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/bytestring 62. http://article.gmane.org/gmane.comp.lang.haskell.cafe/38991 63. http://lambda.uta.edu/HXQ/ 64. http://www.w3.org/TR/xquery/ 65. http://article.gmane.org/gmane.comp.lang.haskell.cafe/38965 66. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/Win32-notify-0.1 67. http://article.gmane.org/gmane.comp.lang.haskell.cafe/38922 68. http://uebb.cs.tu-berlin.de/~magr/projects/cpuid/doc/ 69. http://article.gmane.org/gmane.comp.lang.haskell.cafe/38870 70. http://home.telfort.nl/sp969709/emp/empug.html 71. http://article.gmane.org/gmane.comp.lang.haskell.cafe/38773 72. http://software.complete.org/datapacker 73. http://article.gmane.org/gmane.comp.lang.haskell.cafe/38736 74. http://darcswatch.nomeata.de/ 75. http://article.gmane.org/gmane.comp.lang.haskell.cafe/38676 76. http://www.generic-haskell.org/ 77. http://article.gmane.org/gmane.comp.lang.haskell.cafe/38542 78. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/graphics-drawing… 79. http://article.gmane.org/gmane.comp.lang.haskell.cafe/38505 80. http://www.haskell.org/haskellwiki/The_Monad.Reader 81. http://article.gmane.org/gmane.comp.lang.haskell.cafe/38419 82. http://www.well-typed.com/ 83. http://article.gmane.org/gmane.comp.lang.haskell.cafe/38173 84. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hgdbmi 85. http://article.gmane.org/gmane.comp.lang.haskell.cafe/38167 86. http://xmonad.org/ 87. http://article.gmane.org/gmane.comp.lang.haskell.cafe/37996 88. http://code.google.com/p/hsp 89. http://article.gmane.org/gmane.comp.lang.haskell.cafe/37853 90. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/network-minihttp… 91. http://article.gmane.org/gmane.comp.lang.haskell.cafe/37831 92. http://www.haskell.org/haskellwiki/DDC 93. http://article.gmane.org/gmane.comp.lang.haskell.cafe/37703 94. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/haskell-src-exts… 95. http://article.gmane.org/gmane.comp.lang.haskell.cafe/37688 96. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/omnicodec 97. http://planet.haskell.org/ 98. http://haskell.org/haskellwiki/Blog_articles 99. http://cpoucet.wordpress.com/2008/06/11/icfp-contest-2008/ 100. http://www.realworldhaskell.org/blog/2008/06/10/cufp-2007-videos-now-easier… 101. http://muharem.wordpress.com/2008/06/10/wrap-up-mergesort-in-haskell/ 102. http://chrisdone.com/blog/2008/06/10/jbofihe-and-haskell/ 103. http://blogs.msdn.com/matt/archive/2008/06/09/writing-a-regular-expression-… 104. http://tapestryjava.blogspot.com/2008/06/real-world-haskell.html 105. http://www.londonhug.net/2008/06/09/next-meeting-paradise-a-dsel-for-deriva… 106. http://cpoucet.wordpress.com/2008/04/25/lazy-memoization/ 107. http://neilmitchell.blogspot.com/2008/06/gsoc-hoogle-week-2.html 108. http://therning.org/magnus/archives/353 109. http://physics-dph.blogspot.com/2008/06/status-report-week-2.html 110. http://blog.unsafeperformio.com/?p=24 111. http://comonad.com/reader/2008/zapping-strong-adjunctions/ 112. http://comonad.com/reader/2008/representing-adjunctions/ 113. http://blog.unsafeperformio.com/?p=23 114. http://feeds.feedburner.com/~r/conal/~3/304291460/ 115. http://www.haskell.org/mailman/listinfo/haskell 116. http://sequence.complete.org/ 117. http://planet.haskell.org/ 118. http://sequence.complete.org/node/feed 119. http://haskell.org/ 120. http://code.haskell.org/~byorgey/code/hwn/archives/20080611.pdf 121. http://haskell.org/haskellwiki/HWN 122. http://code.haskell.org/~byorgey/code/hwn/

1 0

A problem with overlapping instances and super-classes
by Iavor Diatchki 10 Jun '08

10 Jun '08

Hello, (you should be able to copy and paste the code in this email into two modules called A and B to try it out) > {-# LANGUAGE OverlappingInstances #-} > module A where This module, together with module 'B', illustrates a problem in some implementations of overlapping instances and their interaction with super-classes. I tried GHC 6.8.2 and Hugs (September 2006). The problem is one of coherency---we can get a method to behave differently, when instantiated at the same type in the same module. We need two modules to illustrate the problem because both Hugs and GHC perform some checking to avoid this problem. Unfortunately, it seems that we can circumvent the checking by moving instances to a different module. Consider the class 'Name'. We are going to show how 'name' behaves differently when instantiated at the same type. > class Name a where name :: a -> String > instance Name Char where name _ = "Char" > instance Name a => Name [a] where name x = "[" ++ name (head x) ++ "]" We also define a super-class of 'Name' called 'C'. The methods of 'C' are not important---we use a single method that can be used to generate 'C' constraints. > class Name a => C a where c :: a -> () > instance Name a => C [a] where c _ = () The instance of 'C' is interesting: we have to check that the super-class constraint holds, so we need to prove (Name a => Name [a]). In the given context there is exactly one way to do this, namely, by using the corresponding instance for 'Name'. Note, however, that in other modules there may be more specific instances for 'Names [a]' that could have been used. This leads to a problem, as we show in module B. > {-# LANGUAGE OverlappingInstances, FlexibleInstances #-} > module B where > import A We add another instance for 'Name'---it overwrites the generic behavior on lists, with a specific instance for lists of characters: > instance Name [Char] where name _ = "String" Here is an example function that uses both 'c' and 'name' at the same type ('[a]', for some 'a'). This results in two constraints: (Name [a], C [a]). Implementations "simplify" this to just (C [a]) by using the fact that 'C [a]' is a super-class of 'Name [a]'. Unfortunately this commits to using the "generic" instance for 'Name' on lists (the one in module 'A'). > f x = name [x] > where _ = c [x] Here is an example illustrating the problem: the two components of the pair use 'name' at the same instance, '[Char]', but the first ends up using the generic instance, while the second uses the specific instance. > test = (f 'x', name ['x']) GHCi, version 6.8.2: http://www.haskell.org/ghc/ :? for help Loading package base ... linking ... done. [1 of 2] Compiling A ( A.lhs, interpreted ) [2 of 2] Compiling B ( B.lhs, interpreted ) Ok, modules loaded: A, B. *B> test ("[Char]","String") -Iavor

4 4

DEFUN08: Final Call for Talks & Tutorials (deadline: June 27)
by Matthew Fluet (ICFP Publicity Chair) 10 Jun '08

10 Jun '08

Final Call for Talks and Tutorials ACM SIGPLAN 2008 Developer Tracks on Functional Programming http://www.deinprogramm.de/defun-2008/ Victoria, BC, Canada, 25, 27 September, 2008 The workshop will be held in conjunction with ICFP 2008. http://www.icfpconference.org/icfp2008/ Important dates Proposal Deadline: June 27, 2008, 0:00 UTC Notification: July 14, 2008 DEFUN 2008 invites functional programmers who know how to solve problems with functional progamming to give talks and lead tutorials at the The ICFP Developer Tracks. We want to know about your favorite programming techniques, powerful libraries, and engineering approaches you've used that the world should know about and apply to other projects. We want to know how to be productive using functional programming, write better code, and avoid common pitfalls. We invite proposals for presentations in the following categories: How-to talks: 45-minute "how-to" talks that provide specific information on how to solve specific problems using functional programming. These talks focus on concrete examples, but provide useful information for developers working on different projects or in different contexts. Examples: - "How I made Haskell an extension language for SAP R/3." - "How I replaced /sbin/init by a Scheme program." - "How I hooked up my home appliances to an Erlang control system." - "How I got an SML program to drive my BMW." General language tutorials: Half-day general language tutorials for specific functional languages, given by recognized experts for the respective languages. Technology tutorials: Half-day tutorials on techniques, technologies, or solving specific problems in functional programming. Examples: - how to make the best use of specific FP programming techniques - how to inject FP into a development team used to more conventional technologies - how to connect FP to existing libraries / frameworks / platforms - how to deliver high-performance systems with FP - how to deliver high-reliability systems with FP Remember that your audience will include computing professionals who are not academics and who may not already be experts on functional programming. Presenters of tutorials will receive free registration to ICFP 2008. Submission guidelines Submit a proposal of 150 words or less for either a 45-minute talk with a short Q&A session at the end, or a 300-word-or-less proposal for a 3-hour tutorial, where you present your material, but also give participants a chance to practice it on their own laptops. Some advice: - Give it a simple and straightforward title or name; avoid fancy titles or puns that would make it harder for attendees to figure out what you'll be talking about. - Clearly identify the level of the talk: What knowledge should people have when they come to the presentation or tutorial? - Explain why people will want to attend: is the language or library useful for a wide range of attendees? Is the pitfall you're identifying common enough that a wide range of attendees is likely to encounter it? - Explain what benefits attendees are expected to take home to their own projects. - For a tutorial, explain how you want to structure the time, and what you expect to have attendees to do on their laptops. List what software you'll expect attendees to have installed prior to coming. Submit your proposal in plain text electronically to defun-2008-submission-AT-deinprogramm.de by the beginning of Friday, June 27, Universal Coordinated Time. Organizers Kathleen Fisher AT&T Labs Simon Peyton Jones Microsoft Research Mike Sperber (co-chair) DeinProgramm Don Stewart (co-chair) Galois

1 0

Fwd: CS2001 Interim Review is open for public consultation
by Martin Erwig 09 Jun '08

09 Jun '08

Heads up, ACM members! As fans of functional programming, you can provide input on the future of the CS curriculum guidance provided by ACM. In particular, you could support the SIGPLAN alternate proposal for the programming language part (wiki.acm.org/cs2001/index.php?title=SIGPLAN_Proposal) The more active, positive support through comments and feedback this proposal receives, the better the chance that functional programming will receive a more prominent role in the CS education (at least in the US, Europe seems to be ahead in this regard). -- Martin Begin forwarded message: > From: David Schneider <schneider(a)HQ.ACM.ORG> > Date: June 9, 2008 2:23:28 PM PDT > To: acm-educators(a)ACM.ORG > Subject: CS2001 Interim Review is open for public consultation > Reply-To: David Schneider <schneider(a)HQ.ACM.ORG> > > Dear ACM member, > > After several months of work, the Computer Science Curriculum Review > Taskforce has nearly completed the interim review of the CS2001 > [undergraduate] volume. While many changes have been made, it was > felt that other [more comprehensive] changes should wait for the > next more extensive review which will begin shortly after this > review is complete. As a result, new areas of the Body of Knowledge > were not added. Where new topics (i.e., security and concurrency) > have arisen, they were developed and dispersed back to the > appropriate areas within the Body of Knowledge. > > The taskforce is seeking feedback from ACM members in the field of > education on changes and improvements to the review volume. The > period for this public consultation will start June 9thand end July > 1st; the taskforce will then meet to go over the comments. The > taskforce will then determine what comments can be acted upon now, > and those that should be saved for the more extensive review. > > The review can be accessed within a wiki at http://wiki.acm.org/cs2001/index.php > and includes a feedback mechanism on the bottom of each page. You > must use your ACM username and password to access the feedback > mechanism. > > Again thank you for your participation and we look forward to your > feedback. > > Best regards, > > Andrew > McGettrick > Renee McCauley > > Co-chairs of the CS2001 Review Taskforce > > > > > > David Schneider > > Education Manager > > The Association for Computing Machinery > > 2 Penn Plaza, 7th Floor > > New York, NY 10021-0701 > > > > Ph: 212-626-0515 > > Em: schneider(a)acm.org > > W: http://www.acm.org > > > > >

1 0

HASE 2008 - Extended Deadline June 17
by tase08 08 Jun '08

08 Jun '08

***We apologise if you have received multiple copies of this call for papers.*** Please circulate to colleagues who might be interested. HASE 2008 11th High Assurance Systems Engineering Symposium Nanjing, China December 3-5, 2008 http://cs.nju.edu.cn/hase08/main.html Call for Papers The IEEE International Symposium on High Assurance Systems Engineering is a forum for discussion of systems and software engineering issues to achieve high assurance systems. The focus is on integrated approaches for assuring reliability, availability, integrity, privacy, confidentiality, safety, and real-time of complex systems and the methods for assessing the assurance levels of the systems to a high degree of confidence. Technical and experience papers on algorithms, policies, middleware, tools, and models for high assurance systems development, verification and validation, and assessment are welcome. Authors are invited to submit high quality technical papers describing original and unpublished work in all aspects of high assurance systems engineering. Topics of interests for the symposium include, but are not limited to: *Design and development of highly reliable, survivable, secure, safe, and time-assured systems *Integrated system reliability, availability, security, safety, and timing analysis and evaluation methods *Policies for reliability, safety, security, integrity, privacy, and confidentiality of high assurance systems *Formal specification, specification validation, testing, and model checking for high assurance systems *High assurance software architecture and design *Transformation-based and evolutionary-based system development *Reconfigurable system design for evolving high assurance requirements *Dynamic monitoring and adaptation for run-time assurance *High assurance web services *High assurance information/knowledge systems and data grids *High assurance embedded systems, ubiquitous systems and sensor networks *Extending web service specifications for reliability, safety, security, privacy, trust, and other QoS properties *Assurance techniques for service-oriented systems CALL FOR FAST ABSTRACTS Contributions for the Fast Abstract track of HASE 2008 are solicited. The fast abstracts aim to serve as a rapid and flexible mechanism to o Discuss industrial experiences and achievements o Report on research work in progress o Introduce new ideas to the community o State positions on controversial issues or open problems Works related to high assurance systems engineering fitting the categories described above are welcome. Authors from industry, government, and academia are encouraged to submit Fast Abstracts. Fast Abstracts will not be formally refereed. Instead, the HASE'08 Fast Abstracts Committee will screen the submissions. The criteria for acceptance will be i) relevance and interest to the community and ii) timeliness of the material. Submission Guidelines: Research Papers: Original, previously unpublished papers are solicited. Maximum 10 pages, standard IEEE double-column format. Fast Abstracts: Fast Abstracts are limited to 2 pages, in standard IEEE double-column format. Authors of accepted Fast Abstracts will present a short talk approximately 10-15 min) at HASE 2008 Fast Abstract sessions. Important Dates: * June 17, 2008: Paper submission deadline (extended) * July 10, 2008: Fast Abstract submission deadline * August 1, 2008: Acceptance/rejection notification * August 29, 2008: Camera-ready version due * December 3-5, 2008: HASE 2008 Organization: General Chairs: Jian Lu, Nanjing University (China) Program Co-chairs: Xuandong Li, Nanjing University (China) Carol S. Smidts, Ohio State University US (North/South America) Jie Xu, University of Leeds (Europe) Finance Chair: Xin Chen, Nanjing University (China) Publicity Chair: Jing Dong, University of Texas at Dallas (US) Registration Chair: JianHua Zhao, Nanjing University (China) 　　　　　　　　　 Local Organization Chair: Linzhang Wang, Nanjing University, (China) Program Committee: Farooq Ahmad (National University of Sciences and technology, Pakistan) Masaki Aida (Tokyo Metropolitan University, Japan) Farokh Bastani (University of Texas at Dallas, USA) Andrea Bondavali(University of Florence, Italy) Guillaume Brat (USRA-RIACS, USA) Michel Cukier (University of Maryland at College Park, USA) John Davies(BAE Systems, UK) JinSong Dong (National University of Singapore,Singapore) Felicita Di Giandomenico(CNR, Italy) Arif Ghafoor (Purdue University, USA) Swapna Gokhale (University of Connecticut, USA) Katerina Goseva-Popstojanova (West Virginia University, USA) Mats Heimdahl (University of Minnesota, USA) Mike Henshaw(Loughborough University, UK) Ravi Iyer (University of Illinois at Urbana-Champaign, USA) Phil John(Cranfield University, UK) Yoshiaki Kakuda (Hiroshima City University, Japan) Shaoying Liu (Hosei University, Japan) Zhiming Liu (UNU/IIST, Macau, China) Xiaodong Lu (Tokyo Institute of Technology, Japan Michael Lyu (Chinese University of Hong Kong, China) Miroslaw Malek( Humboldt University, Germany) Hong Mei (Peking University, China) Graham Morgen(University of Newcastle, UK) Kinji Mori (Tokyo Institute of Technology, Japan) Hiroaki Morino (Shibaura Institue of Technology, Japan) Gilles Muller(EMN, France) Edgar Nett(University of Magdeburg. Germany) Jun Pang (University of Luxembourg, Luxembourg) Steven Roach (University of Texas at El Paso, USA) Manuel Rodriguez (Ohio State University, USA) Luigi Romano(University of Napoli, Italy) Eugene Santos (Dartmouth College, USA) Man-Tak Shing (Naval Postgraduate School, USA) Zhendong Su (University of California at Davis, USA) Yongdong Tan (Southwest Jiaotong University, China) Paul Townend(University of Leeds, UK) Helene Waeselynck(LAAS-CNRS, France) Farn Wang (National Taiwan University Taiwan, China) Ji Wang (Changsha Institute of Technology, China) Linzhang Wang (Nanjing University, China) Victor Winter (University of Nebraska at Omaha, USA) Eric Wong (University of Texas at Dallas, USA) Dianxiang Xu (North Dakota State University, USA) Jian Zhang (Institute of Software, China) Jianhua Zhao (Nanjing University, China) Jianjun Zhao (Shanghai Jiao Tong University, China) Hong Zhu (Oxford Brooks University, UK) Huibiao Zhu (East China Normal University, China) Steering Program Committee Taghi M. Khoshgoftaar, Florida Atlantic University Kinji Mori, Tokyo Institute of Technology Raymond Paul, Department of Defense Chair) Wei-Tek Tsai, Arizona State University Victor Winter, University of Nebraska,Omaha I-Ling Yen, University of Texas at Dallas Keynote Speakers TBD

1 0

CFP: APLAS 2008 - The Sixth ASIAN Symposium on Programming Languages and Systems
by Martin Sulzmann 08 Jun '08

08 Jun '08

APLAS is a Haskell-friendly conference. Details of CFP, location etc are below. -Martin ------------------------------------------ The Sixth ASIAN Symposium on Programming Languages and Systems (APLAS 2008) CALL FOR PAPERS Bangalore, India December 9 - December 11, 2008 http://research.microsoft.com/~grama/APLAS2008 <http://research.microsoft.com/%7Egrama/APLAS2008> 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 SIngapore (2007), Sydney (2006, Australia), Tsukuba (2005, Japan), Taipei (2004, Taiwan) and Beijing (2003, China) after three informa 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 4807. TOPICS: The symposium is devoted to both foundational and practical issues in programming languages and systems. Papers are solicited in, but are 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 Original results that bear on these and related topics are solicited. Papers investigating novel uses and applications of language systems are especially encouraged. Authors concerned about the appropriateness of a topic are welcome to consult with the program chair prior to submission. IMPORTANT DATES: Paper Submission Deadline: June 27, 2008 Conference: December 9 - December 11, 2008 GENERAL CHAIR S. Ramesh (India Science Lab, GM R&D) PROGRAM CHAIR G. Ramalingam (Microsoft Research India) PROGRAM COMMITTEE Tyng-Ruey Chuang (Institute of Information Science, Academia Sinica, Taiwan) Xinyu Feng (Toyota Technological Institute at Chicago, U.S.A.) Mathew Flatt (University of Utah, U.S.A.) Yuxi Fu (Shanghai Jiaotong University, China) Rajiv Gupta (University of California, Riverside, U.S.A.) Siau-Cheng Khoo (National University of Singapore, Singapore) Naoki Kobayashi (Tohoku University, Japan) P. Madhusudan (University of Illinois at Urbana-Champaign, U.S.A.) Soo-Mook Moon (Seoul National University, Korea) Komondoor V Raghavan (IBM India Research Lab) G. Ramalingam (Microsoft Research India) Mooly Sagiv (Tel Aviv University, Israel) Koushik Sen (University of California, Berkeley, U.S.A.) Zhendong Su (University of California, Davis, U.S.A.) Martin Sulzmann (IT University of Copenhagen, Denmark) Hongseok Yang (Queen Mary, University of London, U.K.) Nobuko Yoshida (Imperial College, London, U.K.)

1 0

Last CFP : Erlang Workshop 2008 - deadline: June 17
by Horvath Zoltan 06 Jun '08

06 Jun '08

Last Call for papers Seventh ACM SIGPLAN Erlang Workshop Victoria, British Columbia, Canada, September 27, 2008 http://www.erlang.org/workshop/2008/ Satellite event of ACM SIGPLAN International Conference on Functional Programming, September 22-24, 2008 The Erlang workshop will take place during one day in connection with ICFP'08 (see http://www.icfpconference.org/icfp2008/) Important Dates Submission deadline extended - Midnight GMT June 17 Author notification - Midnight GMT June 30 Final submission - Midnight GMT July 14 Erlang is a concurrent, distributed functional programming language aimed at systems with requirements on massive concurrency, soft real time response, fault tolerance, and high availability. It has been available as open source for several years creating a community that actively contributes to its already existing rich set of libraries and applications. Originally created for telecom applications, its usage has spread to other domains including e-commerce, banking, and computer telephony. Erlang programs are today among the largest applications written in any functional programming language. These applications offer new opportunities to evaluate functional programming and functional programming methods on a very large scale and suggest new problems for the research community to solve. This workshop will bring together the open source, academic, and industrial programming communities of Erlang. It will enable participants to familiarize themselves with recent developments on new techniques and tools tailored to Erlang, novel applications, draw lessons from users' experiences and identify research problems and common areas relevant to the practice of Erlang and functional programming. Submission and publication information The workshop will have printed proceedings which will be distributed to the participants at the time of the workshop. Subsequently, the papers will be included in the ACM Digital Library. Authors are therefore advised to use the Author Information for SIGPLAN Conferences when preparing their submissions. Authors should submit provisional full papers. Submissions will be accepted electronically; the submission page is not yet ready. The length should be restricted to 12 pages in standard ACM format. In previous workshops we have had a mix of papers representing academic research and industrial experiences with Erlang. We particularly welcome papers describing new and novel application of Erlang - if you have any doubts about the suitability of a paper please feel free to contact the Program Chair for advice. Authors should submit their papers using the submission website: http://www-old.inf.elte.hu/rendezvenyek/erlangws08/openconf/ In case of technical problems, please contact erlangws08(a)inf.elte.hu. Workshop Chair Tee Teoh, Canadian Bank Note, Ottawa, Canada Program Chair Zoltán Horváth, Department of Programming Languages and Programming, Faculty of Informatics, Eötvös Loránd University, Budapest, Hungary Program Committee Thomas Arts, IT University, Göteborg, Sweden Francesco Cesarini, Erlang Training and Consulting, London, UK Clara Benac Earle, University Carlos III, Madrid, Spain John Hughes, Chalmers University of Technology, Göteborg, Sweden Erik Stenman, Kreditor, Stockholm, Sweden Zoltán Theisz, Ericsson, Ireland Simon Thompson, University of Kent,Canterbury, UK Rex Page, University of Oklahoma, USA For Venue and registration, please see the ICFP web site Related Links Erlang Workshop web site: http://www.erlang.org/workshop/2008/ ICFP 2008 web site: http://www.icfpconference.org/icfp2008/ Past ACM SIGPLAN Erlang workshops http://www.erlang.se/workshop Open Source Erlang http://www.erlang.org/

1 0

Call for participation: LOPSTR 2008
by Josep Francesc Silva Galiana 06 Jun '08

06 Jun '08

18TH INTERNATIONAL SYMPOSIUM ON LOGIC-BASED PROGRAM SYNTHESIS AND TRANSFORMATION (LOPSTR 2008) ***************************************************************************************************************************************************************************** The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. This year, LOPSTR will be held in Valencia, Spain; and will start on July 17th and will end on July 18th. It is now possible to register and reserve hotel accommodation at the symposium site by using the symposium website: ------------------------------------------------------------------------ http://www.informatik.uni-kiel.de/~mh/lopstr08/ ------------------------------------------------------------------------ Best regards, and see you in Valencia, Josep Silva

1 0

[SAS-LOPSTR-PPDP-PLID 2008] Call for participation
by German Vidal 05 Jun '08

05 Jun '08

****************************************************************** Call for Participation SAS - LOPSTR - PPDP - PLID 2008 http://www.dsic.upv.es/~slp2008/ Valencia, Spain ****************************************************************** * EARLY REGISTRATION DEADLINE IS APPROACHING: JUNE 10, 2008 * ****************************************************************** SAS 2008, July 16-18 Static Analysis Symposium http://www.dsic.upv.es/~sas2008/ -> Accepted papers: http://www.dsic.upv.es/~sas2008/accepted_papers.html LOPSTR 2008, July 17-18 Symposium on Logic-Based Program Synthesis and Transformation http://www.informatik.uni-kiel.de/%7Emh/lopstr08/ PPDP 2008, July 15-17 ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming http://www.clip.dia.fi.upm.es/Conferences/PPDP08/ -> Accepted papers: http://www.clip.dia.fi.upm.es/Conferences/PPDP08/accepted.html PLID 2008, July 15 Workshop on Programming Language Interference and Dependence http://www.clip.dia.fi.upm.es/Conferences/PLID08/home.php *** REGISTRATION Please register online at http://www.dsic.upv.es/~slp2008/ The early registration deadline is June 10, 2008. ******************************************************************

1 0