- Generics - Haskell.org

Updating zipper to support current versions of multirec?
by Peter Simons 20 Dec '11

20 Dec '11

Hi, would it be possible to update the zipper package so that it supports current versions of multirec, i.e. version 0.7? Take care, Peter

2 1

Mathematics of Program Construction: Second Call for Papers
by Jeremy.Gibbons＠cs.ox.ac.uk 15 Dec '11

15 Dec '11

SECOND CALL FOR PAPERS 11th International Conference on Mathematics of Program Construction (MPC 2012) Madrid, Spain, 25-27 June 2012 http://babel.ls.fi.upm.es/mpc2012 BACKGROUND The biennial MPC conferences aim to promote the development of mathematical principles and techniques that are demonstrably practical and effective in the process of constructing computer programs, broadly interpreted. The 2012 MPC conference will be held in Madrid, Spain, from 25th to 27th June 2012. The previous conferences were held in Twente, The Netherlands (1989), Oxford, UK (1992), Kloster Irsee, Germany (1995), Marstrand, Sweden (1998), Ponte de Lima, Portugal (2000), Dagstuhl, Germany (2002), Stirling, UK (2004, colocated with AMAST), Kuressaare, Estonia (2006, colocated with AMAST), Marseille, France (2008), and Québec City, Canada (2010, colocated with AMAST). TOPICS Papers are solicited on mathematical methods and tools put to use in program construction. Topics of interest range from algorithmics to support for program construction in programming languages and systems. The notion of "program" is broad, from algorithms to hardware. Some typical areas are type systems, program analysis and transformation, programming-language semantics, security, and program logics. Theoretical contributions are welcome, provided that their relevance to program construction is clear. Reports on applications are welcome, provided that their mathematical basis is evident. INVITED SPEAKERS * Gilles Barthe, IMDEA Software Institute (http://software.imdea.org/people/gilles.barthe/) * Dan Ghica, University of Birmingham (http://www.cs.bham.ac.uk/~drg/) * Tony Hoare, Microsoft Research (http://research.microsoft.com/en-us/people/thoare/) IMPORTANT DATES * Submission of abstracts 09 January 2012 * Submission of full papers 16 January 2012 * Notification to authors: 19 March 2012 * Final version: 16 April 2012 SUBMISSION Submission is in two stages. Abstracts (plain text, 10 to 20 lines) must be submitted by 09 January 2012. Full papers (pdf) adhering to the LaTeX llncs style must be submitted by 16 January 2012. There is no official page limit, but authors should strive for brevity. The web-based system EasyChair will be used for submission (http://www.easychair.org/conferences/?conf=mpc2012) Papers must report previously unpublished work, and not be submitted concurrently to another conference with refereed proceedings. Accepted papers must be presented at the conference by one of the authors. Please feel free to write to mpc2012(a)easychair.org with any questions about academic matters. The proceedings of MPC 2012 will be published in Springer-Verlag's Lecture Notes in Computer Science series, as have all the previous editions. Authors of accepted papers will be expected to transfer copyright to Springer for this purpose. After the conference, we plan that the authors of the best papers will be invited to submit revised versions to a special issue of the Elsevier journal Science of Computer Programming. PROGRAMME COMMITTEE Jeremy Gibbons University of Oxford, UK (co-chair) Pablo Nogueira Universidad Politécnica de Madrid, ES (co-chair) Ralph Back Åbo Akademi, FI Roland Backhouse University of Nottingham, UK Eerke Boiten University of Kent, UK William Cook University of Texas at Austin, US Jules Desharnais Université Laval, CA Lindsay Groves Victoria University of Wellington, NZ Ian Hayes University of Queensland, AU Ralf Hinze University of Oxford, UK Graham Hutton University of Nottingham, UK Johan Jeuring Utrecht Universiteit, NL Christian Lengauer Universität Passau, DE Larissa Meinicke Macquarie University, AU Bernhard Möller Universität Augsburg, DE Carroll Morgan University of New South Wales, AU Shin-Cheng Mu Academia Sinica, TW Dave Naumann Stevens Institute of Technology, US Jose Oliveira Universidade do Minho, PT Steve Reeves University of Waikato, NZ Wouter Swierstra Radboud Universiteit, NL Anya Tafliovich University of Toronto Scarborough, CA VENUE The conference will take place in Madrid, the capital of Spain, in the Facultad de Medicina of Universidad Complutense de Madrid. The Faculty of Medicine is located in Madrid's Ciudad Universitaria (city campus), not far from the city centre and other major tourist attractions. Accommodation has been reserved in a nearby hotel. LOCAL ORGANIZERS Pablo Nogueira Universidad Politécnica de Madrid Ricardo Peña Universidad Complutense de Madrid Alvaro García IMDEA Software Institute and Universidad Politécnica de Madrid Manuel Montenegro Universidad Complutense de Madrid For queries about local matters, please write to pablo(a)babel.ls.fi.upm.es.

