[Haskell-cafe] Haskell Weekly News: January 31, 2007
Donald Bruce Stewart
dons at cse.unsw.edu.au
Wed Jan 31 04:42:29 EST 2007
Haskell Weekly News
Issue 57 - January 31, 2007
Welcome to issue 57 of HWN, a weekly newsletter covering developments
in the Haskell community.
Lots of news to report after a break due to Hac '07 and POPL.
lhs2tex 1.12. Andres Loeh announced lhs2TeX version 1.12, a
preprocessor to generate LaTeX code from literate Haskell sources.
lhs2TeX includes the following features: highly customized output;
liberal parser; generate multiple versions of a program or document
from a single source; active documents: call Haskell to generate parts
of the document (useful for papers on Haskell); a manual explaining
all the important aspects of lhs2TeX.
hscom. Krasimir Angelov announced the hscom library. This is a
FFI library for Microsoft COM. It is far from complete and it doesn't
have automatic IDL to Haskell translator but if you have ever thought
to start writing you own COM library for Haskell then please take a
look. It is designed to be as close as possible to the standard FFI
library for C.
DeepArrow 0.0: Arrows for 'deep application'. Conal Elliott
announced the birth of DeepArrow, a Haskell library for
composable 'editors' of pure values. DeepArrow enables 'deep function
application' in two senses: deep application of functions and
application of deep functions. These tools generalize beyond values
and functions, via the DeepArrow subclass of the Arrow type class.
Phooey 0.1: functional user interface library. Conal Elliott
announced version 0.1 of Phooey, an arrow-based functional user
interface library. New in version 0.1: documentation, text input,
boolean input/output, mtl. Phooey is now used in TV.
TV 0.0: Tangible Values. Conal Elliott announced TV, a library for
composing tangible values (TVs): values that carry along external
interfaces. In particular, TVs can be composed to create new TVs, and
they can be directly executed with a friendly GUI, a process that
reads and writes character streams, or many other kinds interfaces.
Values and interfaces are combined for direct use, and separable for
composability. See the project page.
polyparse 1.00. Malcolm Wallace announced the release of
PolyParse, a collection of parser combinator libraries in Haskell.
They were all previously distributed as part of HaXml, but are now
split out to make them more widely available.
Data.Binary: binary serialisation. The Binary Strike Force
announced the release of Binary, a high performance, pure
binary serialisation library for Haskell. It is available from
Hackage and darcs. The 'binary' package provides efficient
serialisation of Haskell values to and from lazy ByteStrings.
ByteStrings constructed this way may then be written to disk, written
to the network, or further processed (e.g. stored in memory directly,
or compressed in memory with zlib or bzlib).
DrIFT 2.2.1: support for Data.Binary. John Meacham announced that
DrIFT 2.2.1 is out and now has support for the Data.Binary module.
A History of Haskell. Simon Peyton-Jones mentioned that the paper
'A History of Haskell: being lazy with class', authored by Paul Hudak,
John Hughes, Phil Wadler and Simon, is finally done. You can get a
piggybackGHC 0.1. Martin Grabmueller announced the release 0.1 of
piggybackGHC, a small utility package for using GHC for lexing and
parsing Haskell source code. The library uses the GHC library for all
the hard stuff, so all supported GHC extensions are available.
regex-tdfa 0.20. Chris Kuklewicz announced regex-tdfa, a 'tagged'
DFA regular expression backend in pure Haskell, along with a suite of
updates to the existing regex packages.
hpaste.org. Eric Mertens announced 'hpaste', the Haskell
Pastebin. Developed over a few days by many of the members of the
Haskell irc channel, it provies a reliable paste bot with
This section covers the Haskell' standardisation process.
* Views in Haskell
* Pattern guards
* Help from the community
* Polymorphic Components
This week's proposals and extensions to the standard libraries.
* Splitting up the crypto package
* System.Timeout module for base
* Unsafe aspects of ByteString
* Add Data.String containing IsString(fromString) to base
* Make StateT in mtl lazy
Beautiful concurrency. Simon Peyton-Jones announced that the
revised draft of 'Beautiful concurrency' is now online, and
feedback is welcome.
Even higher-order abstract syntax: typeclasses vs GADT. Oleg Kiselyov
demonstrated a typeclass implementation of the canonical use case
for GADTs: a higher-order abstract-syntax-based embedding of a
language in Haskell, with implement static and dynamic semantics of
the language. The interpreter of the language is tagless and
statically assured: only well-typed terms may be evaluated, and the
evaluation of those does not get stuck.
JHC call for volunteers. John Meacham mentioned that Jhc has
recently gotten a ghc back end, making it much closer to mainstream
use as an optimizing 'front end' to ghc. In addition to some of jhc's
crazy optimizations, it implements several extensions to the language
which will likely prove interesting to play with to some. John would
like to welcome any volunteers who would like to help develop the ghc
back end while I work on improving the grin back end and optimizations
in general, to make JHC a viable alternative compiler for Haskell.
State monad strictness. Yitzchak Gale pondered strictness in State
Using PAPI to measure performance with CPU events. Alexey Yakushev
described how to use the new PAPI library together with GHC to
gather performance information from your CPU (cache misses, branch
misprediction). At present only cache miss information is supported in
a platform independent way (though not tested). Also, this
implementation separates the performance information for the garbage
collector and the mutator so it is quite useful if you are
implementing an optimisation.
Simple proof-carrying code in Haskell 98. Oleg Kiselyov
demonstrated a datatype `Terminates' that can hold only an
assuredly terminating (strongly normalizable) term in untyped
lambda-calculus. Furthermore, the values of the datatype `Terminates'
contain all and only those untyped lambda-calculus terms with that
property. To create the value `Terminates', the user submits the term
in question and the proof of its termination. The proof will be
verified -- and if it holds, the Terminates certificate will be
Article review: Category Theory. David House mentioned that he's
written a chapter for the Wikibook that attempts to teach some basic
Category Theory in a Haskell hacker-friendly fashion.
IO is not a monad. Yitzchak Gale sparked a long thread on issues
of parametricity and polymorphic seq in the IO monad
Monad laws for fail. Ulf Norrel wondered about what properties
'fail' should satisify
Postdoctoral Research Fellow at St Andrews. Kevin Hammond
announced a vacancy for a postdoctoral research fellow, working
with the Hume language developed jointly with Heriot-Watt
University. Knowledge of Haskell and other functional programming
technologies is a distinct advantage.
Haskell news from the blogosphere.
* Haskell: Too Hard, or Just Hard Enough?
* One Month with Haskell
* Haskell Revisited
* Haskell, first impressions (with sexy results)
* Haskell: bootstrapping into a clue about monads
* How To Use Monad Transformers
* Error handling in Haskell
* Learning Haskell inch by inch
* Haskell: the Basics of Type Classes
* Clockwork languages
* Fun with Haskell
* Programming Productivity and Programming Languages
* Second order folds
* Happy Haskell hacking
* Simple STM TCP server
* Languages and paradigms and cores, oh my!
* Bug Reporting
* High performance Haskell
* Literate Haskell
* The end of free lunch CPU performance and other papers
* The monad behind every zipper
* The functional C programmer
* Strictly for Lazy Programmers
* Haskell introduction for beginners
* Haskell Basics
* Haskell laziness
* A First Step Into Monads
* More Monads: Stateful Programming
* Why the IO monad?
* Haskell epiphanette
* More About Language Productivty: Corbato's Law
* Laziness and fizzbuzz in Haskell
* C# looks scary
* Random thoughts
Quotes of the Week
* ndm: [dons] How do we serialise an Int portably? [ndm] Just use
the first 29 bits
* C.M.Brown: I told them they could all finish the class in 5
minutes if they used Haskell... The look of horror on the
student's faces when I mentioned the 'H' word was priceless.
However, they were all prepared to spend 50 minutes writing a Java
program which would have the same effect.
* dons: dons law: if you have a bug, you are missing a QC property
* BjarneStroustrup: Within C++, there is a much smaller and cleaner
language struggling to get out.
* ClaudiusMaximus: Compiling with -O2 reduced the time taken by my
program's execution from 28 mins to 17 seconds.
* dons: Think of a monad as a spacesuite full of nuclear waste in
the ocean next to a container of apples. now, you can't put
oranges in the space suite or the nucelar waste falls in the
ocean, *but* the apples are carried around anyway, and you just
take what you need.
* Runar Jordahl: Haskell has quite the following among the alpha
* bakert: I know all my programs can be reduced to only one tenth
the size if only I can learn all these crazy functions
* glguy: [on hpaste.org] you can have your code syntax colored
however you like, as long as that color is 'haskell'
* huschi: Programing in haskell seems a bit frustrating. i'm missing
searching for errors :(
* dons: I had a dream about how to write instance Binary Integer
* bd: If a graph is reduced in a forest, and no one is around to
pattern match the resulting WHNF, does it cause a space leak?
* bos: [dons] and stricify, specialise and inline as appropriate
till the raw bytestring Addr# start appearing [bos] um, is that
next to the dilithium crystals?
* kolmodin: It's nice to have static types after a bottle of wine
* nmessenger: Brain explosion is like a traditional pasttime in
Thu Jan 11 05:13:59 PST 2007. Pepe Iborra.
Added the new :breakpoint continue option. Previously, when in a breakpoint, :quit
was used to continue execution. This is not the right thing to do, so
this patch restores :quit to its original meaning whether or not ghci
is in an inferior session. The continue behavior is now provided by
':breakpoint continue'. I added a synonim command in :continue because
it is much shorter, but this is optional
About the Haskell Weekly News
Each week, new editions are posted to the Haskell mailing list as
well as to the Haskell Sequence and Planet Haskell. RSS is
also available, and headlines appear on haskell.org. Headlines are
available as PDF.
To help create new editions of this newsletter, please see the
contributing information. Send stories to dons at cse.unsw.edu.au.
The darcs repository is available at darcs get
More information about the Haskell-Cafe