- Haskell - Haskell.org

Articles on the value of strong typing
by Jacob Atzen 03 Apr '07

03 Apr '07

Hello list, I am a student at the IT University of Copenhagen doing my final thesis on Domain Specific Languages implemented as embedded languages in Ruby. As you might know Ruby uses a somewhat lax form of typing compared to Haskell which is apparently highly utilized for creating embedded DSL's, at least in the academic world. Additionally many of the articles on embedded languages in Haskell use the typing features of Haskell as an argument for using Haskell in this setting. This lead me to the question: Are there any scientific empirical studies of the values of static / stronger type systems as found in Haskell, C# or Java in real world settings? Or any studies comparing weaker type systems in terms of programmer efficiency, defect ratio, etc. I have been unable to find any such studies as it supposedly is "common knowledge" that strong type systems are of great value. Additionally the people I have asked the question was not aware of any such studies, so now I'm trying this list. Please note that I am looking for papers or articles, preferably from the academic community, and not personal opinions (as valid as they may be). -- Thank you, - Jacob Atzen

6 6

2nd IEEE International Workshop on Software Stability at Work (SSW 2007)
by E.Segura 03 Apr '07

03 Apr '07

The 2nd IEEE International Workshop on Software Stability at Work SSW 2007 Invitation Las Vegas, USA, August 13-15, 2007 (in conjunction with IEEE IRI 2007) http://www.sis.pitt.edu/~iri07/ (IEEE IRI 2007 Link) http://www.sis.pitt.edu/~iri07/wkshpCFP3.html (Main Link) http://www.engr.sjsu.edu/~fayad/workshops/IRI07-SSW (Workshop Link 2) http://www.vrlsoft.com/workshops/SSW07 (Workshop Link 3) Greetings, I would like to invite you to participate in The 2nd IEEE International Workshop on Software Stability at Work. (SSW 2007)" In conjunction with The 2007 IEEE International Conference on Information Reuse and Integration (http://www.sis.pitt.edu/~iri07/) which will take place in Las Vegas, Nevada, August 13-15, 2OO7 by submitting a paper or two before or on April 15, 2007. A call of papers for the workshop is enclosed and it can be found at: http://www.sis.pitt.edu/~iri07/wkshpCFP3.html (Main Link) http://www.engr.sjsu.edu/~fayad/workshops/IRI07-SSW (Workshop Link 2) http://www.vrlsoft.com/workshops/SSW07 (Workshop Link 3) Accepted papers will be published in the proceedings (EI Index) of the The 2007 IEEE International Conference on Information Reuse and Integration (IEEE IRI 2007). The workshop selected best papers will be published in online Journal of International Journal Of Patterns (IJOP). Looking forward to your submission and participation in the workshop! All the best, Cheers, Dr. M.E. Fayad (Chair) Dr. Rami Bahsoon (Co-Chair) Dr. Chia-Chu Chiang (Co-Chair) Dr. Shasha Wu (Co-Chair) -- ijop.org -- Powered by PHPlist, www.phplist.com --

1 0

CFP - 2nd IEEE International Workshop Towards Stable and Adaptable Software Architectures (SASA 2007)
by E. Segura 03 Apr '07

03 Apr '07

