November 2008 - Haskell

First CFP: WWV 2009
by demis＠dimi.uniud.it 26 Nov '08

26 Nov '08

[Apologies if you receive multiple copies] *********************************************************** * CALL FOR PAPERS * * * * WWV 2009 * * Automated Specification and Verification of Web Systems * * 5th International Workshop * * * * Castle of Hagenberg, Austria. July 17, 2009 * * http://www.risc.uni-linz.ac.at/conferences/wwv09/ * * * * Part of the RISC Summer 2009 * * http://www.risc.uni-linz.ac.at/conferences/summer2009/ * *********************************************************** IMPORTANT DATES Abstract Submission February 2, 2009 Full Paper Submission February 9, 2009 Acceptance Notification April 20, 2009 Camera Ready June 1, 2009 Workshop July 17, 2009 SCOPE The increased complexity of Web sites and the explosive growth of Web-based applications has turned their design and construction into a challenging problem. Nowadays, many companies have diverted their Web sites into interactive, completely-automated, Web-based applications (such as Amazon, on-line banking, or travel agencies) with a high complexity that requires appropriate specification and verification techniques and tools. Systematic, formal approaches to the analysis and verification can address the problems of this particular domain with automated and reliable tools that also incorporate semantic aspects. We solicit original papers on formal methods and techniques applied to Web sites, Web services or Web-based applications, such as: * rule-based approaches to Web site analysis, certification, specification, verification, and optimization * algebraic methods for verification and certification of Web systems * formal models for describing and reasoning about Web sites * model-checking, synthesis and debugging of Web sites * abstract interpretation and program transformation applied to the semantic Web * intelligent tutoring and advisory systems for Web specifications authoring * Web quality and Web metrics * Web usability and accessibility * Testing and evaluation of Web systems and applications The WWV series provides a forum for researchers from the communities of Rule-based programming, Automated Software Engineering, and Web-oriented research to facilitate the cross-fertilization and the advancement of hybrid methods that combine the three areas. The previous WWV editions were: WWV'08 (Siena, Italy), WWV'07 (Venice, Italy), WWV'06 (Paphos, Cyprus), and WWV'05 (Valencia, Spain). LOCATION WWV'09 will be held at the Research Institute for Symbolic Computation (RISC), which is an institute of the Johannes Kepler University in Linz. It is located in the Castle of Hagenberg, a romantic, medieval castle amidst the lovely, hilly landscape of the Mühlviertel region, 20 km north east of Linz, the provincial capital of Upper Austria, located halfway between Salzburg and Vienna. For more information about RISC, please visit: http://www.risc.uni-linz.ac.at/ The workshop is a part of the RISC Summer 2009 conference series: http://www.risc.uni-linz.ac.at/about/conferences/summer2009/ SUBMISSION PROCEDURE Submissions must be received by February 9, 2009. In addition, an ASCII version of the title and abstract must be submitted by February 2, 2009. Submitted papers should be prepared in LaTeX, formatted according to the Springer llncs style, and should not exceed 15 pages. Submission is web-based via this link: http://www.easychair.org/conferences/?conf=wwv09 PUBLICATION Accepted papers will be published in a preliminary proceedings volume, which will be available during the workshop. After the workshop, a special issue of the Journal of Symbolic Computation on the topic of the WWV workshop is planned. PROGRAM CO-CHAIRS Demis Ballis University of Udine, Italy Temur Kutsia Johannes Kepler University Linz, Austria WORKSHOP CO-CHAIRS Temur Kutsia Johannes Kepler University Linz, Austria Wolfgang Schreiner Johannes Kepler University Linz, Austria INVITED SPEAKERS François Bry Ludwig Maximilian University of Munich, Germany Axel Polleres National University of Ireland, Galway, Ireland PROGRAM COMMITTEE Maria Alpuente Technical University of Valencia, Spain Demis Ballis University of Udine, Italy Wlodzimierz Drabent Linköping University, Sweden, and Institute Of Computer Science, Polish Academy of Sciences, Poland Santiago Escobar Technical University of Valencia, Spain Moreno Falaschi University of Siena, Italy Mário Florido University of Porto, Portugal Temur Kutsia Johannes Kepler University Linz, Austria Massimo Marchiori University of Padova, Italy Mircea Marin University of Tsukuba, Japan Catherine Meadows Naval Research Laboratory, USA Rosario Pugliese University of Florence, Italy I.V. Ramakrishnan Stony Brook University, USA Antonio Vallecillo University of Malaga, Spain

