- Haskell - Haskell.org

how to delete images on the wiki
by Wolfgang Jeltsch 31 Oct '07

31 Oct '07

Hello, does anyone know how to delete images on the Haskell Wiki which were errornously added under a wrong name? Best wishes, Wolfgang

2 1

placing modules in the module hierarchy
by Wolfgang Jeltsch 29 Oct '07

29 Oct '07

Hello, I’m developing the Grapefruit library, a library for writing graphical user interfaces and animated graphics using concepts of Functional Reactive Programming. At the moment, all modules of Grapefruit reside under Graphics.UI.Grapefruit but I’m not satisfied with this situation. The reason is that a certain part of Grapefruit just deals with graphics, not user interfaces, and another part deals with basic reactive programming things (several kinds of signals) which could be used in contexts totally different from user interfaces and graphics (for example, sound synthesis). So I thought about spreading Grapefruit’s modules over the module hierarchy. In particular, I thought about splitting the set of modules into the following parts: * Control.Grapefruit and submodules * Graphics.Rendering.Grapefruit and submodules * Graphics.UI.Grapefruit and submodules However, including the name of the library all the time doesn’t seem like a very good idea to me. First, it’s confusing to have three subtrees of the module tree named “Grapefruit” since this looks like if there were three libraries of this name. Second, it’s strange to have Control.Grapefruit beside Control.Monad and Control.Concurrent since “monad” and “concurrent” are concepts whereas “Grapefruit” is a library. Since the Control.Grapefruit subtree would probably only consist of Control.Grapefruit.Signal and submodules, I’d prefer to just use Control.Signal and Control.Signal.*. But this would pose the problem that no other FRP library could use Control.Signal without conflicting with Grapefruit. At the moment, I don’t know of any general rule which gives an answer to these questions. It seems like the current module hierarchy follows multiple guidelines. For example, there are Graphics.Win32 and Graphics.X11 beside Graphics.Rendering and Graphics.UI, the former two referring to existing APIs, the latter two referring to concepts. Below Graphics.Rendering and Graphics.UI there are modules whose names refer to existing APIs again (OpenGL, GLUT, Gtk2Hs). A further question would be if putting FRP signals under Control is sensible at all, or if they should be put under Data. Signals denote functions from time to some value space (but are usually not implemented as simple functions). I’d appreciate any helpful information concerning this topic. Best wishes, Wolfgang

1 0

PhD position at Chalmers
by John Hughes 26 Oct '07

26 Oct '07

The Functional Programming group at Chalmers is seeking to recruit a PhD student to work on domain-specific languages embedded in Haskell for hardware design, and for programming graphics processors. PhD positions in Sweden are real jobs, paying a respectable salary for up to five years. The official announcement follows. John Hughes PhD Position in Functional Programming at the department of Computer Science and Engineering The Department provides strongly international and dynamic research environments with 76 faculty and 55 PhD students from about 30 countries. 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 20 different countries. Aim of work The PhD student will pursue research on applying techniques from functional programming to develop novel methods of hardware design and verification. The PhD student will join the research activities at our department in applications of functional programming. In particular, we have concentrated on the design and application of Domain Specific Embedded Languages in Haskell. Two examples of our work are QuickCheck for specification-guided random testing and Lava for hardware design and verification. We have also developed Wired, for designing high performance hardware at the layout level. This project continues the above theme, by considering higher levels of abstraction, but still aiming to take account of physical properties, to give good performance and power consumption. We will even extend our ideas about circuit design to data parallel programming, including GPU programming. Applicants must have a very good undergraduate 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 be an accomplished functional programmer with an interest in applied functional programming. You may even apply if you have not yet completed your degree, but expect to do so by 1 January 2008. 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. A curriculum vitae 3. Attested copies of degrees and other certificates 4. Copies of relevant work, for example dissertations or articles, that you have authored or co-authored 5. Letters of recommendation from your teachers or employers *** You MUST include or e-mail Letters of Recommendation: we typically get over 100 apps, and it is simply not feasible for us to request individual letters *** The job reference number is: 2007/161. The last date for your full application to arrive is November 27, 2007 Send your application electronically in PDF files or by paper-mail to Registrator, Chalmers University of Technology, Se-412 96 Göteborg, Sweden. Phone: +4631 772 1000, Fax: +4631 772 4922, E-mail: registrator(a)adm.chalmers.se Details about employment The appointee must also have been admitted to Chalmers Doctoral Program. PhD student positions are limited to five years and will then normally include 20% departmental work, mostly teaching duties. Admission and employment are regulated in Chalmers' "Rules of Procedure for Doctoral Programs", §4 and §5. Salary follows the agreement for PhD student positions. Further information Research level: Professor Mary Sheeran e-mail ms'at'chalmers.se Division level: Graduate studies director Philippas Tsigas, e-mail: tsigas'at'chalmers.se Union representatives: SACO Jan Lindér, ST-ATF Marie Wenander, SEKO Ralf Berndtsson All reachable via Chalmers exchange: +46 31 772 10 00

1 0

Haskell Weekly News: October 25, 2007
by Don Stewart 26 Oct '07

26 Oct '07

