February 2003 - Haskell

Re: default class methods in sub-classes
by Zdenek Dvorak 06 Feb '03

06 Feb '03

Hello, >Apparently I can't do this (in ghc or hugs -- haven't tried others): > >class Space a where > distance :: a -> a -> Int > subtract :: a -> a -> a > >class (Space a) => NormSpace a where > norm :: a -> Int > distance a b = norm (subtract a b) > >That is, I can't make (or redefine) a default for the superclass method >'distance' in a subclass. I agree that the Haskell'98 definition doesn't >claim that this should be allowed, but it seems like something that would >be >useful. Are there reasons not to allow this (or that I shouldn't want to >do >this at all)? > >Apologies if this is well-covered. I couldn't find any mention of it. the problem is, that to make something instance of NormSpace, you must first have it as instance of Space, i.e. with distance already defined. Then for this to work, the default definition in NormSpace would have to override what user defined, which looks strange. Your problem can be solved in ghc by this (but unfortunately only with -fallow-overlapping-instances -fallow-undecidable-instances (or some simmilar flags)): class HavingSubtract a where -- not sure why generic space should have subtract, subtract :: a -> a -> a -- but why not class (HavingSubtract a) => Space a where distance :: a -> a -> Int class (HavingSubtract a) => NormSpace a where norm :: a -> Int instance (NormSpace a) => Space a where distance a b = norm (subtract a b) (and there is several more examples in that I would find something like this very useful, but AFAIK there is no clean and elegant way how to do it -- you may do something simmilar using newtypes, but that is totally clumsy). Zdenek _________________________________________________________________ The new MSN 8: smart spam protection and 2 months FREE* http://join.msn.com/?page=features/junkmail

1 0

CFP: APLAS03 - 1st Asian Symp. on Prog. Lang. and Systems
by Manuel M T Chakravarty 06 Feb '03

06 Feb '03

[My apologies if this eventually leads to a double posting, but Atsushi Ohori's original post didn't get through as he does not subscribe to this list.] Call for Papers The First Asian Symposium on Programming Languages and Systems (APLAS03) URL: http://www.jaist.ac.jp/aplas/ Beijing, China. October 27-29, 2003 (Submission deadline: May 27, 2003) Sponsored by the Asian Association for Foundations of Software (AAFS) and Beihang University (Beijing University of Aeronautics and Astronautics). DESCRIPTION: APLAS aims at stimulating programming language research by providing a forum for the presentation of recent results and the exchange of ideas and experience in topics concerned with programming languages and systems. APLAS is based in Asia, but intends to be an international forum that serves the worldwide programming languages community. The APLAS series is sponsored by the Asian Association for Foundation of Software (AAFS), which has recently been founded by Asian researchers in cooperation with many researchers from Europe and the USA. APLAS has been discussed and prepared through informal workshops held in Singapore (2000), Daejeon (2001), and Shanghai (2002). APLAS03 will be the first formal symposium in the series. TOPICS: The symposium is devoted to foundational issues in programming languages and systems, covering the following areas: * semantics and theoretical foundations * type systems and language design * compilers and implementation * program analysis and security * program transformation and calculation * concurrency GENERAL CHAIR: Wei Li National Laboratory of Software Development Environment Beijing University of Aeronautics and Astronautics Beijing, 100083, China E-mail: liwei(a)nlsde.buaa.edu.cn PROGRAM CHAIR: Atsushi Ohori (http://www.jaist.ac.jp/~ohori) School of Information Science Japan Advanced Institute of Science and Technology Tatsunokuchi, Ishikawa, 923-1292 JAPAN E-mail: ohori(a)jaist.ac.jp Tel: +81 761 51 1275, Fax: +81 761 51 1149 PROGRAM COMMITTEE: * Manuel Chakravarty (University of New South Wales, Australia) * Wei Ngan Chin (National University of Singapore, Singapore) * Tyng-Ruey Chuang (Academia Sinica, Taiwan) * Yuxi Fu (Shanghai Jiaotong University, China) * Masahito Hasegawa (Kyoto University, Japan) * Kohei Honda (Queen Mary College, UK) * Zhenjiang Hu (University of Tokyo, Japan) * Peter Lee (Carnegie Mellon University, USA) * Shilong Ma (Beijing University of Aeronautics and Astronautics, China) * Martin Odersky (Ecole Polytechnique de Lausanne, Switzerland) * Atsushi Ohori (JAIST, Japan), Chair * Don Sannella (University of Edinburgh, UK) * Zhong Shao (Yale University, USA) * Kwangkeun Yi (KAIST, Korea) * Taiichi Yuasa (Kyoto University, Japan) IMPORTANT DATES: Submission deadline: May 27, 2003 Notification of acceptance: July 17, 2003 Final paper due: August 17, 2003 Symposium: October 27-29, 2003 PROCEEDINGS AND SUBMISSION PROCEDURE: The proceedings will be published in the Springer-Verlag Lecture Notes in Computer Science series. Final papers will be no more than *15* pages long in the format specified by Springer-Verlag at the URL: http://www.springer.de/comp/lncs/authors.html Prospective authors are invited to submit a 100-200 word abstract and a full paper in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. Submissions will be carried out electronically via the Web via a link found at the symposium web page http://www.jaist.ac.jp/aplas/ Papers must be submitted in either PDF format, or as PostScript documents that are interpretable by Ghostscript. Those who have difficulty in web-based submission should contact the program chair before the deadline. It is recommended that submissions adhere to the format and length of the proceedings described above. Submissions that are clearly too long may be rejected immediately.

