December 2001 - Haskell

Re: --+ not treated as a start of a comment
by Ian Lynagh 09 Dec '01

09 Dec '01

On Sun, Dec 09, 2001 at 09:50:18PM +0100, Feliks Kluzniak wrote: > > > while the report (and hugs) believe "--+ 1" is a comment. > > If a bystander is allowed to comment... > > Actually, the newer versions of the report say you can use "--" to begin a legal > lexeme (Sec. 2.3, p. 6). Euch. Is --- the start of a comment? Either way the lexical syntax needs to be changed, either to comment -> dashes {any}<symbol {any}> newline dashes -> -- {-} or to comment -> dashes {any}<symbol {any}> newline dashes -> -- Thanks Ian

1 0

Great Site!
by welcome 09 Dec '01

09 Dec '01

To be removed from this list simply reply with remove in the subject line. Dear Webmaster, Okay you have a great web site? Submitted to all of the search engines? Even hired some college kid to "promote" you to all of the FFA boards that nobody ever reads? If so I guess that you monthly site traffic is probably in the region of 10 to 100 visitors if you are lucky and you are feeling rather depressed - right? Well we have the definitive answer - we positively guarantee you high quality, genuine traffic to your web site. We make just one 100% guaranteed and solid promise to you - "WE WILL GET PEOPLE LOOKING AT YOUR WEB SITE WITHIN A MONTH - AND IF WE DON'T GET THE AMOUNT OF VISITORS TO YOU THAT WE PROMISE YOU CAN HAVE YOUR MONEY BACK - period" Take a few seconds to see what you get from TrafficFusion.Com The Ultimate Traffic Source ! http://www.trafficfusion.com This the one and only package of it's kind you will never find a more complete source to drive traffic to your web site and it is only being offered for a limited time! Here's What You'll Get: 1,000 Guaranteed Visitors every month for one full year! ($19.95 Value every Month!) 5,000 FREE Banner Impressions Guaranteed every month for one full year! ($24.95 Value every Month!) $500 in FREE Keywords on a Major Search Engine! (That's 50,000 targeted visitors) Free Submission of your Press Release to over 2,500 Media Sources Nationwide every month for one full year! (That's $249 Value!) E-Mail over 1,000,000 Opt-in subscribers daily! Spam Free! (That's a $199 monthly Value) That's a yearly Value of Over $3500 Yours for less than you pay for hosting every month!! You'll Also Get "Guaranteed Hits Secrets Exposed" This package shows you how to generate up to 1,000 hits per hour anytime you want to (and even shows you how to make that 1,000 hits equal even more!). You will have Full Resale Rights to resell the "Guaranteed Hits Secrets Exposed" for any price you choose! (This sells daily on eBay for $199) You'll Also Get: Instant Access To To 1,000's of Resources! Free multi-submission to 100,000's of sites; Instantly! 1000's of FREE reports, ebooks, tutorials and more! Dozens of FREE traffic building tools! Huge collection of home-based internet business links and resources! FREE software including submission utilities, FREE ebook compiler software, meta-tag optimization tools, etc.! Links to over 10,000 FREE ad sites including search engines, classifieds, ffa pages, etc.! FREE webmaster services such as link and html checkers, keyword utilities, doorway page generators, color and graphics tools, etc. FREE web graphics for your website including logo templates, borders & backgrounds, buttons, ebook graphics ,etc. Plus much more! http://www.trafficfusion.com If you are serious about the success of your site give us a shot! There will never be another opportunity to get such a complete promotional package! This is not a quick fix! We will deliver traffic to your site month after month! This is a Full 1 Year membership in our program! We are the traffic professionals! Thanks http://www.trafficfusion.com

1 0

Wichtig
by XxHackerabwehrxX＠mail.com 09 Dec '01

09 Dec '01

Hi, wir unterlagen einem Angriff verantwortungsloser ausl�ndischer Hacker, deshalb sind wir aus Sicherheitsgr�nden auf einen besseren Server umgezogen. Es kam zu kurzen Ausf�llen, wir bitten Sie um Verst�ndnis. Wir zeigen in der neuen Auflage der *Hackerschule*, wie Sie die teuren ***0190 Dialer*** umgehen und so die kostenpflichtigen (zB. Sex-) Angebote zum Nulltarif nutzen! Wir zeigen Ihnen wie Sie einen beliebigen (AOL, AIM, Yahoo usw.) Chatraum total kontrollieren und mit mehreren Namen on sind! Wir haben nat�rlich auch SMS Programme die funzen..;-) Nat�rlich bezahlen Sie noch immer alle SMS �ber Ihr Handy. Wie lange noch ????...den Code gibts hier: Sie kennen die Konten Ihres Nachbarn noch nicht?...;-) In Ihrem Postfach tummeln sich Sexanbieter? Wir zeigen Ihnen, wie Sie diese loswerden...:-) http://tip.nu/hackerabwehr Das gesammte Wissen und die Toolz der erfolgreichsten Hacker! Sie finden st�ndig in der *Hackerschule* Mailbomber, Nuker, Scanner, IRC-Bots, Trojaner (Netbus, BO, Sub7...), Handy-Sicherheits-Software (Sie wissen schon... falls ein "Sicherheits"-Code vergessen wurde.. ), Virii, Worms, Crack-Tools, Calling-Card-Generatoren, Creditcard-Tools, DoS-Tools, POD-Tools uvm... ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ACHTUNG: Wir d�rfen hier aus rechtlichen Gr�nden nicht alles nennen... ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ **WMHS**

1 0

CFP: WRS 2002 - 2nd WS on Reduction Strategies in Rewriting and Programming
by Bernhard Gramlich 08 Dec '01

08 Dec '01

[Apologies for multiple copies of this announcement] ************************************************************************** *************** first call for papers and participation **************** ************************************************************************** Second International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2002) http://www.dsic.upv.es/users/elp/WRS2002 held in conjunction with RTA 2002 Copenhagen, Denmark, July 21, 2002 -------------------------------------------------------------------------- BACKGROUND AND AIMS Reduction strategies in rewriting and programming have attracted an increasing attention within the last years. New types of reduction strategies have been invented and investigated, and new results on rewriting / computation under particular strategies have been obtained. Research in this field ranges from primarily theoretical questions about reduction strategies to very practical application and implementation issues. The need for a deeper understanding of reduction strategies in rewriting and programming, both in theory and practice, is obvious, since they bridge the gap between unrestricted general rewriting (computation) and (more deterministic) rewriting with particular strategies (programming). Moreover, reduction strategies provide a natural way to go from operational principles (e.g., graph and term rewriting, narrowing, lambda-calculus) and semantics (e.g., normalization, computation of values, infinitary normalization, head-normalization) to implementations of programming languages. Therefore any progress in this area is likely to be of interest not only to the rewriting community, but also to neighbouring fields like functional programming, functional-logic programming, and termination proofs of algorithms. The workshop wants to provide a forum for the presentation and discussion of new ideas and results, recent developments, new research directions, as well as of surveys on existing knowledge in this area. Furthermore we aim at fostering interaction and exchange between researchers and students actively working on such topics. The workshop will be held in conjunction with RTA 2002 in Copenhagen (Denmark) on July 21, 2002. The workshop is (co-)organized by TU Valencia and TU Wien. TOPICS OF INTEREST Topics of interest include, but are not restricted to, - theoretical foundations for the definition and semantic description of reduction strategies - strategies in different frameworks (term rewriting, graph rewriting, infinitary rewriting, lambda calculi, higher order rewriting and explicit substitutions, conditional rewriting, rewriting with built-ins, narrowing, constraint solving, etc.) and their application in (equational, functional, functional-logic) programming (languages) - properties of reduction strategies / computations under strategies (e.g., completeness, computability, decidability, complexity, optimality, (hyper-)normalization, cofinality, fairness, perpetuality, context-freeness, neededness, laziness, eagerness, strictness) - interrelations, combinations and applications of reduction under different strategies (e.g., equivalence conditions for fundamental properties like termination and confluence, applications in modularity analysis, connections between strategies of different frameworks, etc.) - program analysis and other semantics-based optimization techniques dealing with reduction strategies - rewrite systems / tools / implementations with flexible / programmable strategies as essential concept / ingredient - specification of reduction strategies in (real) languages - data structures and implementation techniques for reduction strategies. SUBMISSIONS We solicit papers on all aspects of reduction strategies in rewriting and programming. Submissions should describe unpublished work, except for survey papers which are explicitly welcome, too. Submissions should not exceed 10 pages (however, survey papers may be longer) and be sent in postscript format to the PC co-chairs to the following e-mail address: wrs02(a)dsic.upv.es before April 15, 2002. Submissions should include the title, authors' names, affiliations, addresses, and e-mail. Selection of papers by the PC will be based on originality, significance, and correctness. Accepted papers will be included in the workshop proceedings that will be available at the workshop, and electronically on the web. Final versions will be due by June 17, 2002. PUBLICATION Accepted papers will be included in the workshop proceedings that will be available at the workshop, and electronically on the web. A special issue of the Journal of Symbolic Computation on Reduction Strategies in Rewriting and Programming will be designated for revised and extended versions of selected contributions from both WRS 2001 (Utrecht, May 2001) and WRS 2002. PROGRAM COMMITTEE Sergio Antoy Portland (USA) Roberto Di Cosmo Paris VII (France) Bernhard Gramlich (co-chair) Wien (Austria) Michael Hanus Kiel (Germany) Claude Kirchner Nancy (France) Paul Klint CWI Amsterdam (The Netherlands) Salvador Lucas (co-chair) Valencia (Spain) Manfred Schmidt-Schauss Frankfurt am Main (Germany) Yoshihito Toyama Tohoku (Japan) ORGANIZERS Bernhard Gramlich (co-chair) Technische Universitaet Wien Salvador Lucas (co-chair) Universidad Politecnica de Valencia IMPORTANT DATES Deadline for submissions: April 15, 2002 Notification: May 27, 2002 Final versions due: June 17, 2002 Workshop: July 21, 2002 FURTHER INFORMATION WRS 2002 website: http://www.dsic.upv.es/users/elp/WRS2002 WRS 2002 e-mail address: wrs02(a)dsic.upv.es RTA 2002 website: http://www.ericsson.com/cslab/rta2002/ FLoC 2002 website: http://floc02.diku.dk WRS 2002 website at FLoC: http://floc02.diku.dk/WRS **************************************************************************

1 0

Kid's Holiday Gift of the Year
by marks＠desertsurf.com 08 Dec '01

08 Dec '01

1 0

Icsm 2002 Call for Papers
by icsmif＠unisannio.it 07 Dec '01

07 Dec '01

Dear Colleague I would like to invite you at the IEEE International Conference on Software Maintenance, 2002, and associated workshops: SCAM, WSE, and WESS next October 2002 in Montreal, Canada. Outstanding Keynotes such as Jon Pincus, Microsoft, Industrial and experience papers, reseach papers, tutorials, tool expositions, dissertation forum, workshops, panels, and other exciting activities have been planned. We hope that this CFP will be useful for your work. Please forward the following to anybody who you think may be interested. Our apologies if you received multiple copy of this. If you would like to be removed from our list please send an email to icsm2002.info(a)unisannio.it with REMOVE in the subject. ICSM2002 Giuliano Antoniol, Program CoChair Ira D. Baxter, Program CoChair ============================================================================ IEEE International Conference on Software Maintenance 2002 Sponsored by IEEE ICSM-2002, Montreal, Canada, 3-6 October 2002 http://www.icsm2002.org icsm2002.info(a)unisannio.it Call for Papers Theme: Maintaining distributed heterogeneous systems ICSM is the major international conference in the field of software and systems maintenance, evolution, and management. This year's theme elaborates on last year's theme of "systems and software evolution in the era of the internet". Standalone legacy applications of yesterday and novel applications using today's technologies are rapidly becoming integrated as part of enterprise-wide and industry-wide systems. The need for rapid integration has led to many distributed heterogeneous systems that are very challenging to maintain and evolve. ICSM 2002 will address these new scenarios and the major challenges on maintenance and evolution. The focus of the conference will be on the new challenges that heterogeneous systems pose for software maintenance, and the new opportunities for researchers and practitioners. A main goal of ICSM is to promote interaction between researchers and practitioners. ICSM 2002 will bring together researchers, practitioners, developers and users of tools, technology transfer experts, and project managers. Jon Pincus (Microsoft) will describe how Microsoft handles software enhancements. Other outstanding Keynote speakers are being arranged. Past conferences have had Parnas, Rombach, McCabe, and Jacobson. ICSM-2002 will offer technical presentations and demonstrations from academia and industry. We are particularly interested in exchanging concepts, prototypes, research ideas, and other results that could contribute to the academic arena and also benefit business and the industrial community. ICSM 2002 will be participatory, with working collaborative sessions and presentations of industry projects. The Conference will be held in conjunction with: WESS -- Workshop on Empirical Studies of Software Maintenance. SCAM -- Source Code Analysis and Manipulation WSE -- Workshop on WEBsite Evolution Topics of interest include but are not restricted to the following aspects of maintenance and evolution: - Methods and theories - Maintenance and/or productivity metrics - Organizational frameworks - Preventive maintenance - Design for maintenance - Tools and environments - Life cycle and process control - Models/methods for error prediction - User interface evolution - Commercial off-the-shelf (COTS) - Third party maintenance - Freeware and open source applications - Program comprehension - Software and system visualisation - Knowledge based systems - Measurement of software - Formal methods - Legal aspects and standards - Software reusability - Internet and distributed systems - Empirical studies - Testing and regression testing - Remote, tele-work - Version and configuration management - Processes and strategies - Management and organisation - Co-operative applications - Source code analysis and manipulation - Processes and strategies - Impact of new software practices - Programming languages - Reengineering and reverse engineering - Multimedia systems RESEARCH PAPERS: Research papers should describe original and significant work in the research and practice of software maintenance and evolution. Case studies, empirical research, and experiments are particularly welcome. We also welcome papers that present leading edge and novel ideas in maintenance. Papers must not exceed 5000 words (10 pages IEEE style) in length, in English. To encourage strong submissions a prize will be awarded for the "Best Paper as Submitted". This Prize is offered by John Wiley & Sons, the publishers of the Journal of Software Maintenance and Evolution. The Program Committee will select the winner and a formal presentation of the Prize will be made in Montreal at ICSM 2002. FAST TRACK PAPERS: Fast Track papers should describe on-going research activities, or summarize the experience in software maintenance and evolution. Papers must not exceed 4 pages, IEEE style, in length, in English. Accepted fast-track papers will be included in a dedicated section of the conference proceedings. DISSERTATION FORUM: We welcome submissions of young researchers that have delivered their dissertation (Masters or Ph.D.) in the last three years. An award will be issued for the best submission. Four page summaries of accepted dissertations will be included in the conference proceedings and a special forum section will be organised at the conference. INDUSTRIAL APPLICATIONS: Proposals for presentations of Industrial Applications are welcome. These can be state-of-the-art descriptions, experience reports and survey reports from real projects, industrial practices and models, or tool demonstrations. A dedicated sub-committee of the program committee will review Industrial Application proposals and a 1-page summary of accepted proposals will be included in the conference proceedings. TUTORIALS: Tutorials should present software maintenance and evolution topics of interest to practitioners. Tutorials may be full day or half-day in length. SUBMISSION STYLE: PDF and/or Postscript electronic submission only. Papers longer than 15 pages or 6000 words will be returned to the authors. Acceptance notification will occur June 1, 2002. IMPORTANT DATES Research Papers deadline: 15 Feb. 2002 mailto:icsm2002.full@unisannio.it Fast Track Papers deadline: 1 May 2002 mailto:icsm2002.short@unisannio.it Dissertation Forum deadline: 15 Febr. 2002 mailto:icsm2002.thesis@unisannio.it Industrial Applications deadline: 15 March 2002 mailto:icsm2002.industry@unisannio.it Tutorials deadline: 15 Feb. 2002 mailto:icsm2002.tutorial@unisannio.it

1 0

class parameters to existential datatypes
by Hal Daume III 07 Dec '01

07 Dec '01

Hi, I would like to be able to write something like this: > data Foo c = forall a . c a => Foo a Unfortunately, this isn't allowed (apparently) because it's an illegal class assertion (or at least that's what ghc tells me). My motivation for doing this is I want to have something like List, but a class list where all you know is that every element is a member of some class. I would write something like: > data CList c = CNil > | forall a . (c a) => CCons a (CList c) that way I could have something like the prototypical: > class Shape a where { area :: a -> Double } > data Circle = Circle Double > data Rectangle = Rectangle Double Double > instance Shape Circle where { area (Circle r) = 2 * pi * r } > instance Shape Rectangle where { area (Rectangle l w) = l*w } > MyList :: CList Shape > MyList = CCons (Circle 5) (CCons (Rectangle 2 3) CNil) and then maybe have a function: > totalArea :: (CList Shape) -> Double > totalArea = sum . map area obviously this function declaration is also invalid. so I have two questions: 1) Is there any particular reason whey we can't do this (it would break some type safety things or whatever) 2) Any ways to get around it? Thanks! - Hal

3 2

TV Cuddle Blanket The gift everybody will want !!!
by TV Cuddle Blanket 07 Dec '01

07 Dec '01

Click the link to read the message. http://www.tvcuddleblanket.com/email//read_mail.php?c=7&u=6328

1 0

Re: Haskell Persistence
by Andre Santos 07 Dec '01

07 Dec '01

Hi, a paper describing what a student and I did is in http://www.cin.ufpe.br/~alms/ps/persiste.ps.gz . The idea was to have a class supporting the persistence operations (more in the style of serialization) and to have specific data structures to allow a quicker retrieval of the data ("Persistence Containers"). This is similar to what we have in some Object Oriented Databases. For the low level implementation we used the work on Binary I/O work of Wallace/Runciman. But in order to get more portability we reimplemented parts of it using Strings/Chars for I/O, which ended up very inneficient in Haskell. Some things that might help are: - better binary I/O and/or to interface with some low level existing persistence mechanism. - I believe a kind of reflection mechanism would make things much easier and more efficient to implement. Although automatic derivation of the instances helps. There are some other references in the paper. cheers, Andre. > | -----Original Message----- > | From: Vorin, Michael [mailto:michael.vorin@eds.com] > | Sent: 07 December 2001 03:21 > | To: haskell(a)haskell.org > | Subject: Haskell Persistence > | > | > | I am interested in pursuing practical development of > | persistence in Haskell. To this end I have been looking for > | code/systems which have been developed previously to build > | upon - not wishing to reinvent the wheel. > | > | I have found some references in the literature but have been > | enable to track down any "artefacts". > | > | I was hopping someone could help me. > | > | I have found: > | (1) Efficient Persistent Haskell, Tony Davie, Kevin Hammond, > | and Juan Quintela Division of Computer Science, University of > | St Andrews, 1998 > | > | (2) Models for Persistence in Lazy Functional Programming > | Systems, McNally, University of St Andrews, 1993. > | > | (3) A Functional Database (1989) (Correct) Phil Trinder > | > | (4) Two Models For Integrating Persistence and Lazy > | Functional Languages > | (1991) David J. McNally, Antony J.T. Davie > | > | (5) Realizing State-Based Database Concepts in a Non-Strict, > | Statically Typed, Purely Functional Persistent Programming > | Language Yoshihiko Ichikawa Department of Information > | Sciences, Ochanomizu University > | > | > | _______________________________________________ > | Haskell mailing list > | Haskell(a)haskell.org http://www.haskell.org/mailman/listinfo/haskell > | >

1 0

RTA 2002 - Call for Papers
by Pierre Lescanne 07 Dec '01

07 Dec '01

RTA 2002 - Call for Papers The 13th International Conference on Rewriting Techniques and Applications RTA'02 will take place from July 22, 2002 to July 24, 2002 in Copenhagen, Denmark, as part of the Federated Logic Conference FLoC'02. Topics RTA is the major forum for the presentation of research on all aspects of rewriting. Typical areas include (but are not limited to): * Applications: case studies; rule-based programming; symbolic and algebraic computation; theorem proving; functional and logic programming; proof checking. * Foundations: matching and unification; completion techniques; strategies; constraint solving; explicit substitutions. * Frameworks: string, term, and graph rewriting; lambda-calculus and higher-order rewriting; conditional rewriting; proof nets; constrained rewriting and deduction; categorical and infinitary rewriting. * Implementation: compilation techniques; parallel execution; rewriting tools. * Semantics: equational logic; rewriting logic. Best Paper Award A prize of 500 EUR will be given to the best paper as judged by the program committee. The program committee may decline to make the award or may split it among several papers. Submissions Submissions must be original and not submitted for publication elsewhere. Submissions should fall into one of the following categories: 1. Regular research papers describing new results; they will be judged on correctness and significance. 2. Papers describing the experience of applying rewriting techniques in other areas; they will be judged on relevance and comparison with other approaches. 3. Problem sets that provide realistic and interesting challenges in the field of rewriting. 4. System descriptions; they should contain a link to a working system and will be judged on usefulness and design. All submissions will be judged on originality. Submissions in the first three categories can be up to 15 proceedings pages long, system descriptions 4 proceedings pages. Authors are strongly encouraged to use LaTeX2e and the Springer llncs class file, available at http://www.springer.de/comp/lncs/authors.html. The title page should include the submission category. Proofs of theorems should be provided in the paper, or, if space does not permit, should be made accessible otherwise (e.g., as an appendix to the submission or via the Web). Submission is by email: Send a self-contained postscript file to <rta2002(a)lifl.fr> Proceedings Accepted papers will be published in the proceedings of the symposium (Lecture Notes in Computer Science, Springer-Verlag). Simultaneous submission to other conferences with published proceedings is not allowed. Important dates * Tue January 15, 2002 - paper submission * Fri March 22, 2002 - author notification * Thu April 25, 2002 - camera-ready papers due Program Committee * chair: Sophie Tison <Sophie.Tison(a)lifl.fr> LIFL - Laboratoire d'Informatique Fondamentale de Lille URA CNRS 369 Université de Lille 1 Cité Scientifique --- Bat. M3 59655 Villeneuve d'Ascq cedex, FRANCE +33 03 20 43 43 09 +33 03 20 43 47 24 (secretary) +33 03 20 43 45 66 (fax) * Andrea Corradini <andrea(a)di.unipi.it>, Pisa * Daniel J. Dougherty <ddougherty(a)wesleyan.edu>, Wesleyan * Jürgen Giesl <giesl(a)informatik.rwth-aachen.de>, Aachen U of Technology * Bernhard Gramlich <gramlich(a)logic.at>, Vienna U of Technology * Thérèse Hardin <Therese.Hardin(a)lip6.fr>, Paris VI * Christopher Lynch <clynch(a)clarkson.edu>, Clarkson * Jerzy Marcinkowski <jma(a)tcs.uni.wroc.pl>, Wroclaw * Aart Middeldorp <ami(a)is.tsukuba.ac.jp>, Tsukuba * Joachim Niehren <niehren(a)ps.uni-sb.de>, Saarland * Femke van Raamsdonk <femke(a)cs.vu.nl>, Vrije U of Amsterdam * Albert Rubio <albert(a)lsi.upc.es>, Technical U of Catalonia * Ralf Treinen <Ralf.Treinen(a)lri.fr>, Paris-Sud

1 0