From icfp.publicity at googlemail.com Mon Mar 3 10:03:10 2008 From: icfp.publicity at googlemail.com (Matthew Fluet (ICFP Publicity Chair)) Date: Mon Mar 3 10:00:46 2008 Subject: [Haskell] ICFP08 Final CFP Message-ID: <53ff55480803030703p618af6cexe2710c7773648a7c@mail.gmail.com> Final Call for Papers ICFP 2008: International Conference on Functional Programming Victoria, BC, Canada, 22-24 September 2008 http://www.icfpconference.org/icfp2008 Submission deadline: 2 April 2008 ICFP 2008 seeks original papers on the art and science of functional programming. Submissions are invited on all topics from principles to practice, from foundations to features, from abstraction to application. The scope includes all languages that encourage functional programming, including both purely applicative and imperative languages, as well as languages with objects and concurrency. Particular topics of interest include * Applications and Domain-Specific Languages * Foundations * Design * Implementation * Transformation and Analysis * Software-development Techniques * Functional Pearls * Practice and Experience Important Dates (at 09:00 Apia time, UTC-11) ~~~~~~~~~~~~~~~ Submission: 2 April 2008 Author response: 21 May 2008 Notification: 16 June 2008 Final papers due: 7 July 2008 Call for Papers (full text) ~~~~~~~~~~~~~~~ http://www.icfpconference.org/icfp2008/cfp/cfp.html The submission URL will be available from the above page shortly. Program Chair ~~~~~~~~~~~~~ Peter Thiemann Albert-Ludwigs-Universit?t Georges-K?hler-Allee 079 79110 Freiburg, Germany Email: icfp08@informatik.uni-freiburg.de Phone: +49 761 203 8051 Fax: +49 761 203 8052 Mail sent to the address above is filtered for spam. If you send mail and do not receive a prompt response, particularly if the deadline is looming, feel free to telephone and reverse the charges. From voigt at tcs.inf.tu-dresden.de Tue Mar 4 06:27:18 2008 From: voigt at tcs.inf.tu-dresden.de (Janis Voigtlaender) Date: Tue Mar 4 06:24:50 2008 Subject: [Haskell] Announce: online free theorems generator now with PDF output Message-ID: <47CD3216.5090301@tcs.inf.tu-dresden.de> The free theorems generator online at: http://linux.tcs.inf.tu-dresden.de/~voigt/ft , previously announced here: http://www.haskell.org/pipermail/haskell/2007-October/019917.html , now allows to export generated theorems and associated information as .pdf files with nice mathematical markup. The new feature was implemented by Florian Stenger. It builds on Patryk Zadarnowski's lambdaTeX package. Have fun, Janis. -- Dr. Janis Voigtlaender http://wwwtcs.inf.tu-dresden.de/~voigt/ mailto:voigt@tcs.inf.tu-dresden.de From alistair at abayley.org Wed Mar 5 04:24:09 2008 From: alistair at abayley.org (Alistair Bayley) Date: Wed Mar 5 04:21:39 2008 Subject: [Haskell] ANN: Takusen 0.8 Message-ID: <79d7c4980803050124h1fca8cc1gef8ddd75f234685d@mail.gmail.com> Oleg and I are pleased to announce the release of Takusen 0.8. (Don Stewart did an interim 0.7 release for us a few weeks ago, and added us to Hackage. This release is a tidy-up of some loose ends, and some bug fixes. Hence, I've summarise the changes since the 0.6 release.) Changes since 0.6: - ODBC support. This still has a few gaps (and probably bugs and rough edges) but should be fairly usable. - support for reusable/persistent sessions, so you can hang onto the connection object between invocations of withSession (this was in release 0.6 but omitted from the release notes). - improvements to the Cabal Setup scripts, which should give better experiences for ghc-6.4, ghc-6.6, and ghc-6.8. The (eventual) 1.4 release of Cabal should be able to build our haddock docs, too. - improved UTF8 decoder (marshals directly from buffer). The release bundle: http://hackage.haskell.org/packages/archive/Takusen/0.8/Takusen-0.8.tar.gz The latest code: darcs get http://darcs.haskell.org/takusen Docs: http://darcs.haskell.org/takusen/doc/html/index.html A comprehensive description of API usage can be found in the documentation for module Database.Enumerator (look for the Usage section): http://darcs.haskell.org/takusen/doc/html/Database-Enumerator.html Future plans: - FreeTDS backend (Sybase and MS Sql Server) - support for Blobs and Clobs For those of you unfamiliar with Takusen, here is our HCAR blurb: Takusen is a library for accessing DBMS's. Like HSQL, we support arbitrary SQL statements (currently strings, extensible to anything that can be converted to a string). Takusen's `unique-selling-point' is safety and efficiency. We statically ensure all acquired database resources - such as cursors, connection and statement handles - are released, exactly once, at predictable times. Takusen can avoid loading the whole result set in memory, and so can handle queries returning millions of rows in constant space. Takusen also supports automatic marshalling and unmarshalling of results and query parameters. These benefits come from the design of query result processing around a left-fold enumerator. Currently we fully support ODBC, Oracle, Sqlite, and PostgreSQL. From derek.a.elkins at gmail.com Thu Mar 6 01:58:56 2008 From: derek.a.elkins at gmail.com (Derek Elkins) Date: Thu Mar 6 01:56:34 2008 Subject: [Haskell] ANN: Parsec 3.0.0 Message-ID: <1204786736.5936.18.camel@derek-laptop> This is a first release of the Parsec 3, the Google Summer of Code of Paolo Martini. The main changes are: * The Parser monad has been generalized into a ParserT monad transformer. * The parsers have been generalized to work over a stream of any type, in particular, with byte strings. * There is Haddock documentation for almost all functions in the Text.Parsec tree. * The Parser monad now has Applicative/Alternative instances * A "compatibility" Text.ParserCombinators.Parsec tree for the old Parsec. It's not perfect, but it should work with most Parsec 2 code. This package should be installable from with cabal install or with the standard cabal invocations. Cabal release: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/parsec-3.0.0 The darcs repository is at: http://code.haskell.org/parsec3 Note that this package is a new version of the parsec package and so will hide the old parsec-2.1.0.0 package. I would like to thank Antoine Latter for a variety of significant patches including updating the compatibility modules and a large effort testing them. [P.S. I will probably be lacking an Internet connection over the next few days.] From Malcolm.Wallace at cs.york.ac.uk Thu Mar 6 09:11:57 2008 From: Malcolm.Wallace at cs.york.ac.uk (Malcolm Wallace) Date: Thu Mar 6 09:16:26 2008 Subject: [Haskell] Google summer of code Message-ID: <20080306141157.2cce4354.Malcolm.Wallace@cs.york.ac.uk> Reply-To: haskell-cafe@haskell.org Google Summer of Code As many of you will already know, Google is running its "Summer of Code" project again this year, and haskell.org is once again going to apply to be a mentoring organisation. Are you a student who would like to earn money for hacking in Haskell? Or are you a non-student who has a cool idea for a coding project but no time to do it yourself? Well, our wiki to gather ideas is now up-and-running again: http://hackage.haskell.org/trac/summer-of-code Add yourself to the list of interested people! Especially potential mentors. There are some ideas still there from last year, in the trac tickets. However, due to the amount of spam accumulating there, I suggest that this year, we use the haskell-cafe email list as a place to put out project ideas, solicit feedback on them, and look for interested people. Prefix any message subject line with with [GSoC] to help others find them. Google will start accepting student applications on 24th March, but now is the time to start gathering thoughts and matching up interesting ideas with interested people. The official timeline is as follows: March 12: Mentoring organization application deadline March 17: List of accepted mentoring organizations published March 24: Student application period opens March 31: Student application deadline Interim Period: we review and rank student proposals April 14: List of accepted student applications published Interim Period: Students learn more about their project communities May 26: Students begin coding; Google begins issuing initial payments July 14: Google begins issuing mid-term payments August 11: Suggested end of coding August 18: Definite end of coding Sept 1: Final evaluation deadline; Google begins issuing final payments Sept 3: Students upload code to Google (required) Regards, Malcolm From waldmann at imn.htwk-leipzig.de Fri Mar 7 01:51:13 2008 From: waldmann at imn.htwk-leipzig.de (Johannes Waldmann) Date: Fri Mar 7 01:48:36 2008 Subject: [Haskell] Local Haskell meeting + Hackathon, Leipzig, Germany, April 18-20 Message-ID: <47D0E5E1.4000704@imn.htwk-leipzig.de> HaL 3, the third Haskell in Leipzig meeting, will take place on Friday, April 18, 2008 (late afternoon). Tentative program: - Janis Voigtlaender: Theorems for free - J?rgen Nicklisch-Franken: The Making of Leksah http://code.haskell.org/leksah The HaL meeting will be combined with a Hackathon weekend (19.-20.4.), where we want to work on the Haskell Eclipse plugin (refactoring, IDE integration, ...), see http://leiffrenzel.de/eclipse/wiki/doku.php For more details and registration, see http://iba-cg.de/hal3.html. Note: For HaL, we could use one more talk (30 min, in German or English) so if you have something, please tell us. Preference will be given to reports on Haskell in (business) applications. Alf Richter (iba Consulting) and Johannes Waldmann (HTWK Leipzig) From genaim at clip.dia.fi.upm.es Sat Mar 8 18:29:05 2008 From: genaim at clip.dia.fi.upm.es (Samir Genaim) Date: Sat Mar 8 18:24:28 2008 Subject: [Haskell] PLID'08: 1st Call for Contributions Message-ID: ********************************************************* * The Fourth International Workshop * * on * * Programming Language Interference and Dependence * * * * co-located with LOPSTR'08, PPDP'08 and SAS'08 * * * * 15 July, 2008, Valencia, Spain * * * * Venue: The Technical University of Valencia * * * * 1st Call for Contributions * * * * http://www.clip.dia.fi.upm.es/Conferences/PLID08 * * * ********************************************************* Important Dates =============== Expression of interest June 1, 2008 Extended abstract June 15, 2008 Workshop July 15, 2008 Workshop Description ==================== Interference and dependence are closely related concepts, the first being the observable phenomenon connected to the second. Interference essentially means that behaviour of some parts of a dynamic system may influence the behaviour of other parts of the system. Dependence specifies the relation between the semantics of sub-components of a dynamic system. Discovering, measuring and controlling interference is essential in many aspects of modern computer science, in particular in security, program analysis and verification, debugging, systems specification, model checking, program manipulation, program slicing, reverse engineering, data mining, distributed databases and systems biology. Doing these things requires theories, models and semantics for interference and dependence, as well as algorithms and tools for analysis and reasoning about interference and dependence. The aim of this workshop is to gather together the community of people that study dependence and interference from the different points of view in order to generate new possible research directions. PLID is devoted to bridging all these communities and assisting work towards a common goal, providing the appropriate environment for reasoning about the state of the art in interference and dependence. Topics of interest include but are not limited to: * Security against unwanted interference and dependence * Models and theories of program interference * Algorithms for reducing or removing interference or for ameliorating its effects * Theory and foundations of program slicing and related dependence analyses * Resource declassification theories * Semantics of dependence and interference * Analyses based on interference and dependence * Abstract interpretation for dependence and interference * Dependence and interference in specifications * Slicing models and specifications * Interaction between dependence and refinement Keynote Speaker =============== Gilles Barthe, IMDEA-software (Madrid, Spain) Submission ========== The workshop welcomes contributions of on-going work and ideas in the field of dependence and interference. Those who are interested in having a talk at the workshop and/or discussing issues related with these subjects are invited to send your expression of interest to Samir Genaim (samir@clip.dia.fi.upm.es) before June 1st, 2008. There will be no formal publication of papers. A web-page will be organised collecting all the workshop contributions. Submitted extended abstracts should be of at most 10 pages LNCS-style and should be sent before June 15th 2008. Program Committee ================= David Clark Kings College, London, UK Sebastian Danicic University of London, UK Samir Genaim (chair) Technical University of Madrid, Spain Roberto Giacobazzi University of Verona, Italy Daniele Gorla University of Roma, Italy Sebastian Hunt City University, London, UK Herbert Wiklicky Imperial College, London, UK Steve Zdancewic University of Pennsylvania, USA Local organizer =============== Christophe Joubert Technical University of Valencia / DSIC From dons at galois.com Sun Mar 9 17:33:26 2008 From: dons at galois.com (Don Stewart) Date: Sun Mar 9 17:30:49 2008 Subject: [Haskell] Haskell Weekly News: March 09, 2008 Message-ID: <20080309213326.GC27150@scytale.galois.com> --------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20080309 Issue 71 - March 09, 2008 --------------------------------------------------------------------------- Welcome to issue 71 of HWN, a newsletter covering developments in the [1]Haskell community. Another busy week on the Haskell library front, with around 100 new and updated libraries and tools on Hackage. 1. http://haskell.org/ Announcements Google Summer of Code. Malcolm Wallace [2]announced Google is running its 'Summer of Code' project again this year, and Haskell.org is once again going to apply to be a mentoring organisation. If you're interested in earning money to hack on Haskell, and helping out the community, [3]take a look at the wiki. 2. http://article.gmane.org/gmane.comp.lang.haskell.cafe/37273 3. http://hackage.haskell.org/trac/summer-of-code Haskell in the browser. Dimitry Golubovsky [4]announced that the YHC JavaScript backend is now in alpha testing, and is open to experimentation for those wanting to write Haskell directly for the browser 4. http://article.gmane.org/gmane.comp.lang.haskell.cafe/37299 Hackage New and updated libraries in [5]the Hackage library database. 5. http://hackage.haskell.org/ * typalyze 0.1.1. Uploaded by Matthew Danish. [6]typalyze: Analyzes Haskell source files for easy reference. * lax 0.0.0.1. Uploaded by Wolfgang Jeltsch. [7]lax: Lax arrows. * truelevel 0.1.1. Uploaded by Barton Massey. [8]truelevel: Audio file compressor-limiter. * WAVE 0.1. Uploaded by Barton Massey. [9]WAVE: WAVE audio file IO library. * parseargs 0.1. Uploaded by Barton Massey. [10]parseargs: Command-line argument parsing library for Haskell programs. * conjure 0.1. Uploaded by Gwern Branwen. [11]conjure: A BitTorrent client. * Diff 0.1.1. Uploaded by Sterling Clover. [12]Diff: O(ND) diff algorithm in haskell.. * simseq 0.0. Uploaded by Gwern Branwen. [13]simseq: Simulate sequencing with different models for priming and errors. * rbr 0.8.3. Uploaded by Gwern Branwen. [14]rbr: Mask nucleotide (EST) sequences in Fasta format. * xml2x 0.2. Uploaded by Gwern Branwen. [15]xml2x: Convert BLAST output in XML format to CSV or HTML. 6. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/typalyze-0.1.1 7. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/lax-0.0.0.1 8. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/truelevel-0.1.1 9. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/WAVE-0.1 10. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/parseargs-0.1 11. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/conjure-0.1 12. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/Diff-0.1.1 13. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/simseq-0.0 14. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/rbr-0.8.3 15. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/xml2x-0.2 * estreps 0.1. Uploaded by Gwern Branwen. [16]estreps: Repeats from ESTs. * clustertools 0.1. Uploaded by Gwern Branwen. [17]clustertools: Tools for manipulating sequence clusters. * xsact 1.6. Uploaded by Gwern Branwen. [18]xsact: Cluster EST sequences. * HsJudy 0.2. Uploaded by Gwern Branwen. [19]HsJudy: Judy bindings, and some nice APIs. * prof2dot 0.3.1. Uploaded by Gregory Wright. [20]prof2dot: Convert GHC profiles into GraphViz's dot format. * strict 0.3.2. Uploaded by Roman Leshchinskiy. [21]strict: Strict data types and String IO.. * Emping 0.4. Uploaded by Hans VanThiel. [22]Emping: derives heuristic rules from nominal data. * GuiHaskell 0.1.1. Uploaded by Neil Mitchell. [23]GuiHaskell: A graphical REPL and development environment for Haskell. * simpleargs 0.1. Uploaded by Ketil Malde. [24]simpleargs: Provides a more flexible getArgs function with better error reporting.. * parsec 3.0.0. Uploaded by Derek Elkins. [25]parsec: Monadic parser combinators. 16. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/estreps-0.1 17. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/clustertools-0.1 18. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/xsact-1.6 19. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/HsJudy-0.2 20. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/prof2dot-0.3.1 21. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/strict-0.3.2 22. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/Emping-0.4 23. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/GuiHaskell-0.1.1 24. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/simpleargs-0.1 25. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/parsec-3.0.0 * hetris 0.2. Uploaded by Gwern Branwen. [26]hetris: Text Tetris. * hscurses 1.3. Uploaded by Gwern Branwen. [27]hscurses: NCurses bindings for Haskell. * photoname 2.0. Uploaded by Dino Morelli. [28]photoname: Rename JPEG photo files based on shoot date. * mage 1.1.0. Uploaded by Gwern Branwen. [29]mage: Rogue-like. * infix 0.1.1. Uploaded by Gwern Branwen. [30]infix: Infix expression re-parsing (for HsParser library). * bio 0.3.3. Uploaded by Gwern Branwen. [31]bio: A bioinformatics library. * dephd 0.0. Uploaded by Gwern Branwen. [32]dephd: Analyze 'phred' output (.phd files). * hybrid 2.0. Uploaded by Gwern Branwen. [33]hybrid: A implementation of a type-checker for Lambda-H. * propgrid 0.1. Uploaded by Gwern Branwen. [34]propgrid: GUI propertygrid. * gravatar 0.3. Uploaded by Donald Stewart. [35]gravatar: Find the url of the gravatar associated with an email address.. 26. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hetris-0.2 27. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hscurses-1.3 28. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/photoname-2.0 29. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/mage-1.1.0 30. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/infix-0.1.1 31. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/bio-0.3.3 32. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/dephd-0.0 33. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hybrid-2.0 34. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/propgrid-0.1 35. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/gravatar-0.3 * himerge 0.17.9. Uploaded by Luis Araujo. [36]himerge: Haskell Graphical User Interface for Emerge. * Takusen 0.8. Uploaded by Alistair Bayley. [37]Takusen: Database library with left-fold interface, for PostgreSQL, Oracle, SQLite, ODBC.. * irc 0.4.1. Uploaded by Trevor Elliott. [38]irc: A small library for parsing IRC messages.. * hexpat 0.2. Uploaded by Evan Martin. [39]hexpat: wrapper for expat, the fast XML parser. * microbench 0.1. Uploaded by Evan Martin. [40]microbench: Microbenchmark Haskell code. * hxt 7.5. Uploaded by Uwe Schmidt. [41]hxt: A collection of tools for processing XML with Haskell.. * hmatrix 0.2.1.0. Uploaded by Alberto Ruiz. [42]hmatrix: Linear algebra and numerical computations. * binary-strict 0.3.1. Uploaded by Adam Langley. [43]binary-strict: Binary deserialisation using strict ByteStrings. * category-extras 0.1. Uploaded by Dan Doel. [44]category-extras: Various modules and constructs inspired by category theory.. * pcap 0.4.3. Uploaded by Bryan OSullivan. [45]pcap: A system-independent interface for user-level packet capture. 36. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/himerge-0.17.9 37. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/Takusen-0.8 38. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/irc-0.4.1 39. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hexpat-0.2 40. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/microbench-0.1 41. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hxt-7.5 42. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hmatrix-0.2.1.0 43. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/binary-strict-0.3.1 44. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/category-extras-0.1 45. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/pcap-0.4.3 * curl 1.3.1. Uploaded by Eric Mertens. [46]curl: Haskell binding to libcurl. * fastcgi 3001.0.2. Uploaded by Bjorn Bringert. [47]fastcgi: A Haskell library for writing FastCGI programs. * hslogger 1.0.5. Uploaded by John Goerzen. [48]hslogger: Versatile logging framework. * HAppS-Server 0.9.2.1. Uploaded by David Himmelstrup. [49]HAppS-Server: Web related tools and services.. * HAppS-IxSet 0.9.2.1. Uploaded by David Himmelstrup. [50]HAppS-IxSet: Added by DavidHimmelstrup, Fri Feb 29 07:27:13 PST 2008.. * HAppS-State 0.9.2.1. Uploaded by David Himmelstrup. [51]HAppS-State: Event-based distributed state.. * HAppS-Data 0.9.2.1. Uploaded by David Himmelstrup. [52]HAppS-Data: HAppS data manipulation libraries. * HAppS-Util 0.9.2.1. Uploaded by David Himmelstrup. [53]HAppS-Util: Web framework. * sessions 2008.2.28. Uploaded by Matthew Sackman. [54]sessions: Session Types for Haskell. * utf8-string 0.3. Uploaded by Eric Mertens. [55]utf8-string: Support for reading and writing UTF8 Strings. 46. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/curl-1.3.1 47. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/fastcgi-3001.0.2 48. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hslogger-1.0.5 49. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/HAppS-Server-0.9.2.1 50. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/HAppS-IxSet-0.9.2.1 51. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/HAppS-State-0.9.2.1 52. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/HAppS-Data-0.9.2.1 53. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/HAppS-Util-0.9.2.1 54. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/sessions-2008.2.28 55. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/utf8-string-0.3 * EdisonCore 1.2.1.2. Uploaded by Robert Dockins. [56]EdisonCore: A library of efficent, purely-functional data structures (Core Implementations). * parameterized-data 0.1. Uploaded by Alfonso Acosta. [57]parameterized-data: Parameterized data library implementing lightweight dependent types. * unix 2.3.0.0. Uploaded by Ross Paterson. [58]unix: POSIX functionality. * hoogle 3.1. Uploaded by Neil Mitchell. [59]hoogle: Haskell API Search. * ftshell 0.2. Uploaded by Janis Voigtlaender. [60]ftshell: Shell interface to the FreeTheorems library.. * free-theorems 0.2. Uploaded by Janis Voigtlaender. [61]free-theorems: Automatic generation of free theorems.. * special-functors 1.0. Uploaded by Henning Thielemann. [62]special-functors: Control.Applicative, Data.Foldable, Data.Traversable (compatibility package). * type-level 0.1. Uploaded by Alfonso Acosta. [63]type-level: Type-level programming library. * nymphaea 0.2. Uploaded by Gwern Branwen. [64]nymphaea: An interactive GUI for manipulating L-systems. * hsc3 0.2. Uploaded by Rohan Drape. [65]hsc3: Haskell SuperCollider. 56. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/EdisonCore-1.2.1.2 57. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/parameterized-data-0.1 58. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/unix-2.3.0.0 59. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hoogle-3.1 60. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/ftshell-0.2 61. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/free-theorems-0.2 62. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/special-functors-1.0 63. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/type-level-0.1 64. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/nymphaea-0.2 65. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hsc3-0.2 * hosc 0.2. Uploaded by Rohan Drape. [66]hosc: Haskell Open Sound Control. * hslackbuilder 0.0.1. Uploaded by Andrea Rossato. [67]hslackbuilder: HSlackBuilder automatically generates slackBuild scripts from a cabal package. * hsparklines 0.1.0. Uploaded by Hitesh Jasani. [68]hsparklines: Sparklines for Haskell. * sat-micro-hs 0.1.1. Uploaded by Denis Bueno. [69]sat-micro-hs: A minimal SAT solver. * interlude 0.1.1. Uploaded by Gwern Branwen. [70]interlude: Replaces some Prelude functions for enhanced error reporting. * parse-dimacs 1.0.1. Uploaded by Denis Bueno. [71]parse-dimacs: DIMACS CNF parser library. * bitset 0.5. Uploaded by Denis Bueno. [72]bitset: A functional data structure for efficient membership testing.. * special-functors 1.0. Uploaded by Henning Thielemann. [73]special-functors: Control.Applicative, Data.Foldable, Data.Traversable (compatibility package). * condorcet 0.0.1. Uploaded by Gwern Branwen. [74]condorcet: Library for Condorcet voting. * heap 0.2.3. Uploaded by Stephan Friedrichs. [75]heap: Heaps in Haskell. 66. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hosc-0.2 67. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hslackbuilder-0.0.1 68. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hsparklines-0.1.0 69. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/sat-micro-hs-0.1.1 70. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/interlude-0.1.1 71. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/parse-dimacs-1.0.1 72. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/bitset-0.5 73. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/special-functors-1.0 74. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/condorcet-0.0.1 75. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/heap-0.2.3 * hspr-sh 0.3. Uploaded by Gwern Branwen. [76]hspr-sh: Session handler for HSP. * hsp 0.2. Uploaded by Gwern Branwen. [77]hsp: Haskell Server Pages is a library for writing dynamic server-side web pages.. * trhsx 0.2.1. Uploaded by Gwern Branwen. [78]trhsx: trhsx is the preprocessor for Harp and HSP. * haskell-src-exts 0.2.1. Uploaded by Gwern Branwen. [79]haskell-src-exts: Manipulating Haskell source: abstract syntax, lexer, parser, and pretty-printer. * harp 0.2.1. Uploaded by Gwern Branwen. [80]harp: HaRP allows pattern-matching with regular expressions. * HTF 0.1. Uploaded by Gwern Branwen. [81]HTF: The Haskell Test Framework. * hsdip 0.1. Uploaded by Gwern Branwen. [82]hsdip: hsdip - a Diplomacy parser/renderer. * mpdmate 0.1. Uploaded by Gwern Branwen. [83]mpdmate: MPD/PowerMate executable. * powermate 0.1. Uploaded by Gwern Branwen. [84]powermate: PowerMate bindings. * syb-with-class 0.4. Uploaded by David Himmelstrup. [85]syb-with-class: Scrap Your Boilerplate With Class. 76. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hspr-sh-0.3 77. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hsp-0.2 78. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/trhsx-0.2.1 79. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/haskell-src-exts-0.2.1 80. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/harp-0.2.1 81. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/HTF-0.1 82. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hsdip-0.1 83. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/mpdmate-0.1 84. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/powermate-0.1 85. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/syb-with-class-0.4 * whim 0.1. Uploaded by Gwern Branwen. [86]whim: A Haskell window manager. * memcached 0.1. Uploaded by Gwern Branwen. [87]memcached: haskell bindings for memcached. * HaLeX 1.1. Uploaded by Gwern Branwen. [88]HaLeX: HaLeX enables modelling, manipulation and animation of regular languages. 86. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/whim-0.1 87. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/memcached-0.1 88. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/HaLeX-1.1 Jobs Haskell for real-time control software. Tom Hawkins [89]announced an opening for a Haskell job in real-time control software for vehicle and machinery applications 89. http://article.gmane.org/gmane.comp.lang.haskell.cafe/37093 Haskell for bioinformatics. Ketil Malde [90]announced an open position for a 3-year Ph.D. scolarship at IMR working on bioinformatics projects in Haskell 90. http://news.gmane.org/gmane.comp.lang.haskell.cafe/cutoff=37362 Blog noise [91]Haskell news from the [92]blogosphere. * [93]Barracuda P2P Chat * [94]A Lambda Calculus Reducer * [95]A Fashion Magazine in Haskell * [96]Introduction to building stateful web apps in HAppS * [97]Intro to HAppS-State * [98]Project Euler in Haskell * [99]In praise of mandatory indentation for novice programmers * [100]More Monads on the Cheap: Inlined fromMaybe * [101]A First Haskell Experience * [102]Haskell and code coverage * [103]Why I don't use Haskell for Functional Programming (monads, lifting) 91. http://planet.haskell.org/ 92. http://haskell.org/haskellwiki/Blog_articles 93. http://haskell.org/gtk2hs/archives/2008/02/24/barracuda-p2p-chat/ 94. http://www.defmacro.org/ramblings/lambda-reducer.html 95. http://www.alpheccar.org/en/posts/show/91 96. http://softwaresimply.blogspot.com/2008/02/intro-to-happs-part-1.html 97. http://softwaresimply.blogspot.com/2008/02/intro-to-happs-state.html 98. http://extempore.livejournal.com/212602.html 99. http://okasaki.blogspot.com/2008/02/in-praise-of-mandatory-indentation-for.html 100. http://osteele.com/archives/2008/02/inlined-frommaybe 101. http://the-programmers-stone.com/2008/03/04/a-first-haskell-experience/ 102. http://dukedave.blogspot.com/2008/03/back-in-action.html 103. http://jlouisramblings.blogspot.com/2008/03/why-i-dont-use-haskell-for-functional_08.html Quotes of the Week * teamonkey: the Haskell solutions that people are posting are generally so much more concise and elegant than for any other language * Dan Zwell: I am fairly new to Haskell, and I didn't realize how easy concurrent code is until I wrote this * anonymous: The Haskall (sic) language is often uses by very intelligent programmers, it often allows to use lazy computations and iterations, but it has the advantage that its iterators behave better (than in Python), and during the generation of some items you can, when you want, refer and use the items already generated. * Corun: I don't understand, what's the advantage of hugs? The uni here says to use hugs, though, but I kept finding myself going in to ghci to get a useful error message * They say that if it compiles, it will run correctly. It?s nearly true! I?m amazed. ... Such buglessness will remove a huge source of indeterminism in production environments where the work of many teams is co-ordinated by schedules. * dolio: I've made a domain specific notation for describing puddings. * cschneid: [Haskell] changed the way I look at decomposition of problems in the more corporate languages (Java and C#). I use far fewer variables, and more side-effect free methods. It's made my code clearer, and easier to test. * nicodemus: I've written some Erlang and much more Haskell. My take so far is that Erlang is good for teaching you how to fish, Haskell is good for teaching you about procuring food (including fish). * paulzork: Haskell is to functional programming like C is to imperative languages? Sort of the latin root? About the Haskell Weekly News New editions are posted to [104]the Haskell mailing list as well as to [105]the Haskell Sequence and [106]Planet Haskell. [107]RSS is also available, and headlines appear on [108]haskell.org. Headlines are available as [109]PDF. To help create new editions of this newsletter, please see the [110]contributing information. Send stories to dons at galois.com. The darcs repository is available at darcs get [111]http://code.haskell.org/~dons/code/hwn/ 104. http://www.haskell.org/mailman/listinfo/haskell 105. http://sequence.complete.org/ 106. http://planet.haskell.org/ 107. http://sequence.complete.org/node/feed 108. http://haskell.org/ 109. http://code.haskell.org/~dons/code/hwn/archives/20080309.pdf 110. http://haskell.org/haskellwiki/HWN 111. http://code.haskell.org/~dons/code/hwn/ From ppdp08-cfp at clip.dia.fi.upm.es Mon Mar 10 05:14:35 2008 From: ppdp08-cfp at clip.dia.fi.upm.es (Elvira Albert) Date: Mon Mar 10 06:26:51 2008 Subject: [Haskell] PPDP 2008 - 2nd Call for Papers Message-ID: ................................................................ ACM PPDP 2008 - Call For Papers 10th ACM-SIGPLAN International Symposium on Principles and Practice of Declarative Programming Valencia, Spain, July 15-17, 2008 http://www.clip.dia.fi.upm.es/Conferences/PPDP08 ................................................................ IMPORTANT DATES Submission: April 10, 2008 Notification: May 15, 2008 Conference: July 15-17, 2008 SCOPE: PPDP 2008 is a forum for researchers and practitioners in the declarative programming communities. It solicits papers on all aspects of logic, constraint and functional programming, as well as on related paradigms such as visual programming, executable specification languages, database languages, AI and knowledge representation languages for the "semantic web". MAIN TOPICS: Logic, Constraint, and Functional Programming; Database, AI and Knowledge Representation Languages; Visual Programming; Executable Specification for Languages; Applications of Declarative Programming; Methodologies for Program Design and Development; Declarative Aspects of Object-Oriented Programming; Concurrent Extensions to Declarative Languages; Declarative Mobile Computing; Paradigm Integration; Proof Theoretic and Semantic Foundations; Type and Module Systems; Program Analysis and Verification; Program Transformation; Abstract Machines and Compilation; Programming Environments. PROCEEDINGS: The proceedings will be published by ACM Press RELATED EVENTS: PPDP 2008 will be co-located with the 15th International Static Analysis Symposium (SAS 2008) and the 18th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2008). SYMPOSIUM CHAIR: Elvira Albert, Complutense University of Madrid PROGRAM CHAIR: Sergio Antoy, Portland State University INVITED SPEAKER: Michael Leuschel, University of D??sseldorf, Germany PROGRAM COMMITTEE: Elvira Albert Complutense University of Madrid, Spain Sergio Antoy Portland State University, USA Maribel Fernandez King's College London, UK Maurizio Gabbrielli University of Bologna, Italy Neil Ghani University of Nottingham, UK Masami Hagiya University of Tokyo, Japan Joxan Jaffar National University, Singapore Claude Kirchner INRIA Bordeaux, France Herbert Kuchen University of Muenster, Germany Michael Maher NICTA and University of New South Wales, Australia Dale Miller INRIA Saclay, France Eugenio Moggi University of Genova, Italy Kostis Sagonas Uppsala University, Sweden Carsten Schurmann, IT University of Copenhagen, Denmark Peter Sestoft IT University of Copenhagen, Denmark LOCAL CHAIR: Christophe Joubert From twd2 at dockerz.net Mon Mar 10 08:22:06 2008 From: twd2 at dockerz.net (Tim Docker) Date: Mon Mar 10 08:19:17 2008 Subject: [Haskell] ANN: Chart 0.6 Message-ID: <51715.202.7.166.173.1205151726.squirrel@dockerz.net> A post to announce that Chart-0.6 is now available from it's darcs repository and from hackage. This is a library for drawing 2D charts. It relies upon the haskell cairo binding that is part of gtk2hs, and hence supports several backend output formats (windows, png, pdf, ps, etc). I'm announcing this particular version here because it now includes an alternative API (Data.Rendering.Chart.Simple), that is concise enough to use interactively from a ghci repl. Thanks are due to David Roundy for contributing this API. Further information is available here: http://dockerz.net/software/chart.html Tim From eijiro.sumii at gmail.com Tue Mar 11 04:28:21 2008 From: eijiro.sumii at gmail.com (Eijiro Sumii) Date: Tue Mar 11 04:25:35 2008 Subject: [Haskell] ML Workshop 2008 call for papers Message-ID: <20080311.172821.56195289.sumii@ecei.tohoku.ac.jp> [Dear Haskell mailing list subscribers: Please note the last paragraph in "GOALS OF THE WORKSHOP".] CALL FOR PAPERS The 2008 ACM SIGPLAN Workshop on ML Sunday, September 21, 2008 Victoria, British Columbia, Canada To be held in conjunction with ICFP 2008 http://www.kb.ecei.tohoku.ac.jp/ml2008/ IMPORTANT DATES: Submission deadline: Monday, June 23, 2008 Notification of acceptance: Friday, July 18, 2008 Final revision due: Monday, July 28, 2008 Workshop: Sunday, September 21, 2008 GOALS OF THE WORKSHOP: ML is a family of programming languages that includes dialects known as Standard ML, Objective Caml, and F#. The development of these languages has inspired a large amount of computer science research, both practical and theoretical. This workshop aims to build on previous occasions (recent instances are ML 2005 in Tallinn, Estonia, 2006 in Portland, Oregon, and 2007 in Freiburg, Germany), providing a forum to encourage discussion and research on ML and related technology. The 2008 Workshop on ML will be held in conjunction with the 13th ACM SIGPLAN International Conference on Functional Programming (ICFP 2008) in Victoria, British Columbia, Canada on Sunday, September 21, 2008. This year we extend the scope of the workshop from ML itself to technologies closely related to ML (higher-order, typed, or strict languages) and invite high-quality papers in all areas of crucial importance for the future of ML. SUBMISSION GUIDELINES: We seek papers on topics related to ML, including (but not limited to): * applications * extensions: objects, classes, concurrency, distribution and mobility, semi-structured data handling, etc. * type systems (static and dynamic): inference, effects, overloading, error reporting, contracts, specifications and assertions, etc. * implementation: compilers, interpreters, partial evaluators, garbage collectors, etc. * environments: libraries, tools, editors, debuggers, cross-language interoperability, functional data structures, etc. * semantics Submitted papers should describe new ideas, experimental results, ML-related projects, or informed positions regarding proposals for next-generation ML languages. In order to encourage lively discussion, submitted papers may describe work in progress. All papers will be judged on a combination of correctness, significance, novelty, clarity, and interest to the community. All paper submissions must be at most 12 pages total length in the standard ACM SIGPLAN two-column conference format (9pt): http://www.acm.org/sigs/sigplan/authorInformation.htm Accepted papers will be published by the ACM and will appear in the ACM Digital Library. More details about the submission procedure will be announced later on the web page: http://www.kb.ecei.tohoku.ac.jp/ml2008/ PROGRAM CHAIR: Eijiro Sumii (Tohoku University) PROGRAM COMMITTEE: Sylvain Conchon (Paris-Sud University / INRIA Saclay-Ile-de-France) Karl Crary (Carnegie Mellon University) Andrzej Filinski (DIKU) Robby Findler (The University of Chicago) Cormac Flanagan (University of California at Santa Cruz) Alain Frisch (LexiFi) Dan Grossman (University of Washington) Didier Remy (INRIA Paris-Rocquencourt) Claudio Russo (Microsoft Research Cambridge) Eijiro Sumii (Tohoku University) Hongwei Xi (Boston University) From bjorn at bringert.net Wed Mar 12 13:46:25 2008 From: bjorn at bringert.net (Bjorn Bringert) Date: Wed Mar 12 13:43:41 2008 Subject: [Haskell] Reminder: 4th Haskell Hackathon, April 11-13 in Gothenburg Message-ID: ------------------------------------------------------------------------ Hac4 4th Haskell Hackathon April 11-13, 2008 Gothenburg, Sweden http://haskell.org/haskellwiki/Hac4 Sponsored by Credit Suisse and Galois. ------------------------------------------------------------------------ This is a reminder to register for the 4th Haskell Hackathon. The event will be held over 3 days, April 11-13, at Chalmers University of Technology in Gothenburg, Sweden. == NEWS == * Lunches and at least one dinner for the Hackathon attendees will be provided through our generous sponsors Credit Suisse and Galois. * If you plan to start a new project on community.haskell.org, please request an account and project in advance, so as to save valuable Hackathon time. See http://community.haskell.org/admin/ for more details. == What it is == The plan is to hack on Haskell infrastructure, tools, libraries and compilers. To attend please register, and get ready to hack those lambdas! Code to hack on: * Hackage * Cabal * Porting foreign libraries * Bug squashing * You decide! Before you attend, do start thinking and familiarizing yourself with 1 or 2 projects you wish to work on, to ensure no wasted effort during the Hackathon. A list of possible projects is available on the website. == Registration == We ask that you register your interest. Follow the instructions on the registration page: http://haskell.org/haskellwiki/Hac4/Register Once you've registered, do add your info to the attendees self-organizing page, http://haskell.org/haskellwiki/Hac4/Attendees if you are looking to share costs, or meet up prior to the hackathon, with other attendees. N.B. if you already expressed interest via the wiki, do confirm by registering `officially' anyway. == Important dates == Hackathon: April 11-13, 2008 == Organizers == Bj?rn Bringert (local) Thomas Schilling (local) Lennart Kolmodin (local) Krasimir Angelov (local) Jean-Philippe Bernardy (local) Ian Lynagh Duncan Coutts From mh at informatik.uni-kiel.de Thu Mar 13 06:27:07 2008 From: mh at informatik.uni-kiel.de (Michael Hanus) Date: Thu Mar 13 06:24:09 2008 Subject: [Haskell] CfP: LOPSTR 2008 Message-ID: <20080313102707.7ABA86455D@localhost> ====================================================================== CALL FOR PAPERS 18th International Symposium on International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2008 http://www.informatik.uni-kiel.de/~mh/lopstr08/ July 17-18, 2008, Valencia, Spain (co-located with SAS 2008, PPDP 2008, and PLID 2008) ====================================================================== Objectives: 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. Formal proceedings are produced only after the symposium, so authors can incorporate this feedback in the published papers. Topics: Topics of interest cover all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming-in-the-small and programming-in-the-large. Papers describing applications in these areas are especially welcome. Contributions are welcome on all aspects of logic-based program development, including, but not limited to: specification synthesis verification transformation analysis optimisation composition security reuse applications and tools component-based software development software architectures agent-based software development program refinement Survey papers, that present some aspect of the above topics from a new perspective, and application papers, that describe experience with industrial applications, are also welcome. Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal, conference, or workshop with refereed proceedings. Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chair in case of questions). IMPORTANT DATES AND SUBMISSION GUIDELINES: Paper/extended abstract submission: May 7, 2008 Notification (for pre-proceedings): June 8, 2008 Camera-ready (for pre-proceedings): June 29, 2008 Symposium: July 17-18, 2008 Submissions can either be (short) extended abstracts or (full) papers whose length should not exceed 9 and 15 pages (including references), respectively. Submissions must be formatted in the Springer LNCS style (excluding well-marked appendices not intended for publication). Referees are not required to read the appendices, and thus papers should be intelligible without them. Short papers may describe work-in-progress or tool demonstrations. Both accepted short and full papers will appear in the pre-proceedings. The full papers will automatically appear in the formal proceedings that will be published by Springer-Verlag in the LNCS series. In addition, after the symposium, the programme committee will select those short papers to be considered for formal publication. These authors will be invited to revise and extend their submissions in the light of the comments of the reviewers and the feedback solicited at the meeting. Then after another round of reviewing, the revised papers which are accepted will be also published in the formal proceedings. Papers should be submitted either in PDF or PostScript via the web page of LOPSTR 2008. Program Committee: Slim Abdennadher German University Cairo Danny De Schreye K.U.Leuven, Belgium Wlodek Drabent Polish Academy of Sciences, Poland / Linkoeping Univ., Sweden Gopal Gupta University of Texas at Dallas, USA Michael Hanus University of Kiel, Germany (Chair) Patricia Hill University of Leeds, UK Andy King University of Kent, UK Michael Leuschel University of Duesseldorf, Germany Torben Mogensen DIKU, University of Copenhagen, Denmark Mario Ornaghi Universita degli Studi di Milano, Italy Etienne Payet Universite de La Reunion, France Alberto Pettorossi University of Rome Tor Vergata, Italy German Puebla Technical University of Madrid, Spain C.R. Ramakrishnan SUNY at Stony Brook, USA Sabina Rossi Universita Ca' Foscari di Venezia, Italy Chiaki Sakama Wakayama University, Japan Josep Silva Technical University of Valencia, Spain Wim Vanhoof University of Namur, Belgium Eelco Visser Delft University of Technology, The Netherlands ---------------------------------------------------------------------- From aleator at gmail.com Fri Mar 14 08:06:38 2008 From: aleator at gmail.com (Ville Tirronen) Date: Fri Mar 14 08:03:37 2008 Subject: [Haskell] Passing typeclasses as parameters? Message-ID: <32f4f7e10803140506r728949alb645e95e3c7b0b4a@mail.gmail.com> Hi all. I managed to paint myself in a corner where I did this: > data ShowDynamic = forall a . (Show a) => SD Dynamic a > toShowDyn a = SD (toDyn a) a > fromShowDyn (SD d a) = fromDynamic d > instance Show ShowDynamic where ... Then I began to wonder if there was any hack to do: > data AnyDynamic X = forall a . (X a) => AD Dynamic a which could be kinda neat, but I saw no obvious way to do this. Ideas? - Ville (bound to be slain by curiosity) From andres at cs.uu.nl Fri Mar 14 09:07:43 2008 From: andres at cs.uu.nl (Andres Loeh) Date: Fri Mar 14 09:04:43 2008 Subject: [Haskell] Advert: Software Technology Master at Utrecht University Message-ID: <20080314130743.GJ17214@cs.uu.nl> Haskell enthusiasts looking for an interesting and challenging Master program should consider the "Software Technology" program at Utrecht University. The Master Program Software Technology studies techniques that are employed in the production of software. We start from sound theoretical foundations, with a strong focus on real applicability. The program includes courses on programming methodology, programming formalisms (languages), programming tools, software architectures, component based programming, specification formalisms and verification techniques (correctness proofs, theorem proving). Almost all of our courses use Haskell as the main implementation language, and we have many courses that are specifically targeted at functional programmers such as "Implementation of Programming Languages", "Advanced Functional Programming" and "Generic Programming". Furthermore, we have regular seminars on topics such as "Type Systems", "Dependently-Typed Programming", "Program Analysis" or "Advanced Compiler Construction". The Master Program is internationally oriented: the program is open to foreign students, and courses are taught in English. Students have the opportunity to follow courses and do projects at foreign universities and institutes. The program caters for students with a desire to obtain a Ph.D. position or a research position in a company, and for students who are interested in jobs as software designer in industry. The program results in a degree Master of Science in Computer Science. The program is offered by the Center for Software Technology of the Institute of Information and Computing Sciences at Utrecht University. For more information, see http://www.cs.uu.nl/wiki/Master http://www.cs.uu.nl/wiki/Master/MasterCourses -- Andres Loeh, Universiteit Utrecht mailto:andres@cs.uu.nl mailto:mail@andres-loeh.de http://www.andres-loeh.de From dave at zednenem.com Fri Mar 14 13:14:55 2008 From: dave at zednenem.com (David Menendez) Date: Fri Mar 14 13:11:53 2008 Subject: [Haskell] Passing typeclasses as parameters? In-Reply-To: <32f4f7e10803140506r728949alb645e95e3c7b0b4a@mail.gmail.com> References: <32f4f7e10803140506r728949alb645e95e3c7b0b4a@mail.gmail.com> Message-ID: <49a77b7a0803141014r197849caw773aa667c8ab2b5e@mail.gmail.com> On Fri, Mar 14, 2008 at 8:06 AM, Ville Tirronen wrote: > Hi all. > > I managed to paint myself in a corner where I did this: > > > data ShowDynamic = forall a . (Show a) => SD Dynamic a > > toShowDyn a = SD (toDyn a) a > > fromShowDyn (SD d a) = fromDynamic d > > > instance Show ShowDynamic where ... > > Then I began to wonder if there was any hack to do: > > > data AnyDynamic X = forall a . (X a) => AD Dynamic a > > which could be kinda neat, but I saw no obvious way to do this. > Ideas? You can't abstract over type classes, but you can abstract over a dictionary. data ShowD a = ShowD { showD :: a -> String } data AnyDynamic dict = forall a. AD Dynamic (dict a) On the other hand, if all you need is some fixed intersection of classes, it's better to make your own Dynamic. data ShowableDynamic = forall a. (Show a, Typeable a) => SD a toShowDyn :: (Show a, Typeable a) => a -> ShowableDynamic toShowDyn = SD fromShowDyn :: (Show a, Typeable a) => ShowableDynamic -> Maybe a fromShowDyn (SD a) = cast a Finally, you can make your own dynamic augmented with an arbitrary dictionary: data AnyDynamic dict = forall a. (Typeable a) => AD a (dict a) -- Dave Menendez From kalman at nytud.hu Fri Mar 14 14:34:39 2008 From: kalman at nytud.hu (=?ISO-8859-1?Q?L=E1szl=F3_K=E1lm=E1n?=) Date: Fri Mar 14 14:31:38 2008 Subject: [Haskell] Unicode advice request Message-ID: <47DAC53F.7000006@nytud.hu> Excuse me if this question is misplaced or too trivial. I'm writing a CGI program in Haskell (CGI/HDBC/Sqlite3), the database contains UTF-8 strings. If I use HDBC.fetchRow() to retrieve the data, then HDBC.fromSql() to convert the data to Haskell, then Text.XHtml constructs to dsplay it, I get wrong results in the browser (ASCII rendering of UTF-8 characters, which looks like garbage). What is the way to do this correctly? Thanks -- L. Kalman -- Laszlo Kalman Theoretical Linguistics Program, kalman@nytud.hu Budapest University (ELTE) Research Institute for Linguistics, Room 209 P.O. Box 701/518, 1399 Budapest, Hungary (+36-1) 351 4830 x148, fax: (+36-1) 322 9297 http://budling.nytud.hu/~kalman "Me die? That'll be the last thing I do!" From dons at galois.com Fri Mar 14 14:40:30 2008 From: dons at galois.com (Don Stewart) Date: Fri Mar 14 14:37:31 2008 Subject: [Haskell] Unicode advice request In-Reply-To: <47DAC53F.7000006@nytud.hu> References: <47DAC53F.7000006@nytud.hu> Message-ID: <20080314184030.GD10521@scytale.galois.com> kalman: > Excuse me if this question is misplaced or too trivial. > > I'm writing a CGI program in Haskell (CGI/HDBC/Sqlite3), the database > contains UTF-8 strings. If I use HDBC.fetchRow() to retrieve the data, > then HDBC.fromSql() to convert the data to Haskell, then Text.XHtml > constructs to dsplay it, I get wrong results in the browser (ASCII > rendering of UTF-8 characters, which looks like garbage). What is the > way to do this correctly? You may need to write the strings to the database using the utf8-string package. Also, if you're never actually decoding the data, it may be your CGI app generating a page with the wrong content type. When starting up your CGI app, set the content type to utf8, main = runFastCGIorCGI $ ... setHeader "Content-type" "text/plain; charset=utf-8" ... So check the headers being generated are of the correct type. Cheers, Don From kalman at nytud.hu Fri Mar 14 19:58:14 2008 From: kalman at nytud.hu (=?ISO-8859-1?Q?L=E1szl=F3_K=E1lm=E1n?=) Date: Fri Mar 14 19:55:13 2008 Subject: [Haskell] Unicode advice request In-Reply-To: <20080314184030.GD10521@scytale.galois.com> References: <47DAC53F.7000006@nytud.hu> <20080314184030.GD10521@scytale.galois.com> Message-ID: <47DB1116.5000203@nytud.hu> Dear Don, thanks very much! > You may need to write the strings to the database using the utf8-string > package. My program may not be the only one writing into the database. But I now *read* from the database using utf8-string, which solves the problem: import Codec.Binary.UTF8.String ( decodeString ) then (decodeString $ fromSql sqlString) returns the correct string. Unfortunately, utf8-string is not part of my ghc distribution (6-6-1, Ubuntu), and my repositories also don't contain it. I had to download it from http://hackage.haskell.org/cgi-bin/hackage-scripts/package/utf8-string-0.2 and install it by hand. (This may not be the optimal solution, though.) [Of course, the charset=utf-8 content type was included in the header from the outset.] Best regards and thanks again for the immediate help -- L. Kalman -- Laszlo Kalman Theoretical Linguistics Program, kalman@nytud.hu Budapest University (ELTE) Research Institute for Linguistics, Room 209 P.O. Box 701/518, 1399 Budapest, Hungary (+36-1) 351 4830 x148, fax: (+36-1) 322 9297 http://budling.nytud.hu/~kalman "Me die? That'll be the last thing I do!" From niklas.broberg at gmail.com Sun Mar 16 16:34:36 2008 From: niklas.broberg at gmail.com (Niklas Broberg) Date: Sun Mar 16 16:31:32 2008 Subject: [Haskell] ANN: haskell-src-exts 0.3.2 Message-ID: Hi all, I'm pleased to announce a new release for the haskell-src-exts package. haskell-src-exts 0.3.2 =========================== haskell-src-exts is a package for handling and manipulating Haskell source code. It is based on the haskell-src package that is part of the standard libraries, but extends this to support a number of syntactic extensions, e.g. MPTCs, fundeps, GADTs, TH etc. It is intended as a drop-in replacement for the standard haskell-src package, and exports the same functions and data types, plus some more. Apart from the more standard extensions supported by e.g. GHC, haskell-src-exts also provides support for HaRP (Haskell Regular Patterns) and HSX (Haskell Source with XML) syntax. Note that as of 0.3, haskell-src-exts /= HSX. * cabal sdist: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/haskell-src-exts-0.3.2 * darcs repo: darcs get http://code.haskell.org/HSP/haskell-src-exts === Changes from 0.2: === * Added support for - Indexed type families (including associated types/datatypes) - Explicit kind signatures - Standalone deriving * haskell-src-exts is now decoupled from hsx/trhsx and harp. - Modules renamed to Language.Haskell.Exts.* - Module Transform is removed from the package (now in package hsx) * New repository (i.e. darcs pull in an old repo won't work, use darcs get), containing only the haskell-src-exts package (no hsx or harp). * Builds with 6.8.2 (thanks Duncan Coutts) === Complete list of supported extensions === * Multi-parameter type classes (MPTCs) * Functional dependencies * Associated types, indexed type families * Liberal class and instance heads * Implicit parameters * Explicit kind signatures * Pattern guards * Generalized algebraic data types (GADTs) * Template Haskell (TH) * Universal and existential quantification (forall) * Empty data type declarations * Unboxed tuples (# #) * Standalone deriving * Regular patterns * Haskell XML, HSX style === Build Requirements === * happy >= 1.17 - It might work with 1.16 though I haven't tested. In that case change the cabal file. - It would work with older versions as well, though they insert a dependency on Array (haskell98) instead of Data.Array. If that's all you have to work with, update the cabal file with a dependency on haskell98. * Cabal >= 1.2 Patches are more than welcome. :-) Cheers, /Niklas From sescobar at dsic.upv.es Sun Mar 16 18:56:44 2008 From: sescobar at dsic.upv.es (Santiago Escobar) Date: Sun Mar 16 18:53:49 2008 Subject: [Haskell] Cfp: 3rd Int'l Workshop on Security and Rewriting Techniques (SecReT 2008) Message-ID: ******************************************************************** SecReT 2008 3rd International Workshop on Security and Rewriting Techniques http://www.dsic.upv.es/workshops/secret08 Sunday, June 22, 2008, Pittsburgh, USA Affiliated workshop of the 21st IEEE Computer Security Foundations Symposium (CSF) and the 23rd IEEE Symposium on Logic In Computer Science (LICS) IMPORTANT DATES Abstract Submission March 31, 2008 Full Paper Submission April 6, 2008 Acceptance Notification May 12, 2008 Camera Ready May 26, 2008 Workshop June 22, 2008 SCOPE The aim of this workshop is to bring together rewriting researchers and security experts, in order to foster their interaction and develop future collaborations in this area, provide a forum for presenting new ideas and work in progress, and enable newcomers to learn about current activities in this area. The workshop focuses on the use of rewriting techniques in all aspects of security. Specific topics include: authentication, encryption, access control and authorization, protocol verification, specification of policies, intrusion detection, integrity of information, control of information leakage, control of distributed and mobile code, etc. Previous instances of SecRet were held in 2006 (S. Servolo, Venice, Italy), and 2007 (Paris, France). LOCATION SecReT'08 will be held at Carnegie Mellon University in Pittsburgh, Pennsylvania, USA. The workshop is associated with the 21st IEEE Computer Security Foundations Symposium (CSF'08) and the 23rd IEEE Symposium on Logic in Computer Science (LICS'08). SUBMISSION PROCEDURE Submission is web-based via a link available in the main web page. Submissions must be received by April 6, 2008. In addition, a title and abstract must be submitted by March 31, 2008. Submitted papers should be at most 15 pages in the ENTCS style, and should include an abstract and the author's information. See the author's instructions of ENTCS style at http://www.entcs.org. PUBLICATION Accepted papers will be published in a preliminary volume available during the workshop. After the workshop, a final version of the proceedings will be published in the Elsevier series Electronic Notes in Theoretical Computer Science (ENTCS). INVITED SPEAKERS Hubert Comon Cachan, France Jonathan Millen MITRE, USA PROGRAM CO-CHAIRS Daniel Dougherty Worcester Polytechnic Institute, USA Santiago Escobar Technical University of Valencia, Spain PROGRAM COMMITTEE Pierpaolo Degano Pisa, Italy Daniel Dougherty Worcester, USA Santiago Escobar Valencia, Spain Maribel Fernandez King's College London, UK Thomas Genet IRISA Rennes, France Joshua Guttman MITRE, USA Catherine Meadows NRL, USA Monica Nesi L'Aquila, Italy Michael Rusinowitch Lorraine, France Ralf Treinen Paris-7, France ******************************************************************** From niklas.broberg at gmail.com Mon Mar 17 10:06:44 2008 From: niklas.broberg at gmail.com (Niklas Broberg) Date: Mon Mar 17 10:03:34 2008 Subject: [Haskell] Re: ANN: haskell-src-exts 0.3.2 In-Reply-To: References: Message-ID: > I'm pleased to announce a new release for the haskell-src-exts package. Twice in two days even. :-) haskell-src-exts 0.3.3 - now with support for type equality constraints. cabal sdist: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/haskell-src-exts-0.3.3 darcs repo: http://code.haskell.org/HSP/haskell-src-exts Cheers, /Niklas > > haskell-src-exts 0.3.2 > =========================== > > haskell-src-exts is a package for handling and manipulating Haskell > source code. It is based on the haskell-src package that is part of > the standard libraries, but extends this to support a number of > syntactic extensions, e.g. MPTCs, fundeps, GADTs, TH etc. It is > intended as a drop-in replacement for the standard haskell-src > package, and exports the same functions and data types, plus some > more. > > Apart from the more standard extensions supported by e.g. GHC, > haskell-src-exts also provides support for HaRP (Haskell Regular > Patterns) and HSX (Haskell Source with XML) syntax. > > Note that as of 0.3, haskell-src-exts /= HSX. > > * cabal sdist: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/haskell-src-exts-0.3.2 > * darcs repo: darcs get http://code.haskell.org/HSP/haskell-src-exts > > > === Changes from 0.2: === > > * Added support for > - Indexed type families (including associated types/datatypes) > - Explicit kind signatures > - Standalone deriving > > * haskell-src-exts is now decoupled from hsx/trhsx and harp. > - Modules renamed to Language.Haskell.Exts.* > - Module Transform is removed from the package (now in package hsx) > > * New repository (i.e. darcs pull in an old repo won't work, use darcs > get), containing only the haskell-src-exts package (no hsx or harp). > > * Builds with 6.8.2 (thanks Duncan Coutts) > > > === Complete list of supported extensions === > > * Multi-parameter type classes (MPTCs) > * Functional dependencies > * Associated types, indexed type families > * Liberal class and instance heads > * Implicit parameters > * Explicit kind signatures > * Pattern guards > * Generalized algebraic data types (GADTs) > * Template Haskell (TH) > * Universal and existential quantification (forall) > * Empty data type declarations > * Unboxed tuples (# #) > * Standalone deriving > * Regular patterns > * Haskell XML, HSX style > > > === Build Requirements === > > * happy >= 1.17 > - It might work with 1.16 though I haven't tested. In that case > change the cabal file. > - It would work with older versions as well, though they insert a > dependency on Array (haskell98) instead of Data.Array. If that's all > you have to work with, update the cabal file with a dependency on > haskell98. > > * Cabal >= 1.2 > > > Patches are more than welcome. :-) > > Cheers, > > > /Niklas > From s.a.herhut at herts.ac.uk Mon Mar 17 12:50:04 2008 From: s.a.herhut at herts.ac.uk (Stephan Herhut) Date: Mon Mar 17 12:46:53 2008 Subject: [Haskell] S-Hack 2008: Workshop on S-Net and SaC Message-ID: <45d9bd430803170950qcf4a486x838ee84aaace16ea@mail.gmail.com> Motto : From Solo to Symphony - Making your application go multi-core! Website : http://events.sac-home.org/s-hack/ When? : Mon. 14.4. - Wed. 16.4. 2008 Where? : University of Hertfordshire, Hatfield, UK; 51.7522 N 0.242 W Who can participate? : Anybody who has a computationally intensive application which can be expressed in terms of non-recursive data structures and operations thereon and who wants to have it all: * a nice and intuitive high-level specification * and high-performance, parallelised execution on multi-core architectures! Agenda : Mo / Tue : tutorials on our functional streaming & data parallel framework Tue / Wed : you start your own application using our framework Costs? : participation is free; hacking essentials such as coffee and electricity on a 24 hour basis also come for free! Catch? : we only have a limited amount of places available and will give these away on a first come first serve basis! How can I register? : Send an email to events@sac-home.org in which you state: * your name * your affiliation * the nature of your application -- Stephan Herhut Centre for Computer Science and Informatics Research Science and Technology Research Institute University of Hertfordshire From bf3 at telenet.be Mon Mar 17 18:53:04 2008 From: bf3 at telenet.be (Peter Verswyvelen) Date: Mon Mar 17 18:50:04 2008 Subject: [Haskell] Re: [Haskell-cafe] Re: ANN: haskell-src-exts 0.3.2 In-Reply-To: References: Message-ID: <47DEF650.6090506@telenet.be> Could this be used to add support for refactoring of source files containing language extensions? Because if I'm correct, the current most popular refactoring solution (I forgot the name) for Haskell does not support extensions. It would also be nice to add support for the arrows syntax :-) Cheers, Peter Verswyvelen www.anygma.com Niklas Broberg wrote: >> I'm pleased to announce a new release for the haskell-src-exts package. >> > > Twice in two days even. :-) > > haskell-src-exts 0.3.3 - now with support for type equality constraints. > > cabal sdist: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/haskell-src-exts-0.3.3 > darcs repo: http://code.haskell.org/HSP/haskell-src-exts > > Cheers, > > /Niklas > > >> haskell-src-exts 0.3.2 >> =========================== >> >> haskell-src-exts is a package for handling and manipulating Haskell >> source code. It is based on the haskell-src package that is part of >> the standard libraries, but extends this to support a number of >> syntactic extensions, e.g. MPTCs, fundeps, GADTs, TH etc. It is >> intended as a drop-in replacement for the standard haskell-src >> package, and exports the same functions and data types, plus some >> more. >> >> Apart from the more standard extensions supported by e.g. GHC, >> haskell-src-exts also provides support for HaRP (Haskell Regular >> Patterns) and HSX (Haskell Source with XML) syntax. >> >> Note that as of 0.3, haskell-src-exts /= HSX. >> >> * cabal sdist: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/haskell-src-exts-0.3.2 >> * darcs repo: darcs get http://code.haskell.org/HSP/haskell-src-exts >> >> >> === Changes from 0.2: === >> >> * Added support for >> - Indexed type families (including associated types/datatypes) >> - Explicit kind signatures >> - Standalone deriving >> >> * haskell-src-exts is now decoupled from hsx/trhsx and harp. >> - Modules renamed to Language.Haskell.Exts.* >> - Module Transform is removed from the package (now in package hsx) >> >> * New repository (i.e. darcs pull in an old repo won't work, use darcs >> get), containing only the haskell-src-exts package (no hsx or harp). >> >> * Builds with 6.8.2 (thanks Duncan Coutts) >> >> >> === Complete list of supported extensions === >> >> * Multi-parameter type classes (MPTCs) >> * Functional dependencies >> * Associated types, indexed type families >> * Liberal class and instance heads >> * Implicit parameters >> * Explicit kind signatures >> * Pattern guards >> * Generalized algebraic data types (GADTs) >> * Template Haskell (TH) >> * Universal and existential quantification (forall) >> * Empty data type declarations >> * Unboxed tuples (# #) >> * Standalone deriving >> * Regular patterns >> * Haskell XML, HSX style >> >> >> === Build Requirements === >> >> * happy >= 1.17 >> - It might work with 1.16 though I haven't tested. In that case >> change the cabal file. >> - It would work with older versions as well, though they insert a >> dependency on Array (haskell98) instead of Data.Array. If that's all >> you have to work with, update the cabal file with a dependency on >> haskell98. >> >> * Cabal >= 1.2 >> >> >> Patches are more than welcome. :-) >> >> Cheers, >> >> >> /Niklas >> >> > _______________________________________________ > Haskell-Cafe mailing list > Haskell-Cafe@haskell.org > http://www.haskell.org/mailman/listinfo/haskell-cafe > > > -------------- next part -------------- An HTML attachment was scrubbed... URL: http://www.haskell.org/pipermail/haskell/attachments/20080317/96bada26/attachment.htm From gmh at Cs.Nott.AC.UK Tue Mar 18 11:57:21 2008 From: gmh at Cs.Nott.AC.UK (Graham Hutton) Date: Tue Mar 18 11:55:45 2008 Subject: [Haskell] Two lectureships in Nottingham Message-ID: <14026.1205855841@cs.nott.ac.uk> Dear all, We are advertising two new Lectureships (Assistant Professorships) in Computer Science at the University of Nottingham in England. Applications in the area of functional programming are particularly welcome. Further details are available from: http://jobs.nottingham.ac.uk/vacancies.aspx?cat=160#j2797 The closing date for applications is 28th March 2008. Best wishes, Graham Hutton +-----------------------------------------------------------------+ | Dr Graham Hutton Email : gmh@cs.nott.ac.uk | | School of Computer Science | | University of Nottingham Web : www.cs.nott.ac.uk/~gmh | | Jubilee Campus, Wollaton Road | | Nottingham NG8 1BB, UK Phone : +44 (0)115 951 4220 | +-----------------------------------------------------------------+ This message has been checked for viruses but the contents of an attachment may still contain software viruses, which could damage your computer system: you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation. From lgreg.meredith at biosimilarity.com Tue Mar 18 15:59:05 2008 From: lgreg.meredith at biosimilarity.com (Greg Meredith) Date: Tue Mar 18 15:55:51 2008 Subject: [Haskell] NW Functional Programming Interest Group In-Reply-To: <5de3f5ca0802011155l771cc649wa0e671bbe3abe364@mail.gmail.com> References: <5de3f5ca0802011155l771cc649wa0e671bbe3abe364@mail.gmail.com> Message-ID: <5de3f5ca0803181259g5b8126deob020d86fd22cbd0d@mail.gmail.com> All, Apologies for multiple listings. A small cadre of us are organizing a Northwest Functional Programming Interest Group (hey... NWFPIG, that's kinda funny). Our next meeting is at the The Seattle Public Library 1000 - 4th Ave. Seattle, WA 98104 from 18:30 - 20:00 on March 19th. On this meeting's agenda - i'll give a highly idiosyncratic talk about the Curry-Howard isomorphism - followed an informal discussion section Hope to see you there. Monadically yours, --greg -- L.G. Meredith Managing Partner Biosimilarity LLC 806 55th St NE Seattle, WA 98105 +1 206.650.3740 http://biosimilarity.blogspot.com -------------- next part -------------- An HTML attachment was scrubbed... URL: http://www.haskell.org/pipermail/haskell/attachments/20080318/ba3e2bd0/attachment.htm From Ben.Lippmeier at anu.edu.au Thu Mar 20 02:09:36 2008 From: Ben.Lippmeier at anu.edu.au (Ben Lippmeier) Date: Thu Mar 20 02:06:27 2008 Subject: [Haskell] ANN: The Disciplined Disciple Compiler - alpha 1 Message-ID: <47E1FFA0.1090404@anu.edu.au> Hi All, I'm pleased to announce the initial alpha release of the Disciplined Disciple Compiler (DDC). Disciple is an explicitly lazy dialect of Haskell which includes: - first class destructive update of arbitrary data. - computational effects without the need for state monads. - type directed field projections. All this and more through the magic of effect typing. More information (and download!) available from: http://www.haskell.org/haskellwiki/DDC or http://code.google.com/p/disciple DDC: more than lambdas. Onward! Ben. From voigt at tcs.inf.tu-dresden.de Thu Mar 20 10:54:05 2008 From: voigt at tcs.inf.tu-dresden.de (Janis Voigtlaender) Date: Thu Mar 20 10:50:45 2008 Subject: [Haskell] PhD or PostDoc opening for Haskell research in Dresden Message-ID: <47E27A8D.8080006@tcs.inf.tu-dresden.de> Dear all, I have a research position on offer in the project described at: http://linux.tcs.inf.tu-dresden.de/~voigt/project/ The official job advertisement (in German) can be found at: http://www.verw.tu-dresden.de/StellAus/einzelstelle.asp?id=783 The key facts are: - full faculty position - no teaching duties - initial appointment for up to 30 months (maybe less for a PostDoc) Please contact me with any further questions. Please also forward to potentially interested students. The closing date for applications is 15th May 2008. Best wishes, Janis Voigtlaender -- Dr. Janis Voigtlaender http://wwwtcs.inf.tu-dresden.de/~voigt/ mailto:voigt@tcs.inf.tu-dresden.de From venanzio at cs.ru.nl Sat Mar 22 06:57:03 2008 From: venanzio at cs.ru.nl (Venanzio Capretta) Date: Sat Mar 22 06:53:33 2008 Subject: [Haskell] MSFP second call for papers Message-ID: <47E4E5FF.7010408@cs.ru.nl> SECOND CALL FOR PAPERS This is a reminder that the deadline for submission to MSFP is approaching. Second Workshop on MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING 6 July 2008, Reykjavik - Iceland A satellite workshop of ICALP 2008 PRESENTATION The workshop on Mathematically Structured Functional Programming is devoted to the derivation of functionality from structure. It is a celebration of the direct impact of Theoretical Computer Science on programs as we write them today. Modern programming languages, and in particular functional languages, support the direct expression of mathematical structures, equipping programmers with tools of remarkable power and abstraction. Monadic programming in Haskell is the paradigmatic example, but there are many more mathematical insights manifest in programs and in programming language design: Freyd-categories in reactive programming, symbolic differentiation yielding context structures, and comonadic presentations of dataflow, to name but three. This workshop is a forum for researchers who seek to reflect mathematical phenomena in data and control. The first MSFP workshop was held in Kuressaare, Estonia, in July 2006. An associated special issue of the Journal of Functional Programming is in preparation. INVITED SPEAKERS Andrej Bauer, University of Ljubljana Dan Piponi, Industrial Light and Magic SUBMISSIONS Electronic Notes in Theoretical Computer Science have provisionally agreed to publish the proceedings of MSFP 2008. ENTCS require submissions in LaTeX, formatted according to their guidelines (http://www.entcs.org/prelim.html). Papers must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Programme Committee members, barring the co-chairs, may (and indeed are encouraged to) contribute. Accepted papers must be presented at the workshop by one of the authors. There is no specific page limit, but authors should strive for brevity. We are using the EasyChair software to manage submissions. To submit a paper, please log in at: http://www.easychair.org/conferences/?conf=msfp2008. TIMELINE: Submission of abstracts: 4 April Submission of papers: 11 April Notification: 16 May Final versions due: 13 June Workshop: 6 July For more information about the workshop, go to: http://msfp.org.uk/ Programme Committee * Yves Bertot, INRIA, Sophia-Antipolis, France * Venanzio Capretta (co-chair), Radboud University, Nijmegen, The Netherlands * Jacques Carette, McMaster University, Hamilton, Ontario, Canada * Thierry Coquand, Chalmers University, G?teborg, Sweden * Andrzej Filinski, DIKU, University of Copenhagen, Denmark * Jean-Christophe Filli?tre, LRI, Universit? Paris Sud, France * Jeremy Gibbons, Oxford University, England * Andy Gill, Galois Inc., Portland, Oregon, USA * Peter Hancock, University of Nottingham, England * Oleg Kiselyov, FNMOC, Monterey, California, USA * Paul Blain Levy, University of Birmingham, England * Andres L?h, Utrecht University, The Netherlands * Marino Miculan, Universit? di Udine, Italy * Conor McBride (co-chair), Alta Systems, Northern Ireland * James McKinna, Radboud University, Nijmegen, The Netherlands * Alex Simpson, University of Edinburgh, Scotland * Tarmo Uustalu, Institute of Cybernetics, Tallinn, Estonia From s.clover at gmail.com Sun Mar 23 02:21:38 2008 From: s.clover at gmail.com (Sterling Clover) Date: Sun Mar 23 02:18:13 2008 Subject: [Haskell] ANN (2 Libs) -- hvac 0.1b, a lightweight web framework and HStringTemplate 0.3 Message-ID: 1) hvac 0.1b: transactional, declarative framework for lightweight web applications. 2) HStringTemplate 0.3 1) hvac 0.1b hvac (short for http view and controller) has been my project for the last little while, and is finally in a fairly usable state, so I'm opening up the repo (darcs get http://community.haskell.org/~sclv/ hvac/) for folks to play with and to get some feedback. While not quite yet ready for hackage, the package as provided should be fully cabal installable. Documentation is available at http:// community.haskell.org/~sclv/hvac/html_docs/hvac/ The aim of hvac is to provide an environment that makes the creation of lightweight fastcgi based web applications as simple as possible, with an emphasis on concise, declarative style code, correct concurrent transactional logic, and transparency in adding caching combinators. There are two included example programs, naturally neither of which is feature complete. They share a common login module of about 50 lines of code, excluding imports, templates, and database schema. The first program is a classic, greenspun-style message board with basic login functionality. It totals roughly 40 lines and tends to use just under 4mb of resident memory on my system. The second is a wiki based on Pandoc and the PandocWiki code. The code totals roughly 30 lines (rendering borrowed from PandocWiki aside) and uses about 5mb of memory. hvac processes all requests in the STM monad, with some bells attached to properly interleave STM with session, database and filesystem operations such that they all conceptually occur together in a single transaction per request. Currently it is only fully tested with sqlite, but it should operate, modulo a few tweaks, with any database accessible via HDBC. hvac is particularly designed to use the HStringTemplate library as an output layer, in a simple declarative fashion. As the StringTemplate grammar is explicitly sub-turing, this ensures a clean separation of program logic from presentation, while providing a nonetheless fairly powerful language to express typical display tasks. The included cache combinators, still experimental, should allow a simple and fine-grained control over the level of caching of various disk-bound operations. Phantom types are used to ensure that no functions that modify state may be cached. To give a flavor of hvac code, the following is the complete (twenty lines!) source of the wiki controller (due to sql statements, some lines are rather long): wikiController tmpl = h |/ "login" *> login_plug tmpl <|> (h |/ "wiki" |\\ \pageName -> h |// "POST" *> withValidation [ ("contents", return) ] (\ [contents] -> do pageId <- selectVal "id from pages where name=?" [toSql pageName] maybe (addErrors [("Login","must be logged in.")] >> continue) (\user -> case fromSql pageId of Just (_::Int) -> execStat "insert into page_hist (pageId,contents,author) values(?,?,?)" [pageId, toSql contents, toSql . userName $ user] Nothing -> do execStat "insert into pages (name,locked) values(?,?)" [toSql pageName, toSql (0::Int)] pid <- selectVal "max(id) from pages" [] execStat "insert into page_hist (pageId,contents,author) values(?,?,?)" [pid, toSql contents, toSql . userName $ user]) =<< getSes continue) <|> do pageId <- selectVal "id from pages where name=?" [toSql pageName] (join $ renderf (tmpl "showPage") ("pageName", pageName) <$> "pageContents" |= selectRow "* from page_hist where pageId=? order by time desc limit 1" [pageId] )) <|> (redirect . ( ++ "/wiki/Index") =<< scriptName) Future directions for work on hvac include: Stress testing for correctness of transactional logic and benchmarks. Exploration of various efficiency tweaks. Unit tests. Further development of the cache combinator API. Improvement of the example apps and addition of a few others (a blog maybe). Expansion of the library of validator functions. Exploration of transferring hvac to the standard FastCGI bindings (currently it uses a custom modified version to work properly with STM). Improvement of the database layer, particularly with regards to common paging functions. Creation of a set of simple combinators for generating CRUD (create read update delete) pages. Creation of a minimal set of standard templates (maybe). 2) HStringTemplate 0.3.1 This release of HStringTemplate (up now at Hackage) fixes a number of bugs pointed out to me by its small but growing user base (thanks, cinema, elliottt!) ranging from the minor (a particular two-level iteration pattern wasn't working properly) to the truly irritating (poor handling of file groups). It's still unfortunately skimpy on the docs, outside of the haddocks and the main StringTemplate grammar documentation at http://www.stringtemplate.org (although the examples from hvac should also prove helpful). However, it does have a set of very nice and handy new features for development. * renderf, a function similar in spirit to printf, that takes an arbitrary number of heterogeneous (String, value) tuples as arguments. This should cut down considerably on long setAttribute chains. Additionally, with custom instances (not, I'll grant, trivial to write) it can be used to declaratively chain together strings of attribute retrieval functions in arbitrary monads, as in the above code example from hvac. * dumpAttribs, a function/template that prints out the tree of the entire attribute environment a template is operating in -- extremely handy for development. * nullGroup, also for use in development, a simple way to display more information about templates that can't be found. Error messages in usafeVolatileDirectoryGroup have also been significantly improved. * getStringTemplate', a version of getStringTemplate guaranteed not to be inlined. While the optimizer will still sometimes rearrange code such that a volatile group is not updated properly, this at least helps remedy the situation (I think). * Some minor changes: For grammar reasons, dots have been removed from template names -- however, underscores and slashes are now available. Additionally, there's a much improved logic for which aspects of a local environment are overridden and preserved when a template is called from another. For both of these libraries, patches, comments, bug reports, requests, and of course contributions more than welcome! Regards, Sterl. From aslatter at gmail.com Sun Mar 23 14:11:35 2008 From: aslatter at gmail.com (Antoine Latter) Date: Sun Mar 23 14:08:05 2008 Subject: [Haskell] ANN: uuid-0.1.0 Haskell bindings to libuuid Message-ID: <694519c50803231111q4cf5b516ka8324d818e9eed65@mail.gmail.com> Haskell bindings to libuuid. The library libuuid is available as a part of e2fsprogs: http://e2fsprogs.sourceforge.net/. This library is useful for creating, comparing, parsing and printing Universally Unique Identifiers. See http://en.wikipedia.org/wiki/UUID for more details on UUIDs. -Antoine From lemmih at gmail.com Sun Mar 23 15:07:19 2008 From: lemmih at gmail.com (Lemmih) Date: Sun Mar 23 15:03:50 2008 Subject: [Haskell] ANN: uuid-0.1.0 Haskell bindings to libuuid In-Reply-To: <694519c50803231111q4cf5b516ka8324d818e9eed65@mail.gmail.com> References: <694519c50803231111q4cf5b516ka8324d818e9eed65@mail.gmail.com> Message-ID: On Sun, Mar 23, 2008 at 7:11 PM, Antoine Latter wrote: > Haskell bindings to libuuid. The library libuuid is available as a > part of e2fsprogs: http://e2fsprogs.sourceforge.net/. > > This library is useful for creating, comparing, parsing and printing > Universally Unique Identifiers. See http://en.wikipedia.org/wiki/UUID > for more details on UUIDs. Tarball and documentation can be found here: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/uuid -- Cheers, Lemmih From max.rabkin at gmail.com Mon Mar 24 14:37:18 2008 From: max.rabkin at gmail.com (Max Rabkin) Date: Mon Mar 24 14:33:44 2008 Subject: [Haskell] ANN: hmm-0.1 Message-ID: HMM is a library for creating and manipulating Hidden Markov Models. It contains implementations of the forward algorithm and Viterbi's algorithm. It is still experimental, but I hope it can be of some interest or use. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hmm-0.1 --Max From simonmarhaskell at gmail.com Mon Mar 24 17:09:25 2008 From: simonmarhaskell at gmail.com (Simon Marlow) Date: Mon Mar 24 17:05:51 2008 Subject: [Haskell] CONCUR 08: second call for papers Message-ID: <47E81885.3060304@gmail.com> [ posting on behalf of Franck van Breugel ] ------------------------------------------------------------------- Call for Papers 19th International Conference on Concurrency Theory (CONCUR 08) Toronto, Canada, August 19-22, 2008 >> http://www.cse.yorku.ca/concur08 << Submission deadline: April 11, 2008 ------------------------------------------------------------------- CONCUR 08, the 19th International Conference on Concurrency Theory, will take place in Toronto, Canada, on August 19-22, 2008. The purpose of the CONCUR conferences is to bring together researchers, developers, and students in order to advance the theory of concurrency, and promote its applications (in a broad sense). CONCUR 08 will be collocated with the 27th Annual ACM SIGACT-SIGOPS Symposium on the Principles of Distributed Computing (PODC 2008). The program of CONCUR and PODC includes invited talks by Tevfik Bultan, University of California, Santa Barbara, USA Peter Druschel, Max Planck Institute for Software Systems, Saarbruecken, Germany Joseph Halpern, Cornell University, Ithaca, USA Prakash Panangaden, McGill University, Montreal, Canada Shaz Qadeer, Microsoft Research, Redmond, USA Don Towsley, University of Massachusetts, Amherst, USA Furthermore, there will be a symposium celebrating the contributions of Nancy Lynch and the following nine workshops: Workshop on Approximate Behavioural Equivalences; Workshop on Concurrency in Enterprise Applications; Workshop on Distributed computing, Concurrency theory, and Verification; 15th International Workshop on Expressiveness in Concurrency; International Workshop on Foundations of Mobile Computing Workshop on Formal Methods for Wireless Systems; 10th International Workshop on Verification of Infinite-State Systems; 6th International Workshop on Security Issues in Concurrency; Young Researchers Workshop The overall event will take place at the University of Toronto on August 18-23, 2008. CONCUR 08 welcomes two categories of papers: - regular papers; - tool papers. Submissions are solicited in all areas of semantics, logics, verification and analysis of concurrent systems. The principal topics include (but are not limited to): - basic models of concurrency (such as abstract machines, domain theoretic models, game theoretic models, process algebras, and Petri nets); - logics for concurrency (such as modal logics, temporal logics and resource logics); - models of specialized systems (such as biology-inspired systems, circuits, hybrid systems, mobile systems, multi-core processors, probabilistic systems, real time systems, synchronous systems, and web services); - verification and analysis techniques for concurrent systems (such as abstract interpretation, atomicity checking, model-checking, race detection, run-time verification, state-space exploration, static analysis, synthesis, testing, theorem proving and type systems); - related programming models (such as distributed or object-oriented). Submissions will be evaluated by the program committee for inclusion in the proceedings, which will be published by Springer-Verlag in the Lecture Notes in Computer Science series. Papers must be in English and should be formatted according to the Springer-Verlag LNCS guidelines. Simultaneous submission to journals or other conferences with published proceedings is not allowed. Both regular and tool papers will be presented at the conference, and so at least one author of each accepted paper is expected to be present at the conference. The link for submissions is http://www.easychair.org/conferences/?conf=CONCUR08 Regular papers -------------- Authors are invited to submit an extended abstract. Regular papers must contain original contributions, be clearly written, and include appropriate reference to and comparison with related work. Authors are encouraged to submit a paper title and a short abstract before submitting the extended abstract. The short abstract should not exceed 200 words, and it should be entered in ASCII at the link given below. The extended abstract should not exceed 15 pages. If necessary, the extended abstract may be supplemented with a clearly marked appendix, which will be reviewed at the discretion of the program committee. Tool papers ----------- Tool papers should present novel tools based on aforementioned technologies (such as abstract interpretation, atomicity checking, model-checking, race detection, run-time verification, state-space exploration, static analysis, synthesis, testing, theorem proving and type systems) or fall into the above application areas (such as biology-inspired systems, circuits, hybrid systems, mobile systems, multi-core processors,probabilistic systems, real time systems, synchronous systems, and web services) and have an explicit emphasis on handling of concurrency. If previous versions of the tool have already been presented at meetings or published in some form, the enhancements and novel features of the tool should be clearly described. A tool paper should not exceed 4 pages and should have an appendix that provides a detailed description of: - how the oral presentation will be conducted (for example illustrated by a number of snapshots) and - the availability of the tool, the number and types of users, and other information which may illustrate the maturity and robustness of the tool (if applicable, a link to a web-page for the tool). The appendix will not be included in the proceedings, but during the evaluation of the tool papers it will be equally important as the pages submitted for publication in the proceedings. Important dates --------------- Abstract Submission: April 4, 2008 Paper Submission: April 11, 2008 (strict) Notification: May 27, 2008 Final version due: June 17, 2008 Program committee ----------------- Luca de Alfaro, University of California, Santa Cruz, USA Pedro R. D'Argenio, Universidad Nacional de Cordoba, Argentina Jos Baeten, Eindhoven University of Technology, the Netherlands Christel Baier, Technical University Dresden, Germany Eike Best, Carl von Ossietzky Universitaet Oldenburg, Germany Dirk Beyer, Simon Fraser University, Canada Patricia Bouyer, LSV, CNRS & ENS Cachan, France Mario Bravetti, University of Bologna, Italy Franck van Breugel (co-chair), York University, Canada Ilaria Castellani, INRIA Sophia Antipolis, France Marsha Chechik (co-chair), University of Toronto, Canada Wan Fokkink, Vrije Universiteit Amsterdam/CWI, the Netherlands Rob van Glabbeek, National ICT Australia Arie Gurfinkel, Carnegie Mellon University, USA Anna Ingolfsdottir, Reykjavik University, Iceland Radha Jagadeesan, DePaul University, USA Barbara Koenig, University of Duisburg-Essen, Germany Marta Kwiatkowska, University of Oxford, UK Orna Kupferman, Hebrew University, Israel Kim Larsen, Aalborg University, Denmark Nancy Lynch, MIT, USA P. Madhusudan, UIUC, USA Ugo Montanari, University of Pisa, Italy Anca Muscholl, Universite Bordeaux, France Catuscia Palamidessi, INRIA Futurs and LIX, France Corina Pasareanu, Perot Systems/NASA Ames Research Center, USA Scott Smolka, SUNY at Stony Brook, USA Nobuko Yoshida, Imperial College London, UK Steering Committee ------------------ Roberto Amadio, Universite Paris Diderot, France Jos Baeten, Eindhoven University of Technology, the Netherlands Eike Best, Carl von Ossietzky Universitaet Oldenburg, Germany Kim Larsen, Aalborg University, Denmark Ugo Montanari, University of Pisa, Italy Scott Smolka, SUNY at Stony Brook, USA Sponsors -------- IBM; Microsoft; SAP; Department of Computer Science, University of Toronto; Department of Computer Science and Engineering, York University. From demis at dimi.uniud.it Tue Mar 25 04:22:46 2008 From: demis at dimi.uniud.it (demis@dimi.uniud.it) Date: Tue Mar 25 04:19:14 2008 Subject: [Haskell] 1st CFP: 4th Int'l Workshop on Automated Specification and Verification of Web Systems (WWV'08) Message-ID: <20080325082249.5081EC884E0@smtp.uniud.it> Skipped content of type multipart/alternative From demis at dimi.uniud.it Tue Mar 25 05:14:30 2008 From: demis at dimi.uniud.it (demis@dimi.uniud.it) Date: Tue Mar 25 05:10:56 2008 Subject: [Haskell] 1st CFP: 17th Int'l Workshop on Functional and (Constraint) Logic Programming (WFLP'08) Message-ID: <20080325091432.90F1CC884F0@smtp.uniud.it> Skipped content of type multipart/alternative From waldmann at imn.htwk-leipzig.de Tue Mar 25 09:42:31 2008 From: waldmann at imn.htwk-leipzig.de (Johannes Waldmann) Date: Tue Mar 25 09:39:05 2008 Subject: [Haskell] Haskell OBDD package? Message-ID: <47E90147.2050107@imn.htwk-leipzig.de> I'm looking for current Haskell implementations of (ordered) binary decision diagrams. (Yes, I tried google but this gives links from 2004 and earlier.) Thanks - Johannes Waldmann. From haskell at list.mightyreason.com Tue Mar 25 09:53:07 2008 From: haskell at list.mightyreason.com (Chris Kuklewicz) Date: Tue Mar 25 09:49:40 2008 Subject: [Haskell] Haskell OBDD package? In-Reply-To: <47E90147.2050107@imn.htwk-leipzig.de> References: <47E90147.2050107@imn.htwk-leipzig.de> Message-ID: <47E903C3.3090008@list.mightyreason.com> Try http://www.informatik.uni-kiel.de/~mh/lehre/diplomarbeiten/christiansen.pdf from http://www.informatik.uni-kiel.de/~mh/lehre/diplomarchiv.html Johannes Waldmann wrote: > I'm looking for current Haskell implementations > of (ordered) binary decision diagrams. > > (Yes, I tried google but this gives links from 2004 and earlier.) > > Thanks - Johannes Waldmann. > _______________________________________________ > Haskell mailing list > Haskell@haskell.org > http://www.haskell.org/mailman/listinfo/haskell From niklas.broberg at gmail.com Tue Mar 25 15:33:36 2008 From: niklas.broberg at gmail.com (Niklas Broberg) Date: Tue Mar 25 15:30:17 2008 Subject: [Haskell] ANNOUNCE: Haskell Server Pages v 0.4 Message-ID: Greetings fellow Haskelleers, I am very pleased to announce a new chapter in the Haskell Server Pages saga. After a two-year long hiatus, while we in the team have been busy with Other Stuff, we have resumed work on Project HSP, and this release marks the first milestone. ================= === Project HSP === ================= Haskell Server Pages (HSP) is a programming model for writing dynamic web pages in Haskell, both server-side and client-side. One of its core features is the use of literal XML syntax mixed with ordinary Haskell code. * Project HSP home (with bug/feature tracker): http://code.google.com/p/hsp * Project HSP mailing list: haskell-server-pages@googlegroups.com * Project HSP darcs repos: http://code.haskell.org/HSP For flavor, here is a simple Hello World application written in HSP: ----- module HelloWorld where import HSP import HSP.HJScript import HJScript import HJScript.DOM -- A simple HTML page holding a button with onClick action. page :: HSP XML page = Hello World <% `onClick` (window # alert (string "Hello World !")) %> ----- Note that literal XML elements are first class expressions in HSP, unlike languages like PHP. Also note that using literal XML syntax is by no means required, if you don't feel like writing the XML manually (I sure don't!). There are combinators for building XHTML pages (although they are currently missing from version 0.4, will be added shortly, but release early and all that...). The most interesting new feature in version 0.4 is that literal XML syntax (or the equivalent combinators) can now be used to create XML elements both server-side and client-side, with the same code. Here is another short example script showing this feature: ------------------ module AddParagraph where import HJScript hiding (test) import HJScript.DOM import HSP import HSP.HJScript makeP x =