1 0

default class methods in sub-classes
by Dylan Alex Simon 06 Feb '03

06 Feb '03

Apparently I can't do this (in ghc or hugs -- haven't tried others): class Space a where distance :: a -> a -> Int subtract :: a -> a -> a class (Space a) => NormSpace a where norm :: a -> Int distance a b = norm (subtract a b) That is, I can't make (or redefine) a default for the superclass method 'distance' in a subclass. I agree that the Haskell'98 definition doesn't claim that this should be allowed, but it seems like something that would be useful. Are there reasons not to allow this (or that I shouldn't want to do this at all)? Apologies if this is well-covered. I couldn't find any mention of it. :-Dylan Simon

2 1

ICFP 2003 CFP -- minor but critical correction
by Olin Shivers 06 Feb '03

06 Feb '03

The submission date, March 29, is a Saturday, *not* a Thursday. Sorry 'bout that. -Olin =============================================================================== Eighth Annual ACM SIGPLAN International Conference on Functional Programming ICFP 2003 Call for Papers (Revised 2003/2/5) Affiliated with PLI 2003 August 25-29, 2003 Uppsala, Sweden http://www-users.cs.york.ac.uk/~colin/icfp2003.html http://www.cc.gatech.edu/icfp03/cfp.html ------------------------------------------------------------------------------- * Important dates ----------------- Submission deadline 18:00 EST 29 March, 2003 (Saturday) Notification of acceptance rejection 19 May, 2003 Final paper due 16 June, 2003 Conference 25-29 August, 2003 * Scope ------- ICFP 2003 seeks original papers on the full spectrum of the art, science, and practice of functional programming. The conference invites submissions on all topics ranging from principles to practice, from foundations to features, and from abstraction to application. The scope covers all languages that encourage programming with functions, including both purely applicative and imperative languages, as well as languages that support objects and concurrency. Topics of interest include, but are not limited to, the following: Foundations formal semantics, lambda calculus, type theory, monads, continuations, control, state, effects. Design Algorithms and data structures, modules and type systems, concurrency and distribution, components and composition, relations to object-oriented and logic programming, multiparadigm programming. Implementation abstract machines, compile-time and run-time optimization, just-in-time compilers, memory management. Interfaces to foreign functions, services, components and low-level machine resources. Transformation and analysis abstract interpretation, partial evaluation, program transformation, theorem proving, specification and verification. Software development techniques for functional programming design patterns, specification, verification and validation, debugging, test generation, tracing and profiling. Applications and domain-specific languages systems programming, scientific and numerical computing, symbolic computing and artificial intelligence, systems programming, databases, graphical user interfaces, multimedia programming, application scripting, system administration, distributed-systems construction, web programming. Practice and experience functional programming in education and industry, ramifications on other paradigms and computing disciplines. Functional pearls elegant, instructive examples of functional programming. Papers in the latter three categories need not necessarily report original research results; they may instead, for example, report practical experience that will be useful to others, re-usable programming idioms, or elegant new ways of approaching a problem. The key criterion for such a paper is that it makes a contribution from which other practitioners can benefit. It is not enough simply to describe a program! * Submission guidelines ----------------------- Due date & time: Submissions must be filed at the web site by 18:00 EST on Saturday 29 March. Some convenient equivalents to 18:00 EST are New York: 6:00 PM = 18h00 San Francisco: 3:00 PM = 15h00 Chicago: 5:00 PM = 17h00 Paris: Midnight Hong Kong: 7:00 AM (30 March) UTC: 2300 For other time-zones/locations, see http://www.timeanddate.com/worldclock/fixedtime.html Submission URL: http://www.cc.gatech.edu/icfp03/submit Authors should submit a 100-200 word abstract and a full paper by 23:00 Universal Coordinated Time on Saturday, 29 March, 2003. Submissions should be no more than 12 pages (including bibliography and appendices) in standard ACM conference format: two columns, nine-point font on a ten-point baseline, with pages 20pc (3.33in) wide and 54pc (9in) tall, with a column gutter of 2pc (0.33in). Detailed formatting guidelines are available at http://www.acm.org/sigs/pubs/proceed/template.html, along with formatting templates or style files for LaTeX, Word Perfect, and Word. You don't need to include categories, keywords, etc., though you are welcome to do so. Also, note that the ACM copyright notice is not required of submissions, only of accepted papers. Authors wishing to supply additional material to the reviewers beyond the 12-page limit can do so in clearly marked appendices, on the understanding that reviewers are not required to read the appendices. Submissions that do not meet these guidelines will not be considered. The submission deadline and length above are firm. Submissions will be carried out electronically via the Web, at the URL given above. Papers must be submitted in either PDF format, or as PostScript documents that are interpretable by Ghostscript, and they must be printable on US Letter sized paper. Individuals for which this requirement is a hardship should contact the program chair at least one week before the deadline. Submitted papers must have content that has not previously been published in other conferences or refereed venues; simultaneous submission to other conferences or refereed venues is unacceptable. Each paper should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, saying why it is significant, and comparing it with previous work. Authors should strive to make the technical content of their papers understandable to a broad audience. Authors of accepted papers will be required to sign the ACM copyright form. Proceedings will be published by ACM Press. * Student Attendees ------------------- Students who have a paper accepted for the conference are offered student membership of SIGPLAN free for one year. As members of SIGPLAN they may apply for travel fellowships from the PAC fund. * Conference Chair ------------------ Colin Runciman University of York, UK * Program Chair --------------- Olin Shivers College of Computing Georgia Institute of Technology Atlanta, Ga. 30332-0280, USA shivers at cc.gatech.edu Phone: +1 404 385.00.91 Fax: +1 404 383.12.53 * Program Committee ------------------- Andrzej Filinksi (DIKU, University of Copenhagen) Robby Findler (University of Chicago) Fritz Henglein (IT University of Copenhagen) Hugo Herbelin (INRIA) Ralf Hinze (Universitat Bonn) Annie Liu (Stony Brook University) Benjamin Pierce (University of Pennsylvania) Todd Proebsting (Microsoft Corp.) Amr Sabry (University of Indiana) Zhong Shao (Yale University) Tim Sheard (OGI School of Science and Engineering) Eijiro Sumii (University of Tokyo) * Change log ------------ 2003/2/5 Added program committee; revised submission deadline from 3/20 to 3/29; updated student travel-fellowship information. 2003/2/5 March 29 is Saturday, not Thursday. (March 20 is a Thursday.)