--------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20071025 Issue 66 - October 25, 2007 --------------------------------------------------------------------------- Welcome to issue 66 of HWN, a newsletter covering developments in the [1]Haskell community. A huge month for the Haskell community, with the Haskell Workshop, ICFP and CUFP conferences, the second international Haskell Hackathon, and 63 libraries and tools uploaded to hackage! A round of applause to everyone involved! 1. http://haskell.org/ Hackage This week's new libraries in [2]the Hackage library database. 2. http://hackage.haskell.org/ * SDL 0.5.0. Uploaded by Lemmih. [3]SDL, a binding to libSDL. * Stream 0.2.1. Uploaded by Wouter Swierstra. [4]Stream, functions, analogous to those from Data.List, to create and manipulate infinite lists * bktrees 0.1.1. Uploaded by Josef Svenningsson. [5]bktrees, Burhard-Keller trees provide an implementation of sets which apart from the ordinary operations also has an approximate member search, allowing you to search for elements that are of a certain distance from the element you are searching for. * happy 1.17. Uploaded by Simon Marlow. [6]happy, a parser generator for Haskell. * HaXml 1.19. Uploaded by Malcolm Wallace. [7]HaXml, utilities for parsing, filtering, transforming and generating XML documents. 3. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/SDL-0.5.0 4. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/Stream-0.2.1 5. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/bktrees-0.1.1 6. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/happy-1.17 7. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/HaXml-1.19 * polyparse 1.1. Uploaded by Malcolm Wallace. [8]polyparse, A variety of alternative parser combinator libraries, including the original HuttonMeijer set. The Poly sets have features like good error reporting, arbitrary token type, running state, lazy parsing, and so on. Finally, Text.Parse is a proposed replacement for the standard Read class, for better deserialisation of Haskell values from Strings. * bzlib 0.4.0.1 . Uploaded by Duncan Coutts. [9]bzlib, compression and decompression in the bzip2 format. * zlib 0.4.0.1. Uploaded by Duncan Coutts. [10]zlib, compression and decompression in the gzip and zlib formats * tar 0.1.1.1. Uploaded by Bjorn Bringert. [11]tar, a library for reading and writing TAR archives. * unix-compat 0.1.2.0. Uploaded by Bjorn Bringert. [12]unix-compat, provides portable implementations of parts of the unix package. This package re-exports the unix package when available. When it isn't available, portable implementations are used. 8. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/polyparse-1.1 9. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/bzlib-0.4.0.1 10. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/zlib-0.4.0.1 11. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/tar-0.1.1.1 12. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/unix-compat-0.1.… * oeis 0.1. Uploaded by Brent Yorgey. [13]oeis, Haskell interface to the Online Encyclopedia of Integer Sequences. * dataenc 0.9. Uploaded by Magnus Therning. [14]dataenc, Data encoding library currently providing Uuencode, Base64, Base64Url, Base32, Base32Hex, and Base16. * cabal-setup 1.2.1. Uploaded by Simon Marlow. [15]cabal-setup, cabal-setup is a user interface to Cabal. It provides the basic commands for configuring, building, and installing Cabal packages. * cabal-install 0.4.0. Uploaded by cabal-devel(a)haskell.org. [16]cabal-install, apt-get like tool for Haskell. The 'cabal' command-line program simplifies the process of managing Haskell software by automating the fetching, configuration, compilation and installation of Haskell libraries and programs. * HTTP 3001.0.0. Uploaded by Bjorn Bringert. [17]HTTP, A library for client-side HTTP. 13. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/oeis-0.1 14. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/dataenc-0.9 15. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/cabal-setup-1.2.1 16. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/cabal-install-0.… 17. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/HTTP-3001.0.0 * iconv 0.4. Uploaded by Duncan Coutts. [18]iconv, provides an interface to the POSIX iconv library functions for string encoding conversion. * binary 0.4.1. Uploaded by the Binary Strike Team. [19]binary, efficient, pure binary serialisation using lazy ByteStrings. Haskell values may be encoded to and form binary formats, written to disk as binary, or sent over the network. Serialisation speeds of over 1 G/sec have been observed, so this library should be suitable for high performance scenarios. * Cabal 1.2.1. Uploaded by cabal-devel(a)haskell.org. [20]Cabal: the Haskell Common Architecture for Building Applications and libraries = Libraries: a framework defining a common interface for authors to more easily build their Haskell applications in a portable way. The Haskell Cabal is meant to be a part of a larger infrastructure for distributing, organizing, and cataloging Haskell libraries and tools. * bytestring 0.9. Uploaded by Don Stewart and Duncan Coutts. [21]bytestring. fast, packed, strict and lazy byte arrays with a list interface. * arrows 0.3. Uploaded by Ross Paterson. [22]arrows, Several classes that extend the Arrow class, and some transformers that implement or lift these classes. 18. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/iconv-0.4 19. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/binary-0.4.1 20. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/Cabal-1.2.1 21. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/bytestring-0.9 22. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/arrows-0.3 * sat 1.0. Uploaded by Andrii Zvorygin. [23]sat, CNF(Clausal Normal Form) SATisfiability Solver and Generator. * pcap 0.4. Uploaded by Bryan O'Sullivan. [24]pcap, system-independent interface for user-level packet capture * hslogger4j 0.1.1. Uploaded by Bjorn Buckwalter. [25]hslogger4j, provides handlers for hslogger (John Goerzen's Haskell logging library) that are compatible with log4j's XMLLayout. In particular log messages created by the handlers can be published directly to the GUI-based log viewer Chainsaw v2. * IndentParser 0.2.1. Uploaded by Piyush P Kurur. [26]IndentParser, provides two modules, Text.ParserCombinators.Parsec.IndentParser and Text.ParserCombinators.Parsec.IndentToken, for constructing parser combinators for indentation based syntactic structures. The former exports the basic indentation parser combinators and the later together with Text.ParserCombinators.Parsec.Language and Text.ParserCombinators.Parsec.Token can be used to define tokenisers for programming languages. * lazysmallcheck 0.1. Uploaded by Matthew Naylor and Fredrik Lindblad. [27]lazysmallcheck, a library for exhaustive, demand-driven testing of Haskell programs. It is based on the idea that if a property holds for a partially-defined input then it must also hold for all fully-defined instantiations of the that input. Compared to `eager' input generation as in SmallCheck, Lazy SmallCheck may require significantly fewer test-cases to verify a property for all inputs up to a given depth. 23. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/sat-1.0 24. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/pcap-0.4 25. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hslogger4j-0.1.1 26. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/IndentParser-0.2… 27. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/lazysmallcheck-0… * HPDF 1.2. Uploaded by alpheccar. [28]HPDF, A PDF library with support for several pages, page transitions, outlines, annotations, compression, colors, shapes, patterns, jpegs, fonts, typesetting ... * xmonad. Uploaded by Spencer Janssen and Don Stewart. [29]xmonad, xmonad is a tiling window manager for X. Windows are arranged automatically to tile the screen without gaps or overlap, maximising screen use. All features of the window manager are accessible from the keyboard: a mouse is strictly optional. xmonad is written and extensible in Haskell. Custom layout algorithms, 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 screens. * HCL 1.2. Uploaded by Justin Bailey. [30]HCL, provides a set of functions for building simple command-line interfaces. It allows interfaces which collect values (such as Integers, Dates, or other structured values), build lists of values, and use simple menus. It is not intended to build complex interfaces with full cursor control. It is oriented towards line-based interfaces. * safecopy 0.2. Uploaded by David Himmelstrup. [31]safecopy, an extension to Data.Binary with built-in version control. * selenium 0.2.1. Uploaded by Aaron Tomb. [32]selenium, Haskell bindings to communicate with a Selenium Remote Control server. This package makes it possible to use Haskell to write test scripts that exercise web applications through a web browser. 28. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/HPDF-1.2 29. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/xmonad-0.4 30. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/HCL-1.2 31. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/safecopy-0.2 32. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/selenium-0.2.1 * HsOpenSSL 0.2. Uploaded by PHO. [33]HsOpenSSL, a (part of) OpenSSL binding for Haskell. It can generate RSA and DSA keys, read and write PEM files, generate message digests, sign and verify messages, encrypt and decrypt messages. * X11-extras 0.4. Uploaded by Spencer Janssen. [34]X11-extras, missing bindings to the X11 graphics library. * X11-1.2.3. Uploaded by Don Stewart. [35]X11, a Haskell binding to the X11 graphics library. * flow2dot-0.2. Uploaded by Dmitry Astapov. [36]flow2dot, generates sequence diagrams from textual descriptions with help of Graphviz graph drawing tool. * hsSqlite3-0.0.1. Uploaded by Evgeny Jukov. [37]hsSqlite, Bindings for Sqlite3 33. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/HsOpenSSL-0.2 34. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/X11-extras-0.4 35. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/X11-1.2.3 36. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/flow2dot-0.2 37. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hsSqlite3-0.0.1 * X11-xft-0.1. Uploaded by Clemens Fruhwirth. [38]X11-xft, Bindings to the Xft, X Free Type interface library, and some Xrender parts. * metaplug-0.1.1. Uploaded by Austin Seipp. [39]metaplug, a ghc-api wrapper, designed to make the api more transparent across releases and offer eval and plugin esque facilities in the form of a simple, easy to modify library. * dimensional. Uploaded by Bjorn Buckwalter. [40]dimensional, a library providing data types for performing arithmetic with physical quantities and units. Information about the physical dimensions of the quantities and units is embedded in their types and the validity of operations is verified by the type checker at compile time. The boxing and unboxing of numerical values as quantities is done by multiplication and division with units. The library is designed to, as far as is practical, enforce/encourage best practices of unit usage. * ProbabilityMonads. Uploaded by Eric Kidd. [41]ProbabilityMonads, tools for random sampling, explicit enumeration of possible outcomes, and applying Bayes' rule. Highly experimental, and subject to change. In particular, the Data.Probability API is rather poor and could stand an overhaul. * MonadRandom. Uploaded by Eric Kidd . [42]MonadRandom, support for computations which consume random values. 38. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/X11-xft-0.1 39. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/metaplug-0.1.1 40. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/dimensional-0.7 41. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/ProbabilityMonad… 42. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/MonadRandom-0.1.0 * MaybeT. Uploaded by Eric Kidd. [43]MaybeT, Support for computations with failures. * network-bytestring. Uploaded by Johan Tibell. [44]network-bytestring, Faster and more memory efficient low-level socket functions using Data.ByteStrings instead of Strings. * irc. Uploaded by Trevor Elliott. [45]irc, a set of combinators and types for parsing IRC messages. * clevercss. Uploaded by Georg Brandl. [46]clevercss, a CSS preprocessing library that allows defining variables and nesting selectors so that you don't need to Repeat Yourself. * HsHyperEstraier. Uploaded by PHO. [47]HsHyperEstraier, a HyperEstraier binding for Haskell. HyperEstraier is an embeddable full text search engine which is supposed to be independent to any particular natural languages. 43. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/MaybeT-0.1.0 44. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/network-bytestri… 45. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/irc-0.2.3 46. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/clevercss-0.1 47. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/HsHyperEstraier-… * libmpd. Uploaded by Ben Sinclair. [48]libmpd, client library for MPD, the Music Player Daemon. * hS3. Uploaded by Greg Heartsfield. [49]hS3, provides an interface to Amazon's Simple Storage Service (S3), allowing Haskell developers to reliably store and retrieve arbitrary amounts of data from anywhere on the Internet. * infinity. Uploaded by Austin Seipp. [50]infinity, tiny IRC bot, extendable through plugins written in haskell * WURFL. Uploaded by alpheccar. [51]WURFL, support for the WURLF file format * hburg. Uploaded by Igor Boehm. [52]hburg, a program that generates tree parsers for cost-augmented tree grammars. It is useful for writing code generators for compilers. Given a mapping of a tree structured intermediate representation onto target machine instructions, HBURG generates a code generator that can be plugged into the instruction selection phase of a compiler. 48. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/libmpd-0.1.3 49. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hS3-0.2 50. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/infinity-0.1.1 51. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/WURFL-0.1 52. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hburg-1.1 * ipprint. Uploaded by Gleb Alexeyev. [53]ipprint, tiny helper for pretty-printing values in ghci console * numbers. Uploaded by Lennart Augustsson. [54]numbers, instances of the numerical classes for a variety of different numbers: (computable) real numbers, arbitrary precision fixed numbers, arbitrary precision floating point numbers, differentiable numbers, symbolic numbers, natural numbers, interval arithmetic. * numeric-quest. Uploaded by Henning Thielemann. [55]numeric-quest, List based linear algebra, similtaneous linear equations, eigenvalues and eigenvectors, roots of polynomials, transcendent functions with arbitrary precision implemented by continued fractions, quantum operations, tensors * shell-pipe. Uploaded by Henning Thielemann. [56]shell-pipe, shell scripting stuff. * hstats. Uploaded by Marshall Beddoe. [57]hstats, library of commonly used statistical functions. 53. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/ipprint-0.3 54. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/numbers-2007.9.25 55. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/numeric-quest-0.1 56. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/shell-pipe-0.1 57. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hstats-0.2 Libraries This week's proposals and extensions to the [58]standard libraries. * [59]In base, for Data.Version, change the meaning of comparisons * [60]Add Compositor class as superclass of Arrow 58. http://haskell.org/haskellwiki/Library_submissions 59. http://article.gmane.org/gmane.comp.lang.haskell.libraries/7847 60. http://thread.gmane.org/gmane.comp.lang.haskell.libraries/7663 Conference roundup Haskell papers presented at the Haskell Workshp, ICFP and CUFP, in Freiburg, Germany. * [61]Andy Gill and Colin Runciman. Haskell Program Coverage (pdf) 61. http://www.unsafeperformio.com/papers/Hpc07.pdf * [62]Simon Marlow, José Iborra, Bernard Pope and Andy Gill. A Lightweight Interactive Debugger for Haskell (pdf) 62. http://www.haskell.org/~simonmar/papers/ghci-debug.pdf * [63]Wouter Swierstra and Thorsten Altenkirch. Beauty in the Beast: A Functional Semantics of the Awkward Squad (pdf) 63. http://www.cs.nott.ac.uk/~txa/publ/beast.pdf * [64]Matthew Naylor, Emil Axelsson and Colin Runciman. A Functional-Logic Library for Wired (acm.org) 64. http://tinyurl.com/2mw6jo * [65]Neil Mitchell and Colin Runciman. Uniform Boilerplate and List Processing; Or: Scrap Your Scary Types (pdf) 65. http://tinyurl.com/yulkt4 * [66]Philip Wadler and Simon Peyton Jones. Comprehensions with `Order by' and `Group by' 66. http://research.microsoft.com/~simonpj/papers/list-comp/index.htm * [67]Geoffrey Mainland. Why It's Nice to be Quoted: Quasiquoting for Haskell 67. http://www.eecs.harvard.edu/~mainland/ghc-quasiquoting/ * [68]Louis-Julien Guillemette and Stefan Monnier. A Type-Preserving Closure Conversion in Haskell (pdf) 68. http://www.iro.umontreal.ca/~monnier/tcm.pdf * [69]Demo 1: George Giorgidze and Henrik Nilsson. Programming Modular Synthesizer in Haskell (.mov) 69. http://www.ludd.ltu.se/~pj/hw2007/modular%20synthesis.mov * [70]Demo 2: Martin Grabmüller and Dirk Kleeblatt. Run-time Code Generation in Haskell (.mov) 70. http://www.ludd.ltu.se/~pj/hw2007/harpy.mov * [71]Joao Fernandes, Alberto Pardo and João Saraiva. A Shortcut Fusion Rule for Circular Program Calculation (pdf) 71. http://www.fing.edu.uy/~pardo/papers/hw07.pdf * [72]Peng Li, Andrew Tolmach, Simon Marlow and Simon Peyton Jones. Lightweight concurrency primitives for GHC (pdf) 72. http://web.cecs.pdx.edu/~apt/hw07.pdf * [73]Demo 3: Don Stewart XMonad (.mov) 73. http://www.ludd.ltu.se/~pj/hw2007/xmonad.mov * [74]Videos of all the Haskell Workshop talks 74. http://www.ludd.ltu.se/~pj/hw2007/HaskellWorkshop.html * [75]Selected videos from ICFP and IFL 75. http://www.ludd.ltu.se/~pj/icfp2007/ICFP2007.html Jobs Finance. An NYC finance company [76]requires an expert level Haskell user; must be comfortable with monads, monad transformers, type level programming (i.e. MPTC, overlapping and undecidable instances), and lazy evaluation (i.e. know how to find and eliminate space leaks). 76. http://article.gmane.org/gmane.comp.lang.haskell.cafe/30228 Web Developer. RedNucleus Ltd [77]requires a highly motivated programmer for a full or part-time posititon developing social web applications. Initially you will develop and maintain applications using RubyOnRails or a similar framework, but there will be opportunities to explore new web programming paradigms with declarative languages. The successful application will have exposure to functional programming methodologies, e.g. in Haskell, Lisp or Erlang 77. http://article.gmane.org/gmane.comp.lang.haskell.cafe/30685 Blog noise [78]Haskell news from the [79]blogosphere. 78. http://planet.haskell.org/ 79. http://haskell.org/haskellwiki/Blog_articles * [80]Strongly Specified Functions * [81]Amazon S3 binding * [82]Octane Mech, OpenGL Haskell based mech game; early code and some haskell notes * [83]Fast, parallel log file processing in Haskell * [84]Haskell in the Hallway: an interview with Simon Peyton Jones * [85]Agda Exercise: Sized Mergesort * [86]Agda Exercise: Proving that Mergesort Returns Ordered Lists * [87]Lazy functions in C# LlNQ * [88]Functional Javascript * [89]Seemingly impossible functional programs * [90]For most programmers learning Haskell will be no picnic : a tutorial 80. http://sequence.complete.org/node/363 81. http://scsibug.com/2007/09/23/haskell-s3-library/ 82. http://berlinbrowndev.blogspot.com/2007/09/octane-mech-opengl-haskell-based… 83. http://www.serpentine.com/blog/2007/09/25/what-the-heck-is-a-wide-finder-an… 84. http://port25.technet.com/archive/2007/09/26/haskell-in-the-hallway-sam-int… 85. http://www.iis.sinica.edu.tw/~scm/?p=36 86. http://www.iis.sinica.edu.tw/~scm/?p=37 87. http://www.aboutcode.net/2007/09/27/Lazy+Functions+In+LINQ.aspx 88. http://osteele.com/sources/javascript/functional/ 89. http://math.andrej.com/2007/09/28/seemingly-impossible-functional-programs/ 90. http://www.lisperati.com/haskell/ht5.html * [91]Haskell in industry: a surprising encounter! * [92]Exhaustive search over infinite binary trees * [93]How to Install HAppS * [94]Simple Haskell Web Programming with HAppS * [95]Haskell Web Spider, Part 1: HaXML * [96]Haskell Web Spider, Part 2: HXT, or I Was Promised There Would Be No Side Effects * [97]In praise of implementation-defined languages * [98]Arboreal Isomorphisms from Nuclear Pennies * [99]Higher-dimensional enumeration * [100]Haskell and my preception of programming languages 91. http://pinderkent.blogsavy.com/archives/133 92. http://conway.rutgers.edu/~ccshan/wiki/blog/posts/Exhaustive/ 93. http://bluebones.net/2007/09/how-to-install-happs/ 94. http://bluebones.net/2007/09/simple-haskell-web-programming-with-happs/ 95. http://kevin.scaldeferri.com/blog/2007/09/29/UrlSpider1HaXML.html 96. http://kevin.scaldeferri.com/blog/2007/09/30/UrlSpider2HXT.html 97. http://pozorvlak.livejournal.com/70452.html 98. http://sigfpe.blogspot.com/2007/09/arboreal-isomorphisms-from-nuclear.html 99. http://byorgey.wordpress.com/2007/10/01/higher-dimensional-enumeration/ 100. http://serishema.livejournal.com/28327.html * [101]Monads in Scala * [102]Total stream processors and quantification over infinite number of infinite streams * [103]The xmonad experience * [104]Wiring Haskell into a FastCGI Web Server * [105]A Link-Resolving Library * [106]Immutable data structures are the way of the future in C# * [107]What do you get when you curry partial application? * [108]Universal Architecture * [109]lambdacats * [110]A venture into functional programming (by a Python programmer) 101. http://james-iry.blogspot.com/2007/10/monads-are-elephants-part-2.html 102. http://conway.rutgers.edu/~ccshan/wiki/blog/posts/StreamPEval/ 103. http://braindump.dk/tech/2007/10/01/the-xmonad-experience/ 104. http://mult.ifario.us/articles/2007/10/03/wiring-haskell-into-a-fastcgi-web… 105. http://freeshells.ch/~revence/Link.lhs 106. http://blogs.msdn.com/ericlippert/archive/2007/10/04/path-finding-using-a-i… 107. http://tinyurl.com/2mdo93 108. http://luqui.org/blog/archives/2007/10/05/universal-architecture/ 109. http://arcanux.org/lambdacats.html 110. http://pyside.blogspot.com/2007/10/venture-into-functional-programming.html * [111]Is Java Dying? * [112]Tracing your code... the dirty way! * [113]Using Emacs to insert SCC annotations in Haskell code * [114]Erlang and Haskell Books: First Impressions * [115]Update on F# and Haskell, especially monads * [116]Back from ICFP * [117]A Simple RPN Calculator in Haskell * [118]Another simple RPN calculator in Haskell * [119]A simple regex engine in Haskell * [120]The square of the Catalan sequence 111. http://fiatdev.com/2007/10/09/is-java-dying 112. http://monadicheadaches.blogspot.com/2007/10/tracing-your-code-dirty-way.ht… 113. http://www.serpentine.com/blog/2007/10/09/using-emacs-to-insert-scc-annotat… 114. http://on-ruby.blogspot.com/2007/04/erlang-and-haskell-books-first.html 115. http://jan.varwig.org/archiv/update-on-f-and-haskell-especially-monads 116. http://sneezy.cs.nott.ac.uk/fplunch/weblog/?p=75 117. http://jcreigh.blogspot.com/2006/11/simple-rpn-calculator-in-haskell.html 118. http://meta-meta.blogspot.com/2007/10/simple-infix-calculator-in-haskell.ht… 119. http://jcreigh.blogspot.com/2006/12/simple-regex-engine-in-haskell.html 120. http://blog.plover.com/2007/10/12/#catalan-squared * [121]Haskell changing your thinking * [122]How I started off with Haskell and wound up with Lisp * [123]Phantom type problems * [124]My first trip to the phantom zone * [125]Writing Your Last For-Loop * [126]The Curry-Howard Correspondence in Haskell * [127]Tuppence Tour of Haskell Concurrency Constructs * [128]Is Haskell really expressive? * [129]A Quickstart to Haskell * [130]Respect C Programmers 121. http://ephemient.livejournal.com/43696.html 122. http://blog.vagmim.com/2007/10/how-i-started-off-with-haskell-and.html 123. http://therning.org/magnus/archives/322 124. http://therning.org/magnus/archives/323 125. http://beautifulcode.oreillynet.com/2007/10/writing_your_last_forloop.php 126. http://www.thenewsh.com/~newsham/formal/curryhoward/ 127. http://mult.ifario.us/articles/2007/10/21/tuppence-tour-of-haskell-concurre… 128. http://monadicheadaches.blogspot.com/2007/10/is-haskell-reallt-expressive.h… 129. http://www.builderau.com.au/program/soa/A-Quickstart-to-Haskell/0,339024614… 130. http://kontsevoy.blogspot.com/2007/10/respect-c-programmers.html * [131]Building Functions from Functions, part 2: Function Composition * [132]On the Importance of Purity * [133]Functional programming - Back to the Roots * [134]Simpler, Easier! Or, how to write a simple dependent type checker * [135]Is Visual Basic 9 'Haskell for the Masses?' 131. http://diditwith.net/2007/10/23/BuildingFunctionsFromFunctionsPart2Function… 132. http://higherlogics.blogspot.com/2007/10/on-importance-of-purity.html 133. http://blog.codingnaked.com/?p=3 134. http://augustss.blogspot.com/2007/10/simpler-easier-in-recent-paper-simply.… 135. http://blogs.teamb.com/craigstuntz/2007/10/25/37762 Quotes of the Week * As someone who has written production code in functional languages (Ive written Haskell for the U.S. Navy) and in other languages (Perl and Ruby for several startups), I have to say that Haskell enabled me to be way more productive than the untyped scripting languages. Ruby is fun, but Haskell lets me get the work done faster and better. * Perhaps if C wants to be taken seriously it should provide portability, which has been present in Haskell since the beginning * However, since starting learning Haskell I?ve had aha-moments that manifest themselves in a single line of code. This has never happened before. Ever! * Cale: Inheritance? Inheritance is broken, anyway * DRMacIver: I dread to think what category theory would look like after the software engineering world had got their grubby paws on it. Enterprise variant functors. Commutative UML diagrams. * DukeDave: Haskell has the greatest unlearning curve * Jon Harrop: As Haskell has shown, laziness cannot be implemented efficient at all. * Logan Capaldo: All I want for christmas is monad comprehensions * Olathe: We can't be totally sure, though. There might be some value of 1 that wasn't checked. * Pseudonym: Smart programmers naturally write monadic code, even if they don't realise it. * augustss: Haskell already has enterprise monads; there is a fail method. * bitwize: The combinator known as compose; Makes me extremely morose; The full stop is better, than writing in letters; Which makes it extremely verbose * glguy: map became not overloaded in the great polymorphic scare of haskell 98 * mauke: haskell software should move from alpha to beta to eta, then lambda * pl0nk: I wonder what SPJ sees when he closes his eyes before answering a question. About the Haskell Weekly News New editions are posted to [136]the Haskell mailing list as well as to [137]the Haskell Sequence and [138]Planet Haskell. [139]RSS is also available, and headlines appear on [140]haskell.org. Headlines are available as [141]PDF. To help create new editions of this newsletter, please see the [142]contributing information. Send stories to dons at galois.com. The darcs repository is available at darcs get [143]http://www.cse.unsw.edu.au/~dons/code/hwn 136. http://www.haskell.org/mailman/listinfo/haskell 137. http://sequence.complete.org/ 138. http://planet.haskell.org/ 139. http://sequence.complete.org/node/feed 140. http://haskell.org/ 141. http://www.cse.unsw.edu.au/~dons/code/hwn/archives/20071025.pdf 142. http://haskell.org/haskellwiki/HWN 143. http://www.cse.unsw.edu.au/~dons/code/hwn