1 0

Call for papers TAP 2009
by Koen Claessen 26 Nov '08

26 Nov '08

[Apologize if you receive multiple copies] Call for Papers TAP: Tests And Proofs 2009 The Third International Conference on Tests And Proofs (TAP) will be held at ETH Zurich, Switzerland on 2 and 3 July 2009. It will be co-located with TOOLS Europe 2009. The TAP conference is devoted to the convergence of proofs and tests. It combines ideas from both sides for the advancement of software quality. Purpose and Scope ----------------- To prove the correctness of a program is to demonstrate, through impeccable mathematical techniques, that it has no bugs; to test a program is to run it with the expectation of discovering bugs. The two techniques seem contradictory: if you have proved your program, it's fruitless to comb it for bugs; and if you are testing it, that is surely a sign that you have given up on any hope to prove its correctness. Accordingly, proofs and tests have, since the onset of software engineering research, been pursued by distinct communities using rather different techniques and tools. And yet the development of both approaches leads to the discovery of common issues and to the realization that each may need the other. The emergence of model checking has been one of the first signs that contradiction may yield to complementarity, but in the past few years an increasing number of research efforts have encountered the need for combining proofs and tests, dropping earlier dogmatic views of incompatibility and taking instead the best of what each of these software engineering domains has to offer. The conference will include a mix of invited and submitted presentation, and a generous allocation of panels and informal discussions Topics ------- Possible topics include (as an indicative rather than exhaustive list): - Generation of test data, oracles, or preambles by deductive techniques such as o theorem proving, o model checking, o symbolic execution, o constraint logic programming, etc. - Generation of specifications by deduction - Verification techniques combining proofs and tests - Program proving with the aid of testing techniques - Transfer of concepts from testing to proving (e.g., coverage criteria) - Automatic bug finding - Formal frameworks - Tool descriptions and experience reports - Case studies Invited speakers ---------------- Boutheina CHETALI Security Labs, Technology & Innovation Gemalto - France Sriram K. Rajamani Microsoft Research India Contributions ------------- Two kinds of contributions are expected: - Research papers: full papers of not more than 14 pages in LNCS format, which have to be original, unpublished and not submitted elsewhere. The research papers proceedings will be published in Springer's LNCS series. - Short presentations of work in progress, industrial experience reports and tool demonstrations. An extended abstract of not more than 3 pages is expected and will be reviewed. The accepted extended abstracts will be made available in supplementary proceedings. They will be presented during the cnference days. Important dates ---------------- * Submission deadline: 15 February 2009 * Notification of acceptance: 22 March 2009 * Submission of final camera-ready version: 15 April 2009 The dates are firm; no extension will be granted. Web site --------- http://tap.ethz.ch/2009

1 0

Not quite another Haskell tutorial, but ...
by Janis Voigtlaender 25 Nov '08

25 Nov '08

... I submitted my Habilitation thesis last week. The first few chapters of it try to give an introduction to Haskell with emphasis on types and reasoning principles. That might be an interesting read for some, so I made it accessible at http://wwwtcs.inf.tu-dresden.de/~voigt/habil.pdf. And yes, the November HCAR will also be coming. Rather soon now that this cause for delay is out of the way. Ciao, Janis. -- Dr. Janis Voigtlaender http://wwwtcs.inf.tu-dresden.de/~voigt/ mailto:voigt@tcs.inf.tu-dresden.de

1 0

GHC 6.10 and OpenGL
by Paul L 24 Nov '08

24 Nov '08