The 2nd IEEE International Workshop Towards Stable and Adaptable Software Architectures SASA 2007 Invitation Las Vegas, USA, August 13-15, 2007 (in conjunction with IEEE IRI 2007) http://www.sis.pitt.edu/~iri07/ (IEEE IRI 2007 Link) http://www.sis.pitt.edu/~iri07/wkshpCFP2.html (Workshop Link 1) http://www.engr.sjsu.edu/~fayad/workshops/SASA07 (Workshop Link 2) http://www.vrlsoft.com/workshops/SASA07 (Workshop Link 3) Greetings, I would like to invite you to participate in The 2nd IEEE International Workshop Towards Stable and Adaptable Software Architectures (SASA 2007)" In conjunction with The 2007 IEEE International Conference on Information Reuse and Integration (http://www.sis.pitt.edu/~iri07/) which will take place in Las Vegas, Nevada, August 13-15, 2OO7 by submitting a paper or two before or on April 15, 2007. A call of papers for the workshop is enclosed and it can be found at: http://www.sis.pitt.edu/~iri07/wkshpCFP2.html (Workshop Link 1) http://www.engr.sjsu.edu/~fayad/workshops/SASA07 (Workshop Link 2) http://www.vrlsoft.com/workshops/SASA07 (Workshop Link 3) Accepted papers will be published in the proceedings (EI Index) of the The 2007 IEEE International Conference on Information Reuse and Integration (IEEE IRI 2007). The workshop selected best papers will be published in online Journal of International Journal Of Patterns (IJOP). Looking forward to your submission and participation in the workshop! All the best, Cheers, Dr. M.E. Fayad (Chair) Dr. Rami Bahsoon (Co-Chair) Dr. Tarek Helmy (Co-Chair) Eduardo M. Segura (Co-Chair) -- ijop.org -- Powered by PHPlist, www.phplist.com --

1 0

Matlab/BLAS/LAPack and Re: [Haskell-cafe] Mathematics in Haskell Re: Why the Prelude must Die
by Alexander McPhail 02 Apr '07

02 Apr '07

