- Haskell - Haskell.org

combine wav channels with haskell
by Andr�s Zsolt Grigore 03 May '04

03 May '04

hi I tried to write a program in Haskell which combine two separate wav channel in one. But i cannot read the informations from the source files correctly. i u know a useable algorithm for this method. pls share it with me. Thx GAZ _________________________________________________________________ Add photos to your messages with MSN 8. Get 2 months FREE*. http://join.msn.com/?page=features/featuredemail

1 0

Re: [Haskell-cafe] Call for recommendation
by Don Groves 02 May '04

02 May '04

On Sat, 1 May 2004 20:52:45 +0800 (CST), 无云 <mhfan(a)163.com> wrote: > Hi, all > > I'm a newbie to Haskell and FP now, I need your help. > Could anybody give me any advice on how to learn and master the Haskell language and thinking/programming in FP? I especially expect a list of some excellent books on Haskell. > > M.H.Fan > 05/01/04 I am also new to Haskell and I found many good suggestions for learning haskell at www.haskell.org -- dg

2 1

ESSLLI 2004 - Deadline Extension
by Carlos Areces 01 May '04

01 May '04

======================================================================= ESSLLI 2004 ESSLLI 2004 ESSLLI 2004 ESSLLI 2004 ESSLLI 2004 ESSLLI 2004 Early Registration Extension ESSLLI 2004 Nancy, France 9-20 August, 2004 ======================================================================= We are pleased to announce a one week extension of the early registration date till ******** 7 May 2004 ******** That is, all registrations received before this date will still qualify for the lower price. To register go to: http://esslli2004.loria.fr click on the registration button, fill out the online form, print out the result, and fax (or surface-mail) it in. As well as registering, you can use the same form to reserve student accommodation and book lunch tickets (the lunch menu is available on the ESSLLI 2004 website). Note that the website has been changed to allow you to track the progress of your registration. To check the status of your registration, simple go the the ESSLLI 2004 website and click on List of Participants. Looking forward to seeing you in Nancy this August! Carlos Areces, Patrick Blackburn (for the Organising committee) Helene Kirchner (Director of Loria) ======================================================================= ESSLLI 2004 ESSLLI 2004 ESSLLI 2004 ESSLLI 2004 ESSLLI 2004 ESSLLI 2004 =======================================================================

1 0

return?
by Ben_Yu＠asc.aon.com 30 Apr '04

30 Apr '04

Hi, While writing monad programs, I sometimes want to do a return as it is in imperative program. i.e., do{return 1; return 2} is same as return 1 This seems useful to me when I need to do something like do mwhen cond $ return 1 ...... -- subsequent actions I know I can do if cond then return 1 else ( ...--subsequent actions ) However, that syntax does not look very pleasant to me due to this extra indentation and the pair of parens. Is this possible at all? Ben.

5 4

Re: [Haskell] return?
by Graham Klyne 30 Apr '04

30 Apr '04

>Is this possible at all? I don't think so, in the form that you suggest. Ultimately, it all comes down to function applications, for which there is no such "bail out". Rather, I think something like this is required: do { ... ; if cond then return 1 else do (the rest) } Here's an example from some real (tested) code: [[ -- Open and read file, returning its handle and content, or Nothing -- WARNING: the handle must not be closed until input is fully evaluated repOpenFile :: String -> RepStateIO (Maybe (Handle,String)) repOpenFile fnam = do { (hnd,hop) <- lift $ if null fnam then return (stdin,True) else do { o <- try (openFile fnam ReadMode) ; case o of Left e -> return (stdin,False) Right h -> return (h,True) } ; hrd <- lift $ hIsReadable hnd ; res <- if hop && hrd then do { ; fc <- lift $ hGetContents hnd ; return $ Just (hnd,fc) } else do { lift $ hClose hnd ; repError ("Cannot read file: "++fnam) 3 ; return Nothing } ; return res } ]] #g -- >Hi, >While writing monad programs, I sometimes want to do a return as it is in >imperative program. i.e., >do{return 1; return 2} is same as return 1 > >This seems useful to me when I need to do something like >do > mwhen cond $ return 1 > ...... -- subsequent actions > > >I know I can do >if cond then return 1 else ( > ...--subsequent actions > ) > > > However, that syntax does not look very pleasant to me due to this extra >indentation and the pair of parens. > > >Is this possible at all? > >Ben. > >_______________________________________________ >Haskell mailing list >Haskell(a)haskell.org >http://www.haskell.org/mailman/listinfo/haskell ------------ Graham Klyne For email: http://www.ninebynine.org/#Contact