Hi everyone, It's sad to see the OpenGL binding being dropped from GHC binary installers starting from 6.10. Though this issue has been brought up and discussed before, I'm sure a lot of people who based their work on OpenGL would share the same sympathy. I'm not here to argue whether this decision by GHC dev team is right or wrong, but what's really causing the pain is that the OpenGL binding doesn't have its own binary installer for Windows, and compilation from source on this platform is non-trivial. I wouldn't recommend doing it for ordinary users. So my question is, are we going to see a binary installer for OpenGL binding provided separately from either HOpenGL site, or Hackage? Or even the GHC installation page? -- Regards, Paul Liu Yale Haskell Group http://www.haskell.org/yale

3 4

PhD Positions in Language-based Security at Chalmers
by Andrei Sabelfeld 24 Nov '08

24 Nov '08

------------------------------------------------------------------------ *PhD Student Positions in Programming Language-based Security* Dept. of Computer Science and Engineering Chalmers University of Technology, Sweden Application deadline: January 30, 2009 Full version of this announcement is at: http://www.chalmers.se/cse/EN/news/vacancies/positions/ph-d-positions-in ------------------------------------------------------------------------ *The Department* The department provides a strong, international, and dynamic research environment with about 75 faculty members. For more information, see http://www.chalmers.se/cse/EN/. ------------------------------------------------------------------------ *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. 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 per cent departmental work, mostly teaching duties. Salary for the position is as specified in Chalmers? general agreement for PhD student positions, currently around 23,000SEK a month before tax. The positions are intended to start in spring or fall 2009. ------------------------------------------------------------------------ *Suitable Background* Applicants must have a 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* Application can be submitted electronically following the "Application details" and "Application procedure" guidelines at: http://www.chalmers.se/cse/EN/news/vacancies/positions/ph-d-positions-in

1 0

FP Jobs
by julien.sylvestre＠mlstate.com 24 Nov '08

24 Nov '08

MLstate - currently in stealth mode - is an IT company, whose functional programming approach to SaaS and cloud computing has been recently recognized by the French Ministry of Research Innovation Award. We are research-oriented, we value technical excellence and innovation and we believe our technology has a potential to dramatically change the way web applications are being built. MLstate opens several new permanent positions to meet this challenge: - Senior Developers: Outstanding PhDs with at least 3 years of research experience in functional languages and/or formal verification and the ability to manage a small technical team. - Developers: PhDs with strong FP skills. Applications from PhD students defending their thesis soon and who should not be reading the caml list right now... are welcome. Jobs are based in Paris and include a competitive compensation package. Please send a (link to your) CV to julien.sylvestre(a)mlstate.com

1 0

Haskell Weekly News: Issue 94 - November 22, 2008
by Brent Yorgey 22 Nov '08

22 Nov '08