1 0

Mathematics of Program Construction - first call for papers
by Jeremy.Gibbons＠comlab.ox.ac.uk 07 Sep '11

07 Sep '11

FIRST CALL FOR PAPERS 11th International Conference on Mathematics of Program Construction (MPC 2012) Madrid, Spain, 25-27 June 2012 http://babel.ls.fi.upm.es/mpc2012 BACKGROUND The biennial MPC conferences aim to promote the development of mathematical principles and techniques that are demonstrably practical and effective in the process of constructing computer programs, broadly interpreted. The 2012 MPC conference will be held in Madrid, Spain, from 25th to 27th June 2012. The previous conferences were held in Twente, The Netherlands (1989), Oxford, UK (1992), Kloster Irsee, Germany (1995), Marstrand, Sweden (1998), Ponte de Lima, Portugal (2000), Dagstuhl, Germany (2002), Stirling, UK (2004, colocated with AMAST), Kuressaare, Estonia (2006, colocated with AMAST), Marseille, France (2008), and Québec City, Canada (2010, colocated with AMAST). TOPICS Papers are solicited on mathematical methods and tools put to use in program construction. Topics of interest range from algorithmics to support for program construction in programming languages and systems. The notion of "program" is broad, from algorithms to hardware. Some typical areas are type systems, program analysis and transformation, programming-language semantics, security, and program logics. Theoretical contributions are welcome, provided that their relevance to program construction is clear. Reports on applications are welcome, provided that their mathematical basis is evident. INVITED SPEAKERS To be arranged. IMPORTANT DATES * Submission of abstracts 09 January 2012 * Submission of full papers 16 January 2012 * Notification to authors: 19 March 2012 * Final version: 16 April 2012 SUBMISSION Submission is in two stages. Abstracts (plain text, 10 to 20 lines) must be submitted by 09 January 2012. Full papers (pdf) adhering to the LaTeX llncs style must be submitted by 16 January 2012. There is no official page limit, but authors should strive for brevity. The web-based system EasyChair will be used for submission (http://www.easychair.org/conferences/?conf=mpc2012) Papers must report previously unpublished work, and not be submitted concurrently to another conference with refereed proceedings. Accepted papers must be presented at the conference by one of the authors. Please feel free to write to mpc2012(a)easychair.org with any questions about academic matters. The proceedings of MPC 2012 will be published in Springer-Verlag's Lecture Notes in Computer Science series, as have all the previous editions. Authors of accepted papers will be expected to transfer copyright to Springer for this purpose. After the conference, we plan that the authors of the best papers will be invited to submit revised versions to a special issue of the Elsevier journal Science of Computer Programming. PROGRAMME COMMITTEE Jeremy Gibbons University of Oxford, UK (co-chair) Pablo Nogueira Universidad Politécnica de Madrid, ES (co-chair) Ralph Back Åbo Akademi, FI Roland Backhouse University of Nottingham, UK Eerke Boiten University of Kent, UK William Cook University of Texas at Austin, US Jules Desharnais Université Laval, CA Lindsay Groves Victoria University of Wellington, NZ Ian Hayes University of Queensland, AU Ralf Hinze University of Oxford, UK Graham Hutton University of Nottingham, UK Johan Jeuring Utrecht Universiteit, NL Christian Lengauer Universität Passau, DE Larissa Meinicke Macquarie University, AU Bernhard Möller Universität Augsburg, DE Carroll Morgan University of New South Wales, AU Shin-Cheng Mu Academia Sinica, TW Dave Naumann Stevens Institute of Technology, US Jose Oliveira Universidade do Minho, PT Steve Reeves University of Waikato, NZ Wouter Swierstra Radboud Universiteit, NL Anya Tafliovich University of Toronto Scarborough, CA VENUE The conference will take place in Madrid, the capital of Spain, in the Facultad de Medicina of Universidad Complutense de Madrid. The Faculty of Medicine is located in Madrid's Ciudad Universitaria (city campus), not far from the city centre and other major tourist attractions. Accommodation will be available in nearby hotels. LOCAL ORGANIZERS Pablo Nogueira Universidad Politécnica de Madrid Ricardo Peña Universidad Complutense de Madrid Alvaro García IMDEA Software Institute and Universidad Politécnica de Madrid Manuel Montenegro Universidad Complutense de Madrid For queries about local matters, please write to pablo(a)babel.ls.fi.upm.es.