1 0

Re: Trying to install binary-0.4
by Udo Stenzel 25 Oct '07

25 Oct '07

Don Stewart wrote: > Since you're not using ghc 6.8, you should use binary 0.3 :) That was PC for "sorry, GHC 6.6 is no longer supported and don't even ask about 6.4" The other day I tried to install the tar library on a GHC 6.4. It's nearly impossible. The old base library gets in the way of installing bytestring, binary 0.4 absolutely needs bytestring 0.9 and tar absolutely needs binary 0.4, but still won't compile because System.Posix is now called System.PosixCompat which actually makes it incompatible. Oh, and everything needs a new cabal, but the setup scripts still picks up the wrong one (apparently, since Distribution.Simple is supposed to be there but GHC doesn't find it). Wanna know the solution? - install exactly one version of cabal, 1.1.6.2, and *remove* all others, - ask ghc-pkg for the description of base, then edit Data.ByteString out of that and re-register it, - install bytestring 0.9, - install binary 0.4, - edit the Setup.lhs of tar (it still won't run, even though it should), - edit the source of tar, changing System.PosixCompat to System.Posix, - install it. Should I mention that this is made even more difficult by not being root on the machine in question? All this happened with libraries that look as if they are supposed to be stable, but absolutely nothing works right out of the box. Oh, and Cabal Configurations will make it worse, not better. Here's what should be done, imho: - Rename 'base' ASAP and especially before GHC 6.8 comes out, call it 'foundation' or something else. If you want to keep the name 'base', make sure Cabal considers 'base-2.x' a different library than 'base-3.x'. - Provide a replacement configuration for GHC 6.6 and 6.4 (yes, that one is still alive!) that removes the conflict between 'base' and 'bytestring' and pretends to provide bytestring, containers, array, etc. - Provide a known good cabal. Make sure it installs on GHC 6.6 and 6.4. - Start fixing dependencies. - Refrain from renaming stuff. System.Posix is a fine name. - Refrain from always using the latest interface of everything. While we're at it, the ability to have multiple versions of a library installed under the same name is a recipe for desaster, too. It should be dropped, instead implementing Eternal Compatibility in Theory by encoding version numbers in module names. Sorry for the rant, but the situation was actually better before Cabal tried to fix everything and in the process broke both versions of GHC that are in widespread use right now. -Udo