--------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20081122 Issue 94 - November 22, 2008 --------------------------------------------------------------------------- Welcome to issue 94 of HWN, a newsletter covering developments in the [1]Haskell community. Lots of interesting reading this week! Martin Escardo writes about [2]finite search over infinite search spaces expressed as a monad; Conal Elliott writes about [3]the unambiguous choice operator and [4]merging partial values; Luke Palmer on [5]restricted data types and [6]Udon, his system for universal distributed object management; a post about [7]incremental parsing in Yi; Ryan Ingram on [8]parametric higher-order abstract syntax; Issue #12 of [9]the Monad.Reader; and much more! Announcements The Monad.Reader - Issue 12: Summer of Code Special. Wouter Swierstra [10]announced Issue 12 of [11]the Monad.Reader, featuring articles by Max Bolingbroke, Roman Cheplyaka, and Neil Mitchell describing their Summer of Code projects. Turbinado V0.1. Alson Kemp [12]announced the release of [13]Turbinado, an MVC web framework for Haskell. EEConfig-1.0. Bartosz Wojcik [14]announced the release of [15]EEConfig, a simple library for reading parameters from a configuration file. Discussion Proof of a multi-threaded application. Silviu Andrica [16]asked about the possibility of proving the correctness of a multi-threaded application written in Haskell, leading to a discussion of STM, model checking, and related issues. Monadic bind with associated types + PHOAS?. Ryan Ingram [17]wrote about using parametric higher-order abstract syntax to get the benefits of HOAS (using the embedding language to express binding and substitution) while still being able to inspect or optimize the resulting expressions. Blog noise [18]Haskell news from the [19]blogosphere. * Ashish Hanwadikar: [20]More on Haskell DSL. * Real-World Haskell: [21]Real World Haskell in the Wild!. * Conal Elliott: [22]Merging partial values. * John Goerzen (CosmicRay): [23]If Programming Languages Were Christmas Carols. * Conal Elliott: [24]Functional concurrency with unambiguous choice. * >>> Martin Escardo: [25]A Haskell monad for infinite search in finite time. * The GHC Team: [26]Redesigning GHC's build system. * Luke Palmer: [27]Restricted Data Types. * Yi: [28]Incremental Parsing in Yi. * Roman Cheplyaka: [29]The Monad Reader, SoC special. * Darcs: [30]camp irregular news #1. * Eric Kow (kowey): [31]iterative committing. * >>> Joey Hess: [32]a year of haskell (not really). * FP Lunch: [33]The origin of species. * Luke Palmer: [34]Udon Sketch #2. * John Goerzen (CosmicRay): [35]Real World Haskell Update. * Real-World Haskell: [36]When will you see us on bookstore shelves?. * Paul Potts: [37]Reading Real World Haskell. * Darcs: [38]darcs 2.1.2 released!. * Darcs: [39]darcs weekly news #12. * Russell O'Connor: [40]Haskell Lesson. * Conal Elliott: [41]Enhancing a Zip. * Conal Elliott: [42]Proofs for left fold zipping. * >>> Andrew Birkett: [43]Why do they call it: Referentially transparent. * >>> Andrew Birkett: [44]Why do they call it: Referentially transparent (II). Quotes of the Week * dons: instance Ord OCaml, oh wait. hang on. OCaml can't do that. * BONUS: as you can see, one of the best parts of Haskell is #haskell. * ddarius: head [] :: FlyingMonkeys About the Haskell Weekly News New editions are posted to [45]the Haskell mailing list as well as to [46]the Haskell Sequence and [47]Planet Haskell. [48]RSS is also available, and headlines appear on [49]haskell.org. To help create new editions of this newsletter, please see the information on [50]how to contribute. Send stories to byorgey at cis dot upenn dot edu. The darcs repository is available at darcs get [51]http://code.haskell.org/~byorgey/code/hwn/ . References 1. http://haskell.org/ 2. http://math.andrej.com/2008/11/21/a-haskell-monad-for-infinite-search-in-fi… 3. http://feeds.feedburner.com/~r/conal/~3/461480571/ 4. http://feeds.feedburner.com/~r/conal/~3/461534658/ 5. http://lukepalmer.wordpress.com/2008/11/20/restricted-data-types/ 6. http://lukepalmer.wordpress.com/2008/11/19/udon-sketch-2/ 7. http://yi-editor.blogspot.com/2008/11/incremental-parsing-in-yi.html 8. http://www.haskell.org//pipermail/haskell-cafe/2008-November/050768.html 9. http://www.haskell.org/haskellwiki/The_Monad.Reader 10. http://www.haskell.org//pipermail/haskell-cafe/2008-November/050786.html 11. http://www.haskell.org/haskellwiki/The_Monad.Reader 12. http://www.haskell.org//pipermail/haskell/2008-November/020811.html 13. http://www.turbinado.org/ 14. http://www.haskell.org//pipermail/haskell/2008-November/020810.html 15. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/EEConfig 16. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/47728 17. http://www.haskell.org//pipermail/haskell-cafe/2008-November/050768.html 18. http://planet.haskell.org/ 19. http://haskell.org/haskellwiki/Blog_articles 20. http://feedproxy.google.com/~r/typepad/ahanwadi/ashishs_niti/~3/n41w6S_82SE… 21. http://www.realworldhaskell.org/blog/2008/11/22/real-world-haskell-in-the-w… 22. http://feeds.feedburner.com/~r/conal/~3/461534658/ 23. http://changelog.complete.org/archives/825-if-programming-languages-were-ch… 24. http://feeds.feedburner.com/~r/conal/~3/461480571/ 25. http://math.andrej.com/2008/11/21/a-haskell-monad-for-infinite-search-in-fi… 26. http://ghcmutterings.wordpress.com/2008/11/21/redesigning-ghcs-build-system/ 27. http://lukepalmer.wordpress.com/2008/11/20/restricted-data-types/ 28. http://yi-editor.blogspot.com/2008/11/incremental-parsing-in-yi.html 29. http://physics-dph.blogspot.com/2008/11/monad-reader-soc-special.html 30. http://blog.darcs.net/2008/11/camp-irregular-news-1.html 31. http://koweycode.blogspot.com/2008/11/iterative-commiting.html 32. http://kitenet.net/~joey/blog/entry/a_year_of_haskell___40__not_really__41_… 33. http://sneezy.cs.nott.ac.uk/fplunch/weblog/?p=132 34. http://lukepalmer.wordpress.com/2008/11/19/udon-sketch-2/ 35. http://changelog.complete.org/archives/814-real-world-haskell-update 36. http://www.realworldhaskell.org/blog/2008/11/18/when-will-you-see-us-on-boo… 37. http://praisecurseandrecurse.blogspot.com/2008/11/reading-real-world-haskel… 38. http://blog.darcs.net/2008/11/darcs-212-released.html 39. http://blog.darcs.net/2008/11/darcs-weekly-news-12.html 40. http://r6.ca/blog/20081116T213644Z.html 41. http://feeds.feedburner.com/~r/conal/~3/454447926/ 42. http://feeds.feedburner.com/~r/conal/~3/454297817/ 43. http://www.nobugs.org/blog/archives/2008/11/12/why-do-they-call-it-referent… 44. http://www.nobugs.org/blog/archives/2008/11/12/why-do-they-call-it-referent… 45. http://www.haskell.org/mailman/listinfo/haskell 46. http://sequence.complete.org/ 47. http://planet.haskell.org/ 48. http://sequence.complete.org/node/feed 49. http://haskell.org/ 50. http://haskell.org/haskellwiki/HWN 51. http://code.haskell.org/~byorgey/code/hwn/