1 0

CFP PEPM12: Workshop on Partial Evaluation and Program Manipulation
by oleg＠okmij.org 28 Jun '11

28 Jun '11

ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation January 23-24, 2012. Philadelphia, Pennsylvania, USA (co-located with POPL'12) Call For Papers http://www.program-transformation.org/PEPM12 The PEPM Symposium/Workshop series aims to bring together researchers and practitioners working in the broad area of principled program transformation, which spans from refactoring, partial evaluation, supercompilation, fusion and other metaprogramming to model-driven development, program analyses including termination, inductive programming, program generation and applications of machine learning and probabilistic search. PEPM focuses on techniques, supporting theory, tools, and applications of the analysis and manipulation of programs. Each technique or tool of program manipulation should have a clear, although perhaps informal, statement of desired properties, along with an argument how these properties could be achieved. Topics of interest for PEPM'12 include, but are not limited to: - Program and model manipulation techniques such as: supercompilation, partial evaluation, fusion, on-the-fly program adaptation, active libraries, program inversion, slicing, symbolic execution, refactoring, decompilation, and obfuscation. - Program analysis techniques that are used to drive program/model manipulation such as: abstract interpretation, termination checking, binding-time analysis, constraint solving, type systems, automated testing and test case generation. - Techniques that treat programs/models as data objects including metaprogramming, generative programming, embedded domain-specific languages, program synthesis by sketching and inductive programming, staged computation, and model-driven program generation and transformation. - Application of the above techniques including case studies of program manipulation in real-world (industrial, open-source) projects and software development processes, descriptions of robust tools capable of effectively handling realistic applications, benchmarking. Examples of application domains include legacy program understanding and transformation, DSL implementations, visual languages and end-user programming, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications, resource-limited computation, and security. To maintain the dynamic and interactive nature of PEPM, we will continue the category of `short papers' for tool demonstrations and for presentations of exciting if not fully polished research, and of interesting academic, industrial and open-source applications that are new or unfamiliar. Student attendants with accepted papers can apply for a SIGPLAN PAC grant to help cover travel expenses and other support. All accepted papers, short papers included, will appear in formal proceedings published by ACM Press. In addition to printed proceedings, accepted papers will be included in the ACM Digital Library. Selected papers may later on be invited for a journal special issue dedicated to PEPM'12. The SIGPLAN Republication Policy and ACM's Policy and Procedures on Plagiarism apply. Submission Categories and Guidelines Authors are strongly encouraged to consult the advice for authoring research papers and tool papers before submitting. The PC Chairs welcome any inquiries about the authoring advice. Regular research papers must not exceed 10 pages in ACM Proceedings style. Short papers are up to 4 pages in ACM Proceedings style. Authors of tool demonstration proposals are expected to present a live demonstration of the described tool at the workshop (tool papers should include an additional appendix of up to 6 extra pages giving the outline, screenshots, examples, etc. to indicate the content of the proposed live demo at the workshop). Important Dates - Paper submission: Mon, October 10, 2011, 23:59, GMT - Author notification: Tue, November 8, 2011 - Workshop: Mon-Tue, January 23-24, 2012 Invited Speakers TBD Program Chairs - Oleg Kiselyov (Monterey, CA, USA) - Simon Thompson (University of Kent, UK) Program Committee Members - Emilie Balland (INRIA, France) - Ewen Denney (NASA Ames Research Center, USA) - Martin Erwig (Oregon State University, USA) - Sebastian Fischer (National Institute of Informatics, Japan) - Lidia Fuentes (Universidad de Malaga, Spain) - John Gallagher (Roskilde University, Denmark and IMDEA Software, Spain) - Dave Herman (Mozilla Labs) - Stefan Holdermans (Vector Fabrics, the Netherlands) - Christian Kaestner (University of Marburg, Germany) - Emanuel Kitzelmann (International Computer Science Institute, USA) - Andrei Klimov (Keldysh Institute of Applied Mathematics, Russian Academy of Sciences) - Shin-Cheng Mu (Academia Sinica, Taiwan) - Alberto Pardo (Universidad de la Repu'blica, Uruguay) - Kostis Sagonas (Uppsala University, Sweden and National Technical University of Athens, Greece) - Anthony M. Sloane (Macquarie University, Australia) - Armando Solar-Lezama (MIT, USA) - Aaron Stump (The University of Iowa, USA) - Kohei Suenaga (University of Kyoto, Japan) - Eric Van Wyk (University of Minnesota, USA) - Kwangkeun Yi (Seoul National University, Korea)

1 0

2nd CFP: ACM SIGPLAN 7th Workshop on Generic Programming (WGP 2011)
by linisac＠iis.sinica.edu.tw 04 May '11

04 May '11

====================================================================== CALL FOR PAPERS WGP 2011 7th ACM SIGPLAN Workshop on Generic Programming Tokyo, Japan Sunday, September 18th, 2011 http://flolac.iis.sinica.edu.tw/wgp11/ Collocated with the International Conference on Functional Programming (ICFP 2011) ====================================================================== Goals of the workshop --------------------- Generic programming is about making programs more adaptable by making them more general. Generic programs often embody non-traditional kinds of polymorphism; ordinary programs are obtained from them by suitably instantiating their parameters. In contrast with normal programs, the parameters of a generic program are often quite rich in structure; for example they may be other programs, types or type constructors, class hierarchies, or even programming paradigms. Generic programming techniques have always been of interest, both to practitioners and to theoreticians, and, for at least 20 years, generic programming techniques have been a specific focus of research in the functional and object-oriented programming communities. Generic programming has gradually spread to more and more mainstream languages, and today is widely used in industry. This workshop brings together leading researchers and practitioners in generic programming from around the world, and features papers capturing the state of the art in this important area. We welcome contributions on all aspects, theoretical as well as practical, of * generic programming, * programming with (C++) concepts, * meta-programming, * programming with type classes, * programming with modules, * programming with dependent types, * polytypic programming, * adaptive object-oriented programming, * component-based programming, * strategic programming, * aspect-oriented programming, * family polymorphism, * object-oriented generic programming, * and so on. Organizers ---------- Co-Chair Jaakko J"arvi, Texas A&M University, USA Co-Chair Shin-Cheng Mu, Academia Sinica, Taiwan Programme Committee ------------------- Dave Abrahams, BoostPro Computing, USA Magne Haveraaen, Universitetet i Bergen, Norway Akimasa Morihata, Tohoku University, Japan Pablo Nogueira, Universidad Polit'ecnica de Madrid, Spain Ulf Norell, Chalmers University of Technology and University of Gothenberg, Sweden Ross Paterson, City University London, UK Rinus Plasmeijer, Radboud University Nijmegen, The Netherlands Sibylle Schupp, Technische Universit"at Hamburg-Harburg, Germany Andrew Sutton, Kent State University, USA Tarmo Uustalu, Institute of Cybernetics, Estonia Important Information --------------------- We plan to have formal proceedings, published by the ACM. Submission details Deadline for submission: Monday 2011-06-06 Notification of acceptance: Tuesday 2011-07-01 Final submission due: Monday 2011-07-25 Workshop: Sunday 2011-09-18 Authors should submit papers, in postscript or PDF format, formatted for A4 paper, to the WGP11 EasyChair instance by the above deadline. The length should be restricted to 12 pages in standard (two-column, 9pt) ACM format. Accepted papers are published by the ACM and will additionally appear in the ACM digital library. History of the Workshop on Generic Programming ---------------------------------------------- This year: * Tokyo, Japan 2011 (affiliated with ICFP11) Earlier Workshops on Generic Programming have been held in * Baltimore, Maryland, US 2010 (affiliated with ICFP10) * Edinburgh, UK 2009 (affiliated with ICFP09) * Victoria, BC, Canada 2008 (affiliated with ICFP), * Portland 2006 (affiliated with ICFP), * Ponte de Lima 2000 (affiliated with MPC), * Marstrand 1998 (affiliated with MPC). Furthermore, there were a few informal workshops * Utrecht 2005 (informal workshop), * Dagstuhl 2002 (IFIP WG2.1 Working Conference), * Nottingham 2001 (informal workshop), There were also (closely related) DGP workshops in Oxford (June 3-4 2004), and a Spring School on DGP in Nottingham (April 24-27 2006, which had a half-day workshop attached). Additional information: The WGP steering committee consists of J. Gibbons, R. Hinze, P. Jansson, J. J"arvi, J. Jeuring, B. Oliveira, S. Schupp, and M. Zalewski ---------------------------------------------------------------- This message was sent using IMP, the Internet Messaging Program.

1 0

pervasiveness of Rec in TH-derived instant-generics representation types
by Nicolas Frisby 17 Feb '11

17 Feb '11

In instant-generics-0.2.1, the TH functions for deriving the Rep type instances insert the "Rec" type at every field. Is there a consequence to this? This behavior seems at odds with the paper; isn't Rec only meant as an indicator of recursive occurrences within the original data type? Thanks. --- snippet from http://j.mp/gK8MOk ; repField is invoked for every field of every constructor by all of the relevant TH entry-points. repField :: (Name, [Name]) -> Type -> Q Type --repField d t | t == dataDeclToType d = conT ''I repField d t = conT ''Rec `appT` return t repField' :: (Name, [Name]) -> Name -> (Name, Strict, Type) -> Q Type --repField' d ns (_, _, t) | t == dataDeclToType d = conT ''I repField' (dt, vs) ns (f, _, t) = conT ''Rec `appT` return t -- Note: we should generate Var too, at some point

2 3

ANNOUNCE: syb-0.3
by José Pedro Magalhães 18 Jan '11

18 Jan '11

Hello all, Just a quick announcement: I've posted syb-0.3<http://hackage.haskell.org/package/syb-0.3>on Hackage. Changes from syb-0.2.2 include (from 'darcs changes'): * Add test for everythingBut * Add everythingBut (FIX 16<http://code.google.com/p/scrapyourboilerplate/issues/detail?id=16> ) * Tests for ext2 * Add ext2 and friends (FIX 14<http://code.google.com/p/scrapyourboilerplate/issues/detail?id=14> ) * Export primitive ext1 (since ext0 is exported as well) Please let me know if you have any problems with the new version, or if you have any comments. Thanks, Pedro

2 5

Re: [Hs-Generics] EMGM for GHC 6.12
by Sean Leather 05 Oct '10

05 Oct '10

On Tue, Oct 5, 2010 at 07:09, Antoine Latter wrote: > The error message you're getting is pretty un-helpful - what's > happened is that EMGM has declared that it is only compatible with > template-haskell version 2.3, however GHC 6.12 ships with > template-haskell version 2.4. > Exactly. EMGM has not been updated for a newer Template Haskell. > On Mon, Oct 4, 2010 at 11:36 PM, Hans Peter Würmli wrote: > > Also I noticed that the last upload was version 0.3.1. Is the library > still > > under maintenance? > Yes, it is. Unfortunately, I have not had time recently to fix the TH issue. I do have a local repository with some changes that I worked on a while back. The changes include stripping the TH from the emgm package. It's a nasty dependency that often requires updating for every GHC update, since the syntax datatypes change. The big idea is to have the representation generation be in a separate package from the EMGM library. This way, EMGM itself is smaller and doesn't have to change to support new TH versions or other things. The other unfortunate aspect of EMGM's design is that I made the TH stuff quite complicated when I did it. So, it's not easy to maintain. I want to simplify it and clean it up. If you want to play with a TH-free version of EMGM, I can easily commit my current work to the Subversion repository or to GitHub. You can then create your representation yourself. But the other stuff may have to wait for a few weeks. Regards, Sean

1 0

EMGM for GHC 6.12
by Hans Peter Würmli 05 Oct '10

05 Oct '10

I tried to install EMGM from Hackagedb under ghc 6.12.1 (Debian Packages). The process ends with: "... Building packedstring-0.1.0.1... Data/PackedString.hs:83:7: Could not find module `Data.Data': It is a member of the hidden package `base'. Perhaps you need to add `base' to the build-depends in your .cabal file. Use -v to see a list of the files searched for. cabal: Error: some packages failed to install: emgm-0.3.1 depends on packedstring-0.1.0.1 which failed to install. packedstring-0.1.0.1 failed during the building phase. The exception was: ExitFailure 1 template-haskell-2.3.0.1 depends on packedstring-0.1.0.1 which failed to install." Also I noticed that the last upload was version 0.3.1. Is the library still under maintenance? Cheers Hans Peter

2 2

Fwd: [Haskell] ANNOUNCE: Utrecht Haskell Compiler (UHC), version 1.1.0
by José Pedro Magalhães 23 Sep '10

23 Sep '10

Hi generic programmers, I would like to emphasize the release of the Utrecht Haskell Compiler version 1.1.0---this time with built-in generics! Derivable type class functions are now implemented within Haskell, and you can have your own derivable type classes. In particular, you can also derive Functor, for instance. The mechanism is described in our paper soon to be presented at the Haskell Symposium [1]. So if you feel a bit experimental, try it out, and please report any problems you might run into. Cheers, Pedro [1] José Pedro Magalhães, Atze Dijkstra, Johan Jeuring, and Andres Löh. A generic deriving mechanism for Haskell. http://dreixel.net/research/pdf/gdmh_draft.pdf ---------- Forwarded message ---------- From: Atze Dijkstra <atze(a)cs.uu.nl> Date: Wed, Sep 22, 2010 at 16:30 Subject: [Haskell] ANNOUNCE: Utrecht Haskell Compiler (UHC), version 1.1.0 To: Haskell(a)haskell.org, haskell-cafe Cafe <haskell-cafe(a)haskell.org> Utrecht Haskell Compiler -- second release 1.1.0 ================================================ The UHC team is happy to announce the second public release of the Utrecht Haskell Compiler (UHC). UHC supports almost allmost all Haskell98 and Haskell2010 features plus some experimental extensions. The compiler runs on MacOSX, Windows (cygwin), and various Unix flavors. This second release has the following highlights relative to the previous first release: * Supports most of the Haskell2010 features. * Generic deriving [1]. * UHC knows about packages, and Cabal version 1.9.3 and later have basic support for UHC, so that Cabal can be used to build UHC packages. * For the default backend libraries are provided until including package haskell98. * The runtime system is no longer dependent on Boehm garbage collector, but uses UHCs own, a swap space collector allowing parameterization with backend specifics. * More programs from the nofib test suite compile and run. * Many smaller and larger problems fixed. For more info see http://www.cs.uu.nl/wiki/UHC Getting started & Download -------------------------- UHC is available for download as source distribution via the UHC home page: http://www.cs.uu.nl/wiki/UHC Here you will also find instructions to get started and the specifics of what UHC can and cannot do. Status of the implementation ---------------------------- Over the past year much effort by many people has been put into improving UHC, in particular to make it compile and run more library modules and test programs. Although the UHC project is very much work in progress overall reliability has improved, bugs have been fixed, and some Hackage packages compile. Warning ------- Although we think that the compiler is stable enough to compile substantial Haskell programs, we do not recommend yet to use it for any serious development work in Haskell. We ourselves use the GHC as a development platform! We think however that it provides a great platform for experimenting with language implementations, language extensions, etc. Mailing lists ------------- For UHC users and developers respectively: http://mail.cs.uu.nl/mailman/listinfo/uhc-users http://mail.cs.uu.nl/mailman/listinfo/uhc-developers Bug reporting ------------- Please report bugs at: http://code.google.com/p/uhc/issues/list The UHC Team [1] Jose Pedro Magalhaes, Atze Dijkstra, Johan Jeuring, and Andres Loeh. A generic deriving mechanism for Haskell. http://dreixel.net/research/pdf/gdmh_draft.pdf (see Section 7.1 for the discussion on constrained datatypes) - Atze - Atze Dijkstra, Department of Information and Computing Sciences. /|\ Utrecht University, PO Box 80089, 3508 TB Utrecht, Netherlands. / | \ Tel.: +31-30-2534118/1454 | WWW : http://www.cs.uu.nl/~atze<http://www.cs.uu.nl/%7Eatze>. /--| \ Fax : +31-30-2513971 .... | Email: atze(a)cs.uu.nl ............ / |___\ _______________________________________________ Haskell mailing list Haskell(a)haskell.org http://www.haskell.org/mailman/listinfo/haskell

1 0