12 22

ANNOUNCE: hslogger4j 0.1.1
by Bjorn Buckwalter 19 Oct '07

19 Oct '07

All, I'm pleased to share my unpolished hslogger4j library, available now from the project homepage[1] or HackageDB. "Hslogger4j provides handlers for hslogger (John Goerzen's Haskell logging framework) that are compatible with log4j's XMLLayout. In particular log messages created by the handlers can be published directly to the GUI-based log viewer Chainsaw v2." The motivation behind the library is to leverage tools developed for the widely used Apache logging framework log4j. In my case I've been monitoring my hslogger[2] logs in real time using the GUI-based Log viewer Chainsaw v2[3]. The library also includes some optional supporting Java files (most importantly a jar) necessary to use Chainsaw with the richer hslogger levels. The README should clarify usage. Thank you, Bjorn Buckwalter [1] http://hslogger4j.googlecode.com [2] http://software.complete.org/hslogger [3] http://logging.apache.org/chainsaw

2 1

ICFP 2008 Call for Workshop Proposals
by Simon Marlow 19 Oct '07

19 Oct '07

[ posting on behalf of Michael Sperber <sperber(a)deinprogramm.de> ] CALL FOR WORKSHOP PROPOSALS ICFP 2008 13th ACM SIGPLAN International Conference on Functional Programming September 22-24, 2008 Victoria, British Columbia, Canada http://www.icfpconference.org/icfp2008/index.html The 13th ACM SIGPLAN International Conference on Functional Programming (ICFP 2008) will be held in Victoria, Canada from 22nd to 24th September 2008. ICFP provides a forum for researchers and developers to hear about the latest work on the design, implementations, principles, and uses of functional programming. Proposals are invited for workshops to be affiliated with ICFP 2008 and sponsored by SIGPLAN. These workshops should be more informal and focused than ICFP itself, include sessions that enable interaction among the workshop attendees, and be fairly low cost. The preference is for one-day workshops, but other schedules can also be considered. The workshops themselves will be held between September 18th and September 27th, as hotel capacity allows. ---------------------------------------------------------------------- Submission details Deadline for submission: 21th November 2007 Notification of acceptance: 19th December 2007 Prospective workshop organisers are invited to submit a completed workshop proposal form in plain text format to the ICFP 2008 workshop co-chairs (Mike Sperber and Graham Hutton), via email to icfp08-workshops at deinprogramm.de by 21th November 2007. Please note that this is a firm deadline. Organisers will be notified if their proposal is accepted by 19th December 2007, and if successful are required to produce a final report after the workshop has taken place that is suitable for publication in SIGPLAN Notices. The proposal form is available here: http://www.icfpconference.org/icfp2008/workshops/icfp08-workshops-form.txt Further information about SIGPLAN sponsorship is available at here: http://acm.org/sigplan/sigplan_workshop_proposal.htm ---------------------------------------------------------------------- Selection committee The workshop proposals will be evaluated by a committee comprising the following members of the ICFP 2008 organising committee, together with the members of the SIGPLAN executive committee. Mike Sperber DeinProgramm Workshops co-chair Graham Hutton University of Nottingham Workshops co-chair Jim Hook Portland State University General chair Peter Thiemann University of Freiburg Program chair ---------------------------------------------------------------------- Further information Any queries regarding ICFP 2008 workshop proposals should be addressed to the workshops co-chairs (Mike Sperber and Graham Hutton), via email to icfp08-workshops at deinprogramm.de. ----------------------------------------------------------------------