1 0

Does GHC support the standard CPP functionalities?
by haihualin 22 Nov '08

22 Nov '08

Hi, I tried to compile the following program by GHC {-# LANGUAGE CPP #-} module Packer where #define FLASH_APP_START 1 #define FLASH_APP_END 2 #define INSERT_SECTION(x) (#x, (FLASH_##x##_START, FLASH_##x##_END)) import qualified Data.Map as M import Data.Tuple import System.IO as Sys type Name = String type Boundary = (Int, Int) boundaryList = [INSERT_SECTION(APP)] main = Sys.print boundaryList But failed with test.hs:16:17: Not in scope: `#' test.hs:16:17: A section must be enclosed in parentheses thus: (# APP) test.hs:16:18: Not in scope: data constructor `APP' test.hs:16:24: Not in scope: data constructor `FLASH_' test.hs:16:30: Not in scope: `##' test.hs:16:32: Not in scope: data constructor `APP' test.hs:16:35: Not in scope: `##' Seems GHC does support macro like #x a##b. Is that true? If not, how to resolve? Thanks alot. Haihua

1 0

LDTA 2009: abstracts due November 28
by Torbjorn.Ekman＠comlab.ox.ac.uk 21 Nov '08

21 Nov '08

*** abstracts - November 28, full papers - December 5 *** LDTA: Workshop on Language Descriptions Tools and Applications http://www.ldta.info ===Call For Papers 2009=== This is the Call For Papers for the Ninth Workshop on Language Descriptions, Tools and Applications (LDTA 2009) LDTA is a two-day satellite event of ETAPS which takes on the 28th and 29th of March 2009 in York, England. Please submit your abstract and paper using http://www.easychair.org/conferences/?conf=ldta2009 ==Scope== LDTA is an application and tool oriented forum on meta programming in a broad sense. A meta program is a program that takes other programs as input or output. The focus of LDTA is on generated or otherwise efficiently implemented meta programs, possibly using high level descriptions of programming languages. Tools and techniques presented at LDTA are usually applicable in the context of "Language Workbenches" or "Meta Programming Systems" or simply as parts of advanced programming environments or IDEs. The applications areas include, but are not limited to: * Program analysis, transformation, generation and verification * Implementation of Domain Specific Languages (both visual and textual) * Reverse engineering and reengineering * Refactoring and other source-to-source transformations * Application modelling (MDE, MDA, Software Factories, Software product lines) * Grammar engineering / Grammarware * Language definition and language prototyping * Debugging, profiling and testing * IDE construction * Compiler construction LDTA is a well-established workshop next to other conferences and workshops on (programming) language engineering topics such as SLE and GPCE. LDTA is traditionally a forum where computer science theories are put to the test of real-world software engineering issues, for example by applying: * context-free grammars to parser generation for real programming languages, * attribute grammars to static analyzer and compiler generation, * term rewriting to source-to-source transformation, * action semantics to programming language implementation, * model checking to software verification. Note that LDTA solicits submissions from any technological or theoretical domain, as long as the paper is within the application scope. ==Submission Procedure and Publication== Submissions in the following categories are admissible: * research papers, * tool papers, * experience papers The final versions of accepted papers will probably(*) be published in Electronic Notes in Theoretical Computer Science (ENTCS), Elsevier Science, and will be made available during the workshop. (*)Due to organizational changes at Elsevier, publication by ENTCS publication is provisional; another comparable venue will be found otherwise. Each submission must: * clearly and unambiguously state in which of the three categories it falls * be original, i.e. not published or submitted elsewhere, * contain a clear motivation, * contain a thorough analysis of the claimed contributions (for example by comparing to related work), * be written in less than 15 pages (research papers and experience reports), or less than 10 pages (tool papers) * use the ENTCS style. The authors of each submission are required to give a presentation at LDTA 2009. The authors of the tool papers are required to include an interactive demonstration in their presentations. The authors of the best papers will be invited to write a journal version of their paper which will be separately reviewed and, assuming acceptance, be published in journal form. As in past years, this will be done in a special issue devoted to LDTA 2009 of the journal Science of Computer Programming (Elsevier Science). The authors of the best tool papers will be invited to write a paper and submit the source of code of their tool, which will both be separately reviewed and, assuming acceptance, be published in the special issue on Experimental Software and Toolkits (EST) of the journal Science of Computer Programming (Elsevier Science). Please submit your abstract and paper using http://www.easychair.org/conferences/?conf=ldta2009 ==Program Committee== Jurgen Vinju, CWI, Amsterdam (co-chair) Torbjörn Ekman, Oxford, UK (co-chair) Erik Meijer, Microsoft, Redmond, USA Walid Taha, Rice University, Houston USA Bob Fuhrer, IBM TJ Watson, USA Susan Eisenbach, Imperial College, UK Jean-Marie Jacquet, FUNDP, Namur, Belgium Sibylle Schuppe, Chalmers, Sweden Elizabeth Scott, RHUL, UK Robert Grimm, NYU, USA Judith Bishop, Pretoria, South Africa Tudor Girba, Univ of Berne, Switzerland Marjan Mernik, University of Maribor, Slovenia Thomas Dean, Fondazione Bruno Kessler - IRST, Italy Martin Bravenboer, Univ. of Oregon, USA Pierre-Etienne Moreau, INRIA-LORIA, France Gabi Taentzer, Philipps-Universität Marburg, Germany Joao Saraiva, Universidade do Minho, Braga, Portugal Tijs van der Storm, CWI, The Netherlands Stephen Edwards, Columbia University, USA Peter Thiemann, Universität Freiburg, Germany ==Important Dates== Abstract submission deadline:Friday November 28th, 2008 Paper submission deadline:Friday December 5th, 2008 Notification of acceptance:Friday February 6th, 2009 Workshop date:28th and 29th of March, 2009

1 0

Haskell Reddit
by Don Stewart 20 Nov '08

20 Nov '08

I'm not sure if the cafe@ knows this, but there's a bit of a Haskell community (1200+ subscribers) built up around the Haskell subreddit on reddit.com, http://www.reddit.com/r/haskell/ A good source for news other than what appears on Planet Haskell. -- Don P.S. Feel free to submit things you like, so I don't have to :-)

1 0