<% x %>

page :: HSP XML page = Add paragraph <% do (r,b) <- ref <% makeP "Paragraph created Server-side!" %> let fun = do let x = document # getElementById (string r) x <: makeP "Paragraph created Client-side!" return () b <: ( `onClick` fun) %> -------------------- Project HSP v 0.4 consists of a set of packages with related functionality: == package hsx == Haskell Source with XML (HSX, hsx) is a package that contains everything pertaining to literal XML syntax. In particular it contains a) the trhsx preprocessor that translates hsx source files into vanilla Haskell, and b) modules defining the functions that are injected by trhsx. It also nominally contains generic combinators for creating values of the same types as the literal XML syntax, though these modules are not present in 0.4. darcs get --partial http://code.haskell.org/HSP/hsx http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hsx-0.4 == package hsp == The core HSP package defines the datatypes and functions for writing server-side dynamic web pages. Also defines how to use the HJScript functionality in HSP pages, to allow for client-side dynamics as well. darcs get --partial http://code.haskell.org/HSP/hsp http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hsp-0.4 == package HJavaScript == This package defines an abstract syntax and (not-so-)pretty printer for a large subset of JavaScript, as Language.HJavaScript. However, a significant difference from JavaScript is that HJavaScript is typed, even on the abstract syntax level using GADTs. The subset of JavaScript that is supported is those parts that lend themself to typing (i.e. no prototyping of classes). darcs get --partial http://code.haskell.org/HSP/hjavascript http://hackage.haskell.org/cgi-bin/hackage-scripts/package/HJavaScript-0.4 == package HJScript == HJScript is a DSL built on top of HJavaScript, for writing client-side dynamic web pages. The programming model is fairly low-level, resembling the actual JavaScript code quite a lot, but should be easy to extend with higher-level functionality. Notable is that HJScript supports the use of literal XML syntax for creating DOM ElementNodes. Also notable is that HJScript supports Ajax functionality. HJScript and HJavaScript can be used independently of HSP, for creating JavaScript code. darcs get --partial http://code.haskell.org/HSP/hjscript http://hackage.haskell.org/cgi-bin/hackage-scripts/package/HJScript-0.4 == package hsp-cgi == Run HSP pages as CGI scripts. darcs get --partial http://code.haskell.org/HSP/hsp-cgi http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hsp-cgi-0.4 (Note: Earlier versions of HSP have come with a server application, hspr, providing the runtime environment for HSP. As of 0.4, this server has been discontinued and should be considered deprecated.) ===================== Notable items on the TODO list for Project HSP: - More functionality, allowing for higher-level programming models. - Writing larger applications, in order to stress test, and serve as inspiration for higher-level functionality. - Integrate with HAppS, to allow stateful computation (among other things). - A home on the web for HSP, with a web page written in HSP. We welcome both users (of course) and contributors to the project. There is much work to be done, and we welcome all help we can get. If you think this is interesting stuff, drop by our mailing list (haskell-server-pages@googlegroups.com). Like to do web programming in Haskell? Want to do a GSoC project? We in the project would be happy to see applications for HSP projects, and the list above is a good starting place. See for instance (http://hackage.haskell.org/trac/summer-of-code/ticket/1538) and (http://hackage.haskell.org/trac/summer-of-code/ticket/1539). Cheers, /Niklas on behalf of the Project HSP team From Malcolm.Wallace at cs.york.ac.uk Wed Mar 26 09:59:23 2008 From: Malcolm.Wallace at cs.york.ac.uk (Malcolm Wallace) Date: Wed Mar 26 09:59:42 2008 Subject: [Haskell] [GSoC] student applications deadline approaching Message-ID: <20080326135923.35dfeb33.Malcolm.Wallace@cs.york.ac.uk> Reply-To: haskell-cafe@haskell.org Just to remind students who are interested in Google Summer of Code. Student applications are now open, and the final deadline for submitting your proposals is 2400 UTC, 31st March. http://code.google.com/soc/2008/ Regards, Malcolm From andrei at cs.chalmers.se Fri Mar 28 16:12:01 2008 From: andrei at cs.chalmers.se (Andrei Sabelfeld) Date: Fri Mar 28 16:08:13 2008 Subject: [Haskell] PhD Positions in Language-based Security at Chalmers Message-ID: <47ED5111.3040807@cs.chalmers.se> ------------------------------------------------------------------------ *PhD Student Positions in Programming Language-based Security* Dept. of Computer Science and Engineering Chalmers University of Technology, Sweden Application deadline: April 30, 2008 Full version of this announcement: http://www.chalmers.se/en/sections/news/vacancies/positions/phd-student-positions-in6722 ------------------------------------------------------------------------ *The Department* The department provides a strong, international, and dynamic research environment with about 75 faculty and 75 PhD students. For more information, see http://www.chalmers.se/cse/EN/. Knowledge of Swedish is not a prerequisite for application. English is our working language for research. Both Swedish and English are used in undergraduate courses. Half of our researchers and PhD students are native Swedes; the rest come from more than 30 different countries. ------------------------------------------------------------------------ *PhD Project* The PhD students will join a world-leading team of researchers on *programming language-based security*. Language-based security facilitates specifying and enforcing security policies at the level of programming languages early in the software design and construction phase. The focus of the advertised positions is on *language-based information-flow security*. Given a program that manipulates sensitive data, the aim is to make sure there is no information flow (caused by the execution of the program) that may compromise the sensitive data. Drawing on the recent progress in this area, the goal of the positions is to pursue the following directions of work: * To design *rich security policies* for confidentiality and integrity, as demanded by practical applications (such as web applications). These security policies should be formal: they should operate at the level of programming-language semantics. * To develop *practical enforcement mechanisms* for these policies in expressive programming languages (such as web languages). These enforcement mechanisms may combine static (for example, type system-based) and dynamic (for example, execution monitoring-based) techniques. * To support the above with case studies in web-application security. In pursuing these goals, there are possibilities for collaboration with our high-profile academic and industrial partners. ------------------------------------------------------------------------ *Details about Employment* PhD student positions are limited to five years and will then normally include 20% departmental work, mostly teaching duties. Salary for the position is as specified in Chalmers' general agreement for PhD student positions. The positions are intended to start on September 1, 2008. In exceptional cases, we can imagine moving the starting date. ------------------------------------------------------------------------ *Suitable Background* Applicants must have a very good degree in Computing Science or in a related subject with a strong Computing Science component. They must also have a strong, documented interest in doing research. The ideal student for the project will have strong background in both programming languages and security. You may even apply if you have not yet completed your degree, but expect to do so before the position starts. In order to improve gender balance, Chalmers welcomes in particular applications from female candidates. ------------------------------------------------------------------------ *How to Apply* The full application should contain 1. A letter of application, listing specific research interests 2. Copies of degrees and other certificates 3. A curriculum vitae 4. Letters of recommendation from your teachers or employers 5. Copies of relevant work, for example dissertations, theses, or articles, that you have authored or co-authored You MUST include letters of recommendation: we typically get over 100 applications, and it is simply not feasible for us to request individual letters! Your application needs to include the job reference number 2008/60. The last date for your full application to arrive is April 30, 2008. The application can be submitted electronically, or on paper, following the guidelines on this web page: http://www.chalmers.se/en/sections/news/vacancies/positions/phd-student-positions-in6722 From dons at galois.com Sat Mar 29 18:38:34 2008 From: dons at galois.com (Don Stewart) Date: Sat Mar 29 18:34:56 2008 Subject: [Haskell] ANNOUNCE: xmonad 0.7 released Message-ID: <20080329223834.GD22951@scytale.galois.com> http://xmonad.org The xmonad dev team is pleased to announce xmonad 0.7! The headlines: The 0.7 release of xmonad provides several improvements over 0.6, including improved integration with GNOME, more flexible "rules", various stability fixes, and of course, many new and interesting features in the extension library (general support for window decorations, utf8 support, scratch pad terminals, pointer control) and more! New GNOME support: Active, automated support for GNOME utilities. We know our users often like to use GNOME menus, tools and status bars, and we'd like to announce that xmonad actively supports GNOME! Extensions for communicating with and utilising gnome utilities come in the library suite, as well as extensive documentation and support. For more information see the GNOME/xmonad integration page on the wiki. A period of active development: In the past year, the xmonad development team received contributions from over 60 developers, making xmonad one of the largest window manager development teams around, and dwarfing other tiling window manager projects. Yet, at the same time, the core code base remains at around 1000 lines of code, with another 7000 lines in the extension library -- a significant achievment! Change logs: http://haskell.org/haskellwiki/Xmonad/Notable_changes_since_0.6 http://xmonad.org/changelog-0.7.txt http://xmonad.org/changelog-xmc-0.7.txt About: xmonad is a tiling window manager for X. Windows are arranged automatically to tile the screen without gaps or overlap, maximising screen use. Window manager features are accessible from the keyboard: a mouse is optional. xmonad is extensible in Haskell, allowing for powerful customisation. Custom layout algorithms, key bindings and other extensions may be written by the user in config files. Layouts are applied dynamically, and different layouts may be used on each workspace. Xinerama is fully supported, allowing windows to be tiled on several physical screens. Features: * Very stable, fast, small and simple. * Automatic window tiling and management * First class keyboard support: a mouse is unnecessary * Full support for tiling windows on multi-head displays * Full support for floating, tabbing and decorated windows * Full support for Gnome and KDE utilities * XRandR support to rotate, add or remove monitors * Per-workspace layout algorithms * Per-screens custom status bars * Compositing support * Powerful, stable customisation and reconfiguration * Large extension library * Excellent, extensive documentation * Large, active development team, support and community Get it! Information, screenshots, documentation, tutorials and community resources are available from the xmonad home page: http://xmonad.org The 0.7 release, and its dependencies, are available from hackage.haskell.org: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/xmonad xmonad packages are available in the package systems of at least: Debian, Gentoo, Arch, Ubuntu, OpenBSD, NetBSD, FreeBSD, Gobo, NixOS, Source Mage, Slackware and 0.7 packages will appear in coming days (some are already available). On the fly updating to xmonad 0.7 is supported. You should be able to upgrade to xmonad 0.7 from 0.6 and earlier, transparently, without losing your session. Load the new code with mod-q and enjoy. Extensions: xmonad comes with a huge library of extensions (now more than 7 times the size of xmonad itself), contributed by viewers like you. Extensions enable pretty much arbitrary window manager behaviour to be implemented by users, in Haskell, in the config files. For more information on using and writing extensions see the webpage. The library of extensions is available from hackage: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/xmonad-contrib Full documentation for using and writing your own extensions: http://xmonad.org/contrib.html This release brought to you by the xmonad dev team: Spencer Janssen Don Stewart Jason Creighton David Roundy Brent Yorgey Devin Mullins Braden Shepherdson Roman Cheplyaka Lucas Mai Featuring code contributions from over 60 developers: Aaron Denney Adam Vogt Alec Berryman Alex Tarkovsky Alexandre Buisse Andrea Rossato Austin Seipp Bas van Dijk Ben Voui Brandon Allbery Chris Mears Christian Thiemann Clemens Fruhwirth Daniel Neri Daniel Wagner Dave Harrison David Glasser David Lazar Dmitry Kurochkin Dominik Bruhn Dougal Stanton Eric Mertens Ferenc Wagner Gwern Branwen Hans Philipp Annen Ivan Tarasov Jamie Webb Jeremy Apthorp Joachim Breitner Joachim Fasting Joe Thornber Joel Suovaniemi Juraj Hercek Justin Bogner Kai Grossjohann Karsten Schoelzel Klaus Weidner Mathias Stearn Mats Jansborg Matsuyama Tomohiro Michael Fellinger Michael Sloan Miikka Koskinen Neil Mitchell Nelson Elhage Nick Burlett Nicolas Pouillard Nils Anders Danielsson Peter De Wachter Robert Marlow Sam Hughes Shachaf Ben-Kiki Shae Erisson Simon Peyton Jones Stefan O'Rear Tom Rauchenwald Valery V. Vorotyntsev Will Farrington Yaakov Nemoy timthelion As well as the support of many others on the #xmonad and #haskell IRC channels, and the wider Haskell and window manager communities. Thanks to everyone for their support! From paul at cogito.org.uk Sun Mar 30 14:57:18 2008 From: paul at cogito.org.uk (Paul Johnson) Date: Sun Mar 30 14:53:35 2008 Subject: [Haskell] Announce: Decimal arithmetic package Message-ID: <47EFE28E.70701@cogito.org.uk> I've just uploaded version 0.1.0 of a decimal arithmetic package to Hackage. Decimal numbers are stored as an Integral mantissa and a Word8 exponent, where the number stored is mantissa * 10^(-exponent). In other words the exponent is the number of decimal places stored. There are also routines for partitioning a value such that the sum of the parts is equal to the original value. This is useful in financial arithmetic. This came out of my ongoing work on an AMQP binding for Haskell. Version 0-10 of the AMQP spec includes decimal fractions defined in this way for financial applications, so I thought I'd make a proper job of it. A darcs repository will be set up shortly. Paul. From ppdp08-cfp at clip.dia.fi.upm.es Mon Mar 31 04:38:20 2008 From: ppdp08-cfp at clip.dia.fi.upm.es (Elvira Albert) Date: Mon Mar 31 04:35:23 2008 Subject: [Haskell] PPDP'08: Last Call for Papers Message-ID: ................................................................ ACM PPDP 2008 - Last Call For Papers 10th ACM-SIGPLAN International Symposium on Principles and Practice of Declarative Programming Valencia, Spain, July 15-17, 2008 http://www.clip.dia.fi.upm.es/Conferences/PPDP08 ................................................................ IMPORTANT DATES Submission: April 10, 2008 Notification: May 15, 2008 Conference: July 15-17, 2008 SCOPE: PPDP 2008 is a forum for researchers and practitioners in the declarative programming communities. It solicits papers on all aspects of logic, constraint and functional programming, as well as on related paradigms such as visual programming, executable specification languages, database languages, AI and knowledge representation languages for the "semantic web". MAIN TOPICS: Logic, Constraint, and Functional Programming; Database, AI and Knowledge Representation Languages; Visual Programming; Executable Specification for Languages; Applications of Declarative Programming; Methodologies for Program Design and Development; Declarative Aspects of Object-Oriented Programming; Concurrent Extensions to Declarative Languages; Declarative Mobile Computing; Paradigm Integration; Proof Theoretic and Semantic Foundations; Type and Module Systems; Program Analysis and Verification; Program Transformation; Abstract Machines and Compilation; Programming Environments. PROCEEDINGS: The proceedings will be published by ACM Press RELATED EVENTS: PPDP 2008 will be co-located with the 15th International Static Analysis Symposium (SAS 2008) and the 18th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2008). SYMPOSIUM CHAIR: Elvira Albert, Complutense University of Madrid PROGRAM CHAIR: Sergio Antoy, Portland State University INVITED SPEAKER: Michael Leuschel, University of D??sseldorf, Germany PROGRAM COMMITTEE: Elvira Albert Complutense University of Madrid, Spain Sergio Antoy Portland State University, USA Maribel Fernandez King's College London, UK Maurizio Gabbrielli University of Bologna, Italy Neil Ghani University of Nottingham, UK Masami Hagiya University of Tokyo, Japan Joxan Jaffar National University, Singapore Claude Kirchner INRIA Bordeaux, France Herbert Kuchen University of Muenster, Germany Michael Maher NICTA and University of New South Wales, Australia Dale Miller INRIA Saclay, France Eugenio Moggi University of Genova, Italy Kostis Sagonas Uppsala University, Sweden Carsten Schurmann, IT University of Copenhagen, Denmark Peter Sestoft IT University of Copenhagen, Denmark LOCAL CHAIR: Christophe Joubert SYMPOSIUM VENUE: The conference will be held at the Technical University of Valencia, Spain.