1 0

ANNOUNCE: Lazy SmallCheck 0.1
by Matthew Naylor 18 Oct '07

18 Oct '07

Announcing Lazy SmallCheck 0.1, a library for exhaustive, demand-driven testing of Haskell programs. Lazy SmallCheck is based on the idea that if a property holds for a partially-defined input then it must also hold for all fully-defined instantiations of that input. Compared to `eager' input generation in SmallCheck, Lazy SmallCheck may require significantly fewer test-cases to verify a property for all inputs up to a given depth. There is a webpage for Lazy SmallCheck: http://www-users.cs.york.ac.uk/~mfn/lazysmallcheck/ There you'll find a more detailed description, a worked example, a comparison with SmallCheck on a number of benchmarks, and link to download the library. The library was developed together with Fredrik Lindblad during his recent visits to York. Suggestions, experiences and bug reports are welcome! Matthew.

1 0

[[spam]]
by guzinu＠omu.edu.tr 18 Oct '07

18 Oct '07

.

1 0

[Fwd: undecidable & overlapping instances: a bug?]
by Jorge Marques Pelizzoni 18 Oct '07

18 Oct '07

Hi, all! It's been a while since I sent the message below to the GHC list, which I believe is its rightful forum, but I've had no reply so far. So I am giving the haskell list a try. Thanks in advance. Cheers, Jorge. --------------------------- Mensagem Original ---------------------------- Assunto: undecidable & overlapping instances: a bug? De: "Jorge Marques Pelizzoni" <jpeliz(a)icmc.usp.br> Data: Sab, Outubro 13, 2007 5:59 am Para: "GHC users" <glasgow-haskell-users(a)haskell.org> -------------------------------------------------------------------------- Hi, all! I am quite intrigued at the behaviour examplified in the attached module. It's true I am a newbie and probably don't quite get the whole consequence spectrum of -fallow-undecidable-instances, but why providing that dummy instance (commented out) get the thing to compile? By the way, I'm using GHC 6.6 on WinXP (actually, latest Visual Haskell with MS Visual Studio 2005) and the error message I get is: FooModule.hs:13:9: Could not deduce (Show a) from the context (Concrete a b) arising from use of `bar' at FooModule.hs:13:9-13 Possible fix: add (Show a) to the class or instance method `foo' In the expression: bar x In the definition of `foo': foo x = bar x In the definition for method `foo' A second question: which kinds of overlapping are covered by -fallow-overlapping-instances? It seems that the following (also in the attached module) is not allowed: instance (Show a, Abstract a b) => Concrete a b where foo x = show x instance (Abstract a b) => Concrete a b which gives me the message: FooModule.hs:17:0: Duplicate instance declarations: instance [overlap ok] (Show a, Abstract a b) => Concrete a b -- Defined at FooModule.hs:17:0 instance [overlap ok] (Abstract a b) => Concrete a b -- Defined at FooModule.hs:30:0 Thanks in advance for any pointers. Cheers, Jorge.

4 4