1 0

Re: Looking for large Haskell programs
by George Russell 06 Feb '03

06 Feb '03

Tobias Gedell wrote > I'm looking for large haskell programs with more than 15000 lines of > code. Does any of you know where I can find such programs? The programs > found in the nofib suite are not large enough. The UniForM workbench is currently almost 80000 lines (of which 4500 are actually HaXml, so don't really count), and is almost all Haskell. It uses a lot of Glasgow extensions though.

1 0

CHARME 2003
by Tronci Enrico 06 Feb '03

06 Feb '03

---------------------------------------------------------------------- We apologize if you receive multiple copies of this announcement. ---------------------------------------------------------------------- *********************************************************************** C A L L F O R P A P E R S *********************************************************************** CHARME 2003 The 12th Advanced Research Working Conference on: Correct Hardware Design and Verification Methods 21-24 October 2003, University of L'Aquila, L'Aquila, Italy http://www.di.univaq.it/charme2003 Co-sponsored by the IFIP TC10/WG10.5 Working Group on Design and Engineering of Electronic Systems CHARME 2003 is the twelfth in a series of working conferences devoted to the development and use of leading-edge formal techniques and tools for the design and verification of hardware and systems. It has been the aim of the conference to expand its interest to software as well when the technology is related. Previous conferences have been held in Darmstadt, Edinburgh, Grenoble, Glasgow, Leuven, Torino, Arles, Frankfurt, Montreal, and Bad Herrenalb, and Edinburgh. It is the biennial counterpart of FMCAD, which takes place every even year in the USA. The aim of CHARME 2003 is to bring together researchers and users from academia and industry working in this active area of research. The conference will cover original research results, case studies, use of technologies across application domains, and reports on practical experiments. Papers describing original work in all aspects of formal hardware and system design and verification methods are invited. Papers related to formal modeling and verification of concurrent software are also welcome. The event will be held 21-24 October 2003 and hosted by University of L'Aquila, Italy. L'Aquila can be easily reached from Rome Airport. Topics of interest include, but are not limited to: * usage of semi-formal methods (combining simulation methods with formal verification) * high level design modeling languages and high level design constructs * formal verification of hybrid systems * timing verification * formal methods for commercial hardware description languages * correctness preserving transformations * formal synthesis methods * use of theorem provers for verification * BDD and FSM based approaches, including model checking and SAT checking * correctness aspects in HW/SW co-design * abstraction and compositional techniques * formal verification of protocols * diagnosis of design errors * coverage directed verification and other semi-formal verification methods * use of formal specification languages in simulation * formal verification of concurrent software * practical and industrial applications of formal techniques The conference proceedings will appear as a volume in Springer-Verlag's Lecture Notes in Computer Science series and will be available at the conference. Papers should not exceed 15 pages, formatted as specified by Springer-Verlag in the Authors Instructions page, and submitted electronically following the procedure given on the submissions page of the conference website, http://www.di.univaq.it/charme2003. Selected contributions may be invited for publication in STTT (International Journal on Software Tools for Technology Transfer, Springer-Verlag). ****************************************************************************** Author's Schedule: * 11 April 2003 - Deadline for paper submission * 6 June 2003 - Notification of acceptance * 11 July 2003 - Deadline for final version ****************************************************************************** Chairs Enrico Tronci (conference chair) (University of Rome, Italy) Daniel Geist (programme chair) (IBM, Israel) ****************************************************************************** Programme Committee Alan Hu (University of British Columbia, Canada) Alan Mycroft (University of Cambridge, UK) Anna Slobodova (Intel, USA) Armin Biere (Swiss Federal Institute of Technology, Switzerland) Byron Cook (Microsoft Corporation, USA) Carl Pixley (Synopsys, USA) Daniel Geist (PC Chair) (IBM, Israel) Dominique Borrione (University of Grenoble, France) Eli Singerman (Intel, Israel) Enrico Tronci (Conference Chair) (University of Rome, Italy) Ganesh Gopalakrishnan (University of Utah, USA) Hans Eveking (T.U. Darmstadt, Germany) John O'Leary (Intel, USA) Ken McMillan (Cadence, USA) Laurence Pierre (University of Marseille, France) Limor Fix (Intel, Israel) Mark Aagaard (University of Waterloo, Canada) Mary Sheeran (Chalmers Univ. and Prover Technology, Sweden) Moshe Vardi (Rice University, USA) Ofer Strichman (Carnegie-Mellon University, USA) Steve Johnson (Indiana University, USA) Thomas Kropf (Bosch, Germany) Tiziana Margaria (Univ. of Dortmund and METAFrame Techn., Germany) Tom Melham (University of Oxford,UK) Warren Hunt (University of Texas at Austin, USA) ******************************************************************************

1 0

ICFP 2003 Call for Papers -- deadline extended
by shivers＠ai.mit.edu 06 Feb '03

06 Feb '03

The submission deadline for ICFP (the ACM SIGPLAN International Conference on Functional Programming) has been extended by nine days to March 29 (2300 UTC). The 2003 ICFP will be in Uppsala, Sweden on August 25-29, in conjunction with PPDP (Principles and Practice of Declarative Programming). Please take a moment to read the "call for papers" I've appended below, and see if you have a topic or result you would like to submit to the program committee. See you in Sweden. -Olin Shivers program chairman =============================================================================== Eighth Annual ACM SIGPLAN International Conference on Functional Programming ICFP 2003 Call for Papers (Revised 2003/2/5) Affiliated with PLI 2003 August 25-29, 2003 Uppsala, Sweden http://www-users.cs.york.ac.uk/~colin/icfp2003.html http://www.cc.gatech.edu/icfp03/cfp.html ------------------------------------------------------------------------------- * Important dates ----------------- Submission deadline 18:00 EST 29 March, 2003 (Thursday) Notification of acceptance rejection 19 May, 2003 Final paper due 16 June, 2003 Conference 25-29 August, 2003 * Scope ------- ICFP 2003 seeks original papers on the full spectrum of the art, science, and practice of functional programming. The conference invites submissions on all topics ranging from principles to practice, from foundations to features, and from abstraction to application. The scope covers all languages that encourage programming with functions, including both purely applicative and imperative languages, as well as languages that support objects and concurrency. Topics of interest include, but are not limited to, the following: Foundations formal semantics, lambda calculus, type theory, monads, continuations, control, state, effects. Design Algorithms and data structures, modules and type systems, concurrency and distribution, components and composition, relations to object-oriented and logic programming, multiparadigm programming. Implementation abstract machines, compile-time and run-time optimization, just-in-time compilers, memory management. Interfaces to foreign functions, services, components and low-level machine resources. Transformation and analysis abstract interpretation, partial evaluation, program transformation, theorem proving, specification and verification. Software development techniques for functional programming design patterns, specification, verification and validation, debugging, test generation, tracing and profiling. Applications and domain-specific languages systems programming, scientific and numerical computing, symbolic computing and artificial intelligence, systems programming, databases, graphical user interfaces, multimedia programming, application scripting, system administration, distributed-systems construction, web programming. Practice and experience functional programming in education and industry, ramifications on other paradigms and computing disciplines. Functional pearls elegant, instructive examples of functional programming. Papers in the latter three categories need not necessarily report original research results; they may instead, for example, report practical experience that will be useful to others, re-usable programming idioms, or elegant new ways of approaching a problem. The key criterion for such a paper is that it makes a contribution from which other practitioners can benefit. It is not enough simply to describe a program! * Submission guidelines ----------------------- Due date & time: Submissions must be filed at the web site by 18:00 EST on Thursday 29 March. Some convenient equivalents to 18:00 EST are New York: 6:00 PM = 18h00 San Francisco: 3:00 PM = 15h00 Chicago: 5:00 PM = 17h00 Paris: Midnight Hong Kong: 7:00 AM (30 March) UTC: 2300 For other time-zones/locations, see http://www.timeanddate.com/worldclock/fixedtime.html Submission URL: http://www.cc.gatech.edu/icfp03/submit Authors should submit a 100-200 word abstract and a full paper by 23:00 Universal Coordinated Time on Thursday, March 29, 2003. Submissions should be no more than 12 pages (including bibliography and appendices) in standard ACM conference format: two columns, nine-point font on a ten-point baseline, with pages 20pc (3.33in) wide and 54pc (9in) tall, with a column gutter of 2pc (0.33in). Detailed formatting guidelines are available at http://www.acm.org/sigs/pubs/proceed/template.html, along with formatting templates or style files for LaTeX, Word Perfect, and Word. You don't need to include categories, keywords, etc., though you are welcome to do so. Also, note that the ACM copyright notice is not required of submissions, only of accepted papers. Authors wishing to supply additional material to the reviewers beyond the 12-page limit can do so in clearly marked appendices, on the understanding that reviewers are not required to read the appendices. Submissions that do not meet these guidelines will not be considered. The submission deadline and length above are firm. Submissions will be carried out electronically via the Web, at the URL given above. Papers must be submitted in either PDF format, or as PostScript documents that are interpretable by Ghostscript, and they must be printable on US Letter sized paper. Individuals for which this requirement is a hardship should contact the program chair at least one week before the deadline. Submitted papers must have content that has not previously been published in other conferences or refereed venues; simultaneous submission to other conferences or refereed venues is unacceptable. Each paper should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, saying why it is significant, and comparing it with previous work. Authors should strive to make the technical content of their papers understandable to a broad audience. Authors of accepted papers will be required to sign the ACM copyright form. Proceedings will be published by ACM Press. * Student Attendees ------------------- Students who have a paper accepted for the conference are offered student membership of SIGPLAN free for one year. As members of SIGPLAN they may apply for travel fellowships from the PAC fund. * Conference Chair ------------------ Colin Runciman University of York, UK * Program Chair --------------- Olin Shivers College of Computing Georgia Institute of Technology Atlanta, Ga. 30332-0280, USA shivers at cc.gatech.edu Phone: +1 404 385.00.91 Fax: +1 404 383.12.53 * Program Committee ------------------- Andrzej Filinksi (DIKU, University of Copenhagen) Robby Findler (University of Chicago) Fritz Henglein (IT University of Copenhagen) Hugo Herbelin (INRIA) Ralf Hinze (Universitat Bonn) Annie Liu (Stony Brook University) Benjamin Pierce (University of Pennsylvania) Todd Proebsting (Microsoft Corp.) Amr Sabry (University of Indiana) Zhong Shao (Yale University) Tim Sheard (OGI School of Science and Engineering) Eijiro Sumii (University of Tokyo) * Change log ------------ 2003/2/5 Added program committee; revised submission deadline from 3/20 to 3/29; updated student travel-fellowship information.