Since I brought this up (search haskell' list) I should probably volunteer to help. If people agree I can coordinate an effort to build a mathematically sound hierarchy. Unfortunately my mathematical knowledge is less than ideal for this purpose (I am actively remedying this at university). However, if there is an administrative burden I volunteer to shoulder it. On a related note I have written a binding to Matlab data files and arrays if anyone is interested, and I am embarking on a project to bind to CBLAS and CLAPack. Vivian > > Jacques Carette wrote: > > > >> perhaps i was mistaken in thinking that there is a group of > >> math-interested haskellers out there discussing, developing, and > >> documenting the area? or perhaps that group needs introductory > >> tutorials presenting its work? > > My guess is that there are a number of people "waiting in > the wings", > > waiting for a critical mass of features to show up before really > > diving in. See http://www.cas.mcmaster.ca/plmms07/ > > for my reasons for being both interested and wary). > > > > Probably the simplest test case is the difficulties that people are > > (still) encountering doing matrix/vector algebra in Haskell. One > > either quickly encounters efficiency issues (although PArr might > > help), or typing issues (though many tricks are known, but not > > necessarily simple). Blitz++ and the STL contributed > heavily to C++ > > being taken seriously by people in the scientific computation > > community. Haskell has even more _potential_, but it is > definitely unrealised potential. > > > > I am one of those mathematicians "waiting in the wings." > Haskell looked > very appealing at first, and the type system seems perfect, > especially for > things like multilinear algebra where currying and duality is > fundamental. > I too was put off by the Num issues though--strange mixture > of sophisticated > category theory and lack of a sensible hierarchy of algebraic objects. > > However, I've decided I'm more interested in helping to fix > it than wait; > so count me in on an effort to make Haskell more > mathematical. For me that > probably starts with the semigroup/group/ring setup, and good > arbitrary-precision as well as approximate linear algebra support. > > -- > > I've been watching this thread for quite a while now, and it seems to > me that there is quite a bit of interest in at least working on a new > Prelude. I've also noticed a 'The Other Prelude' page on the wiki > [http://haskell.org/haskellwiki/The_Other_Prelude] and they seem to > have a start on this. So it seems that we should actually start this, > because people will contribute. Can somebody with good Cabal skills > and maybe access to darcs.haskell.org start a new library for people > to start patching? > > Bryan Burgers > > > > On Apr 2, 2007, at 3:24 PM, Andrzej Jaworski wrote: > > >> I too was put off by the Num issues though--strange mixture of > >> sophisticated > >> category theory and lack of a sensible hierarchy of algebraic > >> objects. > > > > Perhaps we should replace CT with lattice theoretic thinking (e.g. > > functor = monotonic > > function) before cleaning up the type-related mess? > > See: http://citeseer.ist.psu.edu/269479.html > > > >> so count me in on an effort to make Haskell more mathematical. > >> For me that > >> probably starts with the semigroup/group/ring setup, and good > >> arbitrary-precision as well as approximate linear algebra support. > > > > I agree: semigoups like lattices are everywhere. > > Then there could be a uniform treatment of linear algebra, > > polynomial equations, operator > > algebra, etc. So, perhaps haste is not a good advice here? > > > > -Andrzej > >

1 0

ANNOUNCE: new FGL version (April 2007)
by Martin Erwig 02 Apr '07

02 Apr '07

FGL - A Functional Graph Library, Version: April 2007 ===================================================== A new release of the Functional Graph Library for Haskell is available at: http://eecs.oregonstate.edu/~erwig/fgl/haskell/ This release fixes some bugs in the implementation of several basic inspection functions. -- Martin

2 1

haskell communities worthy of academic study?
by Claus Reinke 31 Mar '07

31 Mar '07

Asked how she had come to choose GHC as the topic for her award-nominated PhD dissertation, freshly graduated doctor of software archeology Simone Tolduso revealed: "At first, there were a few small curiosities that triggered my interest, like why were darcs patches sent to the cvs-ghc mailinglist, or why did GHC releases traditionally bundle the predecessor of the current Cabal version when the missing libraries depended on its successor? But then I looked into the repository, with its layers on layers of build systems, source formats, deprecation warnings, directory structure fragments, todo logs, broken builds resulting either from OS-tools advancing and playing havoc with the built-in assumptions of fragile build configurations or from multiple, partially completed, mutually incompatible heart-liver-and-lung transplants supporting the newest language extensions (which of course were all needed to build the compiler branch supporting said features, and whose documentation tended to be spread over user manual, API comments, mailing list threads, research papers, plus half a dozen different Wikis and ticket trackers), supported by often outdated documentation in a never-ending variety of formats, and I knew I had stumbled onto a goldmine. Not to mention remains of earlier projects (what were fptools, or libraries?), a variety of test and compilation languages (including Haskell, C, Perl, Python, alongside the usual scripting suspects), or the proliferation of sediment layers into user space by the simple, but ingeneous, means of binary incompatibility. In spite of its comparatively small size, the project was beginning to rival the complexities of other Microsoft products of the same period. In what seems to have been an attempt to push open source ideas to their logical conclusion, you actually had to guess at the right combination of versions for a number of independently evolving toolchains, libraries, OSes, and use those to bootstrap from a consistent snapshot of the compiler, library, and sometimes even tool sources, or nothing works - a situation which was later increasingly exacerbated by the dispersion of the Haskell Cabal replacing coordinated releases. Preliminary mining of the relevant mailinglist and bug tracker archives suggests that binary releases were mainly public data points used to indicate intermediate states of GHC _not_ suitable for specific applications (apart from the obligatory Cabal pre-version lacking the new features needed for installing the extra libraries, other examples include versions of Data.ByteString _not_ based on the famous paper, _not_ supporting essential optimisations, or _not_ supporting API safety fixes). So there seemed to be no way to avoid direct access to the source repositories with their associated build processes and toolchains. And let us not forget that, unlike the programmers at the time, we are in the fortunate situation of already having complete repositories for the pieces and dependencies involved. Finding matching versions is a non-trivial, but essentially combinatorial exercise, while for them, the process of building GHC would often have involved developing and submitting the patches that make up our repositories of all the pieces of software GHC builds depended on. We still haven't found the key that enabled the ancients to navigate this labyrinth and to keep their toolchains up to date while still making any progress in their daily work, not to mention recording such progress via darcs (in itself written in Haskell, and not free of troubles). Agent-based simulations of developer communities at arbitrary slices through the repositories show the majority of agents getting stuck in a recursive cycle of installing, debugging, and updating dependency chains without ever reaching a productive state, so we do know that we are missing some crucial information. Several of my correspondents have come to favour the somewhat controversial theory that the general programmer in those days must have been substantially more intelligent than people are today. And it does make sense, in a way - I mean, if anyone had been the slightest bit bothered by all this complexity, surely someone would have tried to simplify things? Of course, my work has not all been happy progress: for instance, while there really was an 'evil mangler', the equally persistent rumour that GHC was named after some scottish town has turned out to be a wild goose chase (cf Appendix GC); my colleagues in dirt archeology assure me there was no town called 'glorious'. The 'real' archeologists, as they call themselves, had a field day laughing about my gullability there. Still, there are so many burried treasures in this area - just waiting to be investigated." Dr Tolduso is currently working on a follow-on project, "Haskell by committee - design and syntax through the ages". Dept. of Software Archeology, University of New Atlantis (for immediate release)

4 3

ANNOUNCE: Phooey 1.0 and GuiTV 0.3
by Conal Elliott 30 Mar '07

30 Mar '07

I'm happy to announce a new version of Phooey<http://haskell.org/haskellwiki/Phooey>, a library for functional user interfaces. Highlights in this release: - Uses new TypeCompose <http://haskell.org/haskellwiki/TypeCompose>package, which includes a simple implementation of data-driven computation. - New Applicative functor interface. - Eliminated the catch-all Phooey.hs module. Now import any one of Graphics.UI.Phooey.{Monad,Applicative,Arrow}. - Phooey.Monad has two different styles of output widgets, made by owidget and owidget'. The latter is used to implement Phooey.Applicative. - Self- and mutually-recursive widgets now work again in Phooey.Monad. They wedge in Phooey.Arrow and Phooey.Applicative. Phooey is also used in GuiTV <http://haskell.org/haskellwiki/GuiTV>, a library for composable interfaces and "tangible values". I've also just updated GuiTV to 0.3, to sync with Phooey 1.0. - Conal

1 0

ANNOUNCE: TypeCompose 0.0
by Conal Elliott 30 Mar '07

30 Mar '07

TypeCompose <http://haskell.org/haskellwiki/TypeCompose> provides some classes & instances for forms of type composition. It also includes a very simple implementation of data-driven computation. I factored it out of a new implementation of Phooey <http://haskell.org/haskellwiki/Phooey>. I am very interested in comments and contributions. - Conal

1 0

announce - new web-devel mailinglist on haskell.org
by Marc Weber 30 Mar '07

30 Mar '07

Hi. There is a new web-devel mailinglist on haskell.org. You can subscribe here: http://www.haskell.org/mailman/listinfo/web-devel Marc

1 0

ANNOUNCE: binary 0.3 - bigger, better, faster
by Lennart Kolmodin 28 Mar '07

28 Mar '07

Greetings friends! I'm pleased to announce binary 0.3! The 'binary' package provides efficient serialization 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). In total 14 people have contributed code and many more given feedback and cheerleading on #haskell@freenode. Thanks to all of you! It's available through Hackage: tarball: http://hackage.haskell.org/packages/archive/binary/binary-0.3.tar.gz darcs: darcs get http://darcs.haskell.org/binary homepage: http://www.cse.unsw.edu.au/~dons/binary.html It's been a while since the last release of binary [1] the 25th of January earlier this year. Lets have a look of what's changed since then: API additions ------------- The first thing you're going to notice that differs is the polished API. Being used by more people now than it was in January, we've added features that where missing before. More functions has been added to the Get/Put monads giving information over bytes read, remaining bytes etc for whenever you need to do custom serialization. You can now also read and write words in host endian order. Instances has been added to handle Double, Float and Ratio. Performance ----------- Decoding speed has been tuned by a rewrite and is currently about half the speed of the lightning fast encoding. Don't hesitate to give feedback on #haskell or by mail, we've always got time for a chat :) The Binary Strike Force, Lennart Kolmodin Duncan Coutts Don Stewart Spencer Janssen David Himmelstrup Björn Bringert Ross Paterson Einar Karttunen John Meacham Ulf Norell Tomasz Zielonka Stefan Karrmann Bryan O'Sullivan Florian Weimer [1] http://article.gmane.org/gmane.comp.lang.haskell.general/14800 -- "The only thing that interferes with my learning is my education." -- Albert Einstein

1 0