3 4

how to print the Report in CM fonts?
by Boyko Bantchev 30 Apr '04

30 Apr '04

Hello all, The Haskell98 Report, in its printed form, uses Times and Courier fonts. I would like to have the Report printed in the TeX-standard cm family of fonts (including the tt font which I like much more than Courier as a `computer font'). Some time ago, I tried to do this from the sources in the CVS repository but failed. Could someone please explain how to achieve this, i.e. what changes should be applied to the files before tex-ing? And what is the set of files needed for a current version? Thank you. Best regards, Boyko Bantchev ----------------------------- КРАДЕЦ НА ЖИВОТИ Психологически трилър, в който Анджелина Джоли е ФБР агентката в преследване на престъпник-маниак http://movies.mail.bg/takinglives/

1 0

APLAS'04: Second Call For Papers
by QIN Shengchao 30 Apr '04

30 Apr '04

CALL FOR PAPERS The Second ASIAN Symposium on Programming Languages and Systems (APLAS 2004) Taipei, Taiwan, November 4-6 2004 http://www.comp.nus.edu.sg/~aplas (co-located with ATVA 2004 in Taipei) [Apologies if you received multiple copies] 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 is 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. The first formal APLAS symposium was successfully held in Beijing in November 2003, after three informal workshops held in Singapore (2000), Daejeon (2001), and Shanghai (2002). TOPICS The symposium is devoted to both foundational and practical issues in programming languages and systems. Papers are solicited on, but not limited, to the following topics: * semantics and theoretical foundations * type systems and language design * language interpreters and compilers * program analysis, optimization and transformation * models and tools for parallel and distributed systems * language support for security and safety * domain-specific languages and systems * storage management techniques * software development methods and systems * techniques for embedded and mobile code * process algebra and concurrency Original results that bear on these and related topics are solicited. Papers investigating novel uses and applications of language systems are especially encouraged. Authors concerned about the appropriateness of a topic are welcome to consult with the program chair (chinwn(a)comp.nus.edu.sg) prior to submission. GENERAL CHAIR D. T. Lee (Academia Sinica, Taiwan) PROGRAM CHAIR Wei-Ngan Chin (National Univ. of Singapore) PROGRAM COMMITTEE Jifeng He (United Nations Univ, Macau) Thomas Henzinger (Univ. of California, Berkeley, USA) Yuh-Jzer Joung (National Taiwan Univ, Taiwan) Gabriele Keller (Univ. of New South Wales, Australia) Jenq Kuen Lee (National Tsinghua Univ, Taiwan) Luc Maranget (INRIA, France) Hidehiko Masuhara (Univ. of Tokyo, Japan) Luke Ong (Univ. of Oxford, UK) Tamiya Onodera (IBM Research, Japan) Zongyan Qiu (Peking Univ., China) Martin Rinard (MIT, USA) David Sands (Chalmers Univ. of Tech., Sweden) Akihiko Takano (Natl. Inst. of Informatics, Japan) Kazunori Ueda (Waseda Univ., Japan) Chengyong Wu (Chinese Academy of Sc., China) Hongwei Xi (Boston Univ., USA) Kwangkeun Yi (Seoul National Univ., Korea) LOCAL ARRANGEMENT Tyng-Ruey Chuang (Academia Sinica, Taiwan) PUBLICITY Shengchao Qin (National Univ. of Singapore) SUBMISSIONS INFORMATION Papers should be submitted electronically online via the conference submission webpage. Acceptable formats are PostScript or PDF, viewable by gv. Submissions should not exceed 15 pages in LNCS format, excluding bibliography and figures. Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should clearly identify what has been accomplished and why it is significant. The work described should not have been previously published in a journal and conference proceedings. Authors must indicate if a closely related paper is also being considered for another conference or journal. The proceedings of the symposium will be published by Springer-Verlag's Lecture Notes in Computer Science series. IMPORTANT DATES Abstract & Title: May 29, 2004 Full Paper Submissions: June 5, 2004 Notifications of Acceptance: July 31, 2004 Camera Ready: August 25, 2004

1 0

RE: [Haskell] Re: sizeFM type
by Simon Marlow 28 Apr '04

28 Apr '04

On 26 April 2004 19:45, Don Groves wrote: > Hello, Haskell newbie here. > > Some languages handle the Int/Integer question automatically, > determined by the size of the integer in question. Int is used > until the integer excedes what the underlying architecture can > handle, then the switch is made to Integer (bignum). Is this > something that could be handled similarly by the Haskell compiler > without violating anything? Just thinking out loud... This is exactly how GHC implements Integer, FWIW. Cheers, Simon

1 0

CoLoPS04: Call for Papers
by Frank D. Valencia 28 Apr '04

28 Apr '04

[[ -- Apologies for multiple copies of this message -- ]] =================================================================== CoLoPS 2004 International Workshop on COnstraint & LOgic Programming in Security December 5-11th, 2004 - Saint-Malo, France Satellite Workshop to ICLP 2004 ==================================================================== Scope of the workshop: Due to its practical relevance and complexity, the study of security has become a serious challenge involving several disciplines of computer science. A noteworthy aspect is that in several instances this study has used directly or indirectly tools and techniques from (Concurrent) Constraint Programming and (Linear) Logic Programming. For example, constraint solving has successfully been used for verifying security protocols, and several process algebras for modelling cryptographic protocols (e.g., recent variants of the spi calculus, SPL) have remarkable similarities with Concurrent Constraint Programming. Also (Linear) Logic Programming has been used as a framework for security protocols, and one of its central notions, unification, has been used for the symbolic execution of cryptographic calculi. CoLoPS aims at getting a broader perspective on the role of Constraint and Logic Programming in the study of security. Topics of interest include (but are not restricted to) frameworks for security using algorithms, verification techniques, process algebras or programming languages, with a Constraint or Logic Programming flavor. Submission and publication: Paper submissions should not exceed 15 pages. Submissions should be sent as a PDF or Postscript le via email to Frank D. Valencia (frankv(a)it.uu.se) The email should have: 1. "COLOPS Submission" as subject, 2. submission title and authors' relevant information as body, and 3. submission le as an attachment. The accepted papers will be included in the workshop proceedings as a research report of Uppsala University. Accepted papers will be published in an ENTCS (Electronic Notes in Theoretical Computer Science) volume dedicated to ICLP 2004 workshops. Papers describing ongoing work or already published are also welcome but will not be part of the proceedings. Please mark your paper accordingly. Program Committee: Elvira Albert (UC Madrid, Spain) Maria Alpulente (UP Valencia, Spain) Stefano Bistarelli (ITT-CNR, Italy) Martin Leucker (TU Munich, Germany) Sebastian Moedersheim (ETH Zurich, Switzerland) Ugo Montanari (Universita di Pisa, Italy) Catuscia Palamidessi (INRIA, France) Justin Pearson (Uppsala University, Sweden) Fred Spiessens (Universit e catholique de Louvain, Belgium) Frank D. Valencia (Uppsala University, Sweden) Pascal Van Hentenryck (Brown University, USA) Vijay Saraswat (IBM, USA) Bjorn Victor (Uppsala University, Sweden) Alicia Villanueva (UP Valencia, Spain) Organizing Committee: Martin Leucker (TU Munich, Germany), Justin Pearson (Uppsala University, Sweden), Fred Spiessens (Universit e catholique de Louvain, Belgium), Frank D. Valencia (Uppsala University, Sweden) Important dates: Submission deadline: June 27, 2004 Notification of acceptance: July 18, 2004 Final version: August 15, 2004 Workshop: September 5th or 11th, 2004 (Dependent on ICLP organizers) For more and up-to-date information see the www page http://www.info.ucl.ac.be/people/fsp/colops2004/

1 0

2004 ICFP Programming Contest Announcement
by Nate Foster 27 Apr '04

27 Apr '04

The Seventh Annual ICFP PROGRAMMING CONTEST 4 June - 7 June 2004 http://icfpcontest.org/ Convinced your favorite programming language provides unbeatable productivity? Convinced you and your friends are world-class programmers? If so, we're providing you the opportunity to prove it! We are pleased to announce the Seventh ICFP Programming Contest to be held in conjunction with the 2004 International Conference on Functional Programming (ICFP 2004). All programmers are invited to enter the contest, either individually or in teams; we especially encourage students to enter. You may use any programming language (or combination of languages) to show your skill. On Friday, 4 June 2004 at 12:00 Noon (EDT), we will publish a challenge task on the Web site and by e-mail to the contest mailing list. Teams will have 72 hours until Monday, 7 June 2004, 12:00 Noon (EDT) to implement a program to perform this task and submit it to the contest judges. We have designed the contest for direct, head-to-head comparison of language technology and programming skill. We have a range of prizes including cash awards and, of course, unlimited bragging rights for the winners. For more information about the contest, prizes, and registration, point your browser to the contest website. - 2004 ICFP Contest Team http://icfpcontest.org/

1 0