1 0

Re: Looking for large Haskell programs
by Tobias Gedell 05 Feb '03

05 Feb '03

> GHC is such a program, as are the other Haskell compilers. Perhaps too > complicated for your purposes, though. GHC has too many mutually recursive modules to be useful, otherwise it would be great! But I will look more into the other compilers, are they written in Haskell?, thanks for the suggestion! > I can give you a few ~5000-10000 line programs if you want. I don't quite > have anything as large as 15000 lines, though. I have quite many 5-10k programs, but thanks anyway! I really need programs with more than 15000 lines of code. //Tobias

3 2

Looking for large Haskell programs
by Tobias Gedell 04 Feb '03

04 Feb '03

Hi, I'm looking for large haskell programs with more than 15000 lines of code. Does any of you know where I can find such programs? The programs found in the nofib suite are not large enough. //Tobias

3 2

RE: [OT] Teaching Haskell in High School (fwd)
by Rex Page 04 Feb '03

04 Feb '03

On Tue, 4 Feb 2003, David Bergman wrote: > Rex wrote: > > > This matches my experience, too. When I've taught Haskell to > > first year college students, there have always been some hard > > core hackers who've been at it in C or VB or Perl or > > something like that for years, and they rarely take kindly to > > Haskell. The ones without any programming background do better. > > > > I think Haskell would be great for a high school math class. > > They could learn some logic and induction along with it, and > > get a few proofs back into the high school math curriculum. > > > > Rex Page > > I have always had that same experience with any (more or less) > declarative language. BUT, as soon as the "hackers" (well, maybe not VB > programmers, they are kind of doomed...) have passed the initial > frustration, and acquired the "new way of thinking", they actually > perform much better than the real beginners. > > /David Yes, I've seen the same thing with some of the people who come in with experience. Some are lost, but a few of them really embrace the expressiveness of a language like Haskell. Rex > > > > ---------- Forwarded message ---------- > > Date: Tue, 04 Feb 2003 03:03:03 +0100 > > From: Wolfgang Jeltsch <wolfgang(a)jeltsch.net> > > To: The Haskell Mailing List <haskell(a)haskell.org> > > Subject: Re: [OT] Teaching Haskell in High School > > > > On Tuesday, 2003-02-04, 01:01, CET, Hal Daume wrote: > > > [...] > > > > > However, I'm also well aware that Haskell is very difficult > > to learn > > > (and, I'd imagine, to teach). > > > > Hi, > > > > I wouldn't claim that Haskell is very difficult to learn. I > > think, people > > often have problems with learning Haskell because they know > > imperative > > programming and try to apply their imperative thinking to > > programming in > > Haskell. > > > > Some months ago, a first year student told me that she liked > > Haskell very much > > and that she didn't find it very difficult. I asked her if > > she had had > > experiences with other programming languages before learning > > Haskell. She > > answered: "No." > > > > > [...] > > > > Wolfgang > > _______________________________________________ > > Haskell mailing list > > Haskell(a)haskell.org http://www.haskell.org/mailman/listinfo/haskell > > > > _______________________________________________ > > Haskell mailing list > > Haskell(a)haskell.org http://www.haskell.org/mailman/listinfo/haskell > > > >

1 0