- Haskell - Haskell.org

Haskell Workshop 2003
by Johan Jeuring 07 Apr '03

07 Apr '03

Now that the deadline for ICFP has passed, please consider submitting a paper to the Haskell Workshop 2003! ACM SIGPLAN 2003 Haskell Workshop Uppsala, Sweden, August 28, 2003 http://www.functional-programming.org/HaskellWorkshop/cfp03.html Call For Papers The Haskell Workshop forms part of the PLI 2003 colloquium on Principles, Logics, and Implementations of high-level programming languages, which comprises the ICFP and PPDP conferences as well as associated workshops. Previous Haskell Workshops have been held in La Jolla (1995), Amsterdam (1997), Paris (1999), Montreal (2000), Firenze (2001), and Pittsburgh (2002). ********************* Deadlines ********************* Deadline for submission: May 22, 2003 Notification of acceptance: June 23, 2003 Final submission due: July 3, 2003 Haskell Workshop: August 28, 2003 ********************* Topics ********************* The purpose of the Haskell Workshop is to discuss experience with Haskell, and possible future developments for the language. The scope of the workshop includes all aspects of the design, semantics, theory, application, implementation, and teaching of Haskell. Topics of interest include, but are not limited to, the following: Language Design with a focus on possible extensions and modifications of Haskell as well as critical discussions of the status quo; Theory in the form of a formal treatment of the semantics of the present language or future extensions, type systems, and foundations for program analysis and transformation; Implementation Techniques including program analysis and transformation, static and dynamic compilation for sequential, parallel, and distributed architectures, memory management as well as foreign function and component interfaces; Tool Support in the form of profilers, tracers, debuggers, pre-processors, and so forth; Applications, Practice, and Experience with Haskell for scientific and symbolic computing, database, multimedia and Web applications, and so forth as well as general experience with Haskell in education and industry; Functional Pearls being elegant, instructive examples of using Haskell. Following the scheme adopted by ICFP 2003, papers in the latter two 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! ********************* Submissions ********************* Authors should submit papers in postscript format, formatted for A4 paper, to Johan Jeuring johanj(a)cs.uu.nl by 22th May 2003. The length should be restricted to the equivalent of 5000 words (which is approximately 12 pages in ACM format). Accepted papers will be available in the form of a technical report of the Utrecht University or an equivalent format in time for the workshop. In addition, the papers will be published by the ACM and will appear in the ACM Digital Library. If there is sufficient demand, we will try to organise facilities for system demonstrations during lunch and coffee breaks. If you are interested in demonstrating an application or tool written in Haskell, please contact Johan Jeuring (johanj(a)cs.uu.nl) ********************* Programme Committee ********************* Magnus Carlsson OGI Olaf Chitil University of York Ralf Hinze University of Bonn Johan Jeuring (chair) Utrecht University Jan-Willem Maessen MIT Henrik Nilsson Yale University Simon Peyton Jones Microsoft Research Claus Reinke University of Kent

1 0

RE: newbie Q: [a] -> [[a]]
by Markus.Schnell＠infineon.com 07 Apr '03

07 Apr '03

(1) Have a look at take (2) Have a look at break and span > -----Original Message----- > From: Vardhan Varma [mailto:vardhan@cadence.com] > Sent: Monday, April 07, 2003 5:31 AM > To: haskell(a)haskell.org > Subject: newbie Q: [a] -> [[a]] > > > > Hello, > Please help me with this: > I'm absolute newbie in Haskell, > I hope I'm posting to right forum. > > (1) For "abcdefgh" -> ["ab","cd","ef"] > I figured this out: > foo (x:y:z) = ( (x:y) :(foo z)) > Now how generalize this to club 'n' chars instead of two ? > 3 -> "abcdefgh" -> ["abc","def","gh"] > i.e. n -> [Char] -> [ [Char] ] -- all except last element > have length == n > > (2) My original problem is of splitting by markers. > "a<b>cd<efg>hi" -> [ "a" , "b", "cd", "efg", "hi" ] > I'm at total loss on how to do it. > Any pointer will be appreciated. > > --TIA > --Vardhan > _______________________________________________ > Haskell mailing list > Haskell(a)haskell.org > http://www.haskell.org/mailman/listinfo/haskell >

2 1

newbie Q: [a] -> [[a]]
by Vardhan Varma 07 Apr '03

07 Apr '03

Hello, Please help me with this: I'm absolute newbie in Haskell, I hope I'm posting to right forum. (1) For "abcdefgh" -> ["ab","cd","ef"] I figured this out: foo (x:y:z) = ( (x:y) :(foo z)) Now how generalize this to club 'n' chars instead of two ? 3 -> "abcdefgh" -> ["abc","def","gh"] i.e. n -> [Char] -> [ [Char] ] -- all except last element have length == n (2) My original problem is of splitting by markers. "a<b>cd<efg>hi" -> [ "a" , "b", "cd", "efg", "hi" ] I'm at total loss on how to do it. Any pointer will be appreciated. --TIA --Vardhan

1 0

Bits Problem
by Dominic Steinitz 06 Apr '03

06 Apr '03

Can anyone explain this? Hugs doesn't complain. Prelude> :set --version The Glorious Glasgow Haskell Compilation System, version 5.04.1 test.hs:5: No instance for (Num Bool) arising from the instance declaration at test.hs:5 In the instance declaration for `Bits Bool' module Main(main) where import Bits instance Bits Bool where complement False = True complement True = False Dominic Steinitz

3 3

ANNOUNCE: lambdabot 1.0 - IRC 'bot in Haskell
by shae＠webwitches.com 03 Apr '03

03 Apr '03

Announcing the release of lambdabot 1.0 ------------------------------------ lambdabot is an IRC 'bot and plugin framework written in Haskell by Andrew Bromage, and a collection of plugins by Shae Erisson, Taylor Campbell, and Derek Elkins. http://sourceforge.net/projects/haskell-libs/ What's new in this release: - fortune plugin - factoid plugin - lambda calculator plugin - karma plugin - topic plugin - system plugin - hello and state demo plugins Requirements: - ghc 5.04 - HToolkit's postgresql bindings for the factoid plugin - fortune files for the fortune plugin -- Shae Matijs Erisson - 2 days older than RFC0226 #haskell on irc.freenode.net - We Put the Funk in Funktion 10 PRINT "HELLO" 20 GOTO 10 ; putStr $ fix ("HELLO\n"++)

1 0

ANNOUNCE: Haskell XML Toolbox Version 2.01
by Uwe Schmidt 03 Apr '03

03 Apr '03

Haskell XML Toolbox 2.01 I would like to announce a new version of the Haskell XML Toolbox for processing XML including a validating parser and a new XPath module. new features: * namespace support * xpath support * new example program for a XML-grep like program for selecting parts of a document by a XPath expression More information and download: http://www.fh-wedel.de/~si/HXmlToolbox/index.html Please email comments, bugs, etc. to hxmltoolbox(a)fh-wedel.de Uwe Schmidt <uwe(a)fh-wedel.de>

1 0

FMCO 2003: Call for Participation
by frb 03 Apr '03

03 Apr '03

(We apologize for the reception of multiple copies) ANNOUNCEMENT OF The Second International Symposium on Formal Methods for Components and Objects (FMCO 2003) DATES 4 - 7 November, 2003 PLACE Lorentz Center, Leiden University, Leiden, The Netherlands URL http://fmco.liacs.nl/fmco03.html OBJECTIVE The objective of this symposium is to bring together researchers and practioners in the areas of software engineering and formal methods to discuss the concepts of reusability and modifiability in component-based and object-oriented software systems. FORMAT The symposium is a four days event in the style of the former REX workshops,organized to provide an atmosphere that fosters collaborative work, discussions and interaction. The program consists of keynote and technical presentations, and contains an exquisite social event. Speakers' contributions will be published after the symposium in Lecture Notes in Computer Science by Springer-Verlag. KEYNOTE SPEAKERS Desmond D'Souza (Kinetium, Austin, USA) E. Allen Emerson (University of Texas at Austin, USA) Andrew D. Gordon (Microsoft Research, UK) Yuri Gurevich (Microsoft Research, USA) Tony Hoare (Microsoft Research, UK) David Parnas (University of Limerick, IE) Joseph Sifakis (Verimag, FR) TECHNICAL PRESENTATIONS Albert Benveniste (IRISA/INRIA - Rennes, FR) Frank de Boer (CWI, NL) Egon Boerger (Pisa University, IT) Werner Damm (University of Oldenburg, DE) Razvan Diaconescu (IMAR, RO) Gregor Engels (University of Paderborn, DE) Jose Luiz Fiadeiro (University of Leicester, UK) Jan Friso Groote (Eindhoven University of Technology, NL) Jean-Marc Jezequel (IRISA, Rennes, FR) Bengt Jonsson (Uppsala University, SE) Yassine Lakhnech (University of Grenoble, FR) Rob van Ommering (Philips Research Laboratories, NL) Amir Pnueli (The Weizmann Institute of Science, ISR) Willem-Paul de Roever (University of Kiel, DE) Jan Rutten (CWI, Amsterdam, NL) Philippe Schnoebelen (CNRS, Cachan, FR) Natalia Sidorova (Eindhoven University of Technology, NL) Heike Wehrheim (University of Oldenburg, DE) Jeannette Wing (Carnegie Mellon University, USA) REGISTRATION Participation is limited to about 80 people, using a first-in first-served policy. To register, please fill in the registration form at http://fmco.liacs.nl/fmco03.html. The EARLY registration fee (BEFORE September 15, 2003) is 375 euro for regular participants and 250 euro for students. It includes the participation to the symposium, a copy of the proceedings, all lunches and refreshments, and a social event (with dinner). ORGANIZING COMMITTEE F.S. de Boer (CWI and Utrecht University) M.M. Bonsangue (LIACS-Leiden University) S. Graf (Verimag) W.P. de Roever (CAU) For more information about participation and registration see the FMCO site above or consult either F.S. de Boer (frb(a)cwi.nl) or M.M. Bonsangue (marcello(a)liacs.nl)

1 0

Haskell Networking Example
by David Sankel 02 Apr '03

02 Apr '03

Hello All, Here is an example of using haskell networking operations for those interested. The implementation is a simple echo server. echoclient.hs: module Main( main ) where import Network import IO import Control.Concurrent main :: IO () main = withSocketsDo $ --For windows compatibility do handle <- connectTo "localhost" (PortNumber 2048) input <- getContents sequence_ $ map ( \a -> do hPutStr handle $ a ++ "\n" hFlush handle ) $ lines input hClose handle echoserver.hs: module Main( main ) where import Network import IO import Control.Concurrent main :: IO () main = withSocketsDo $ --For windows compatibility do theSocket <- listenOn (PortNumber 2048) sequence_ $ repeat $ acceptConnectionAndFork theSocket where acceptConnectionAndFork :: Socket -> IO () acceptConnectionAndFork theSocket = do connection <- accept theSocket let (handle, hostname, portnumber ) = connection putStr ("("++ hostname ++ ":" ++ (show portnumber) ++ "): Open\n" ) forkIO (echoServer connection) return () echoServer :: (Handle, String, PortNumber) -> IO () echoServer (handle, hostname, portnumber ) = do a <- hGetContents handle putStr $ foldr (++) "" $ map (\a -> "(" ++ hostname ++ ":" ++ (show portnumber) ++ "): Msg " ++ (show a) ++ "\n" ) $ lines a putStr ("("++ hostname ++ ":" ++ (show portnumber) ++ "): Close\n" ) Makefile: all: echoclient echoserver echoclient: echoclient.hs ghc -package network echoclient.hs -o echoclient echoserver: echoserver.hs ghc -package network echoserver.hs -o echoserver clean: rm *.o *.hi echoclient echoserver

1 0

Foclasa: 1st Call for Papers
by Jean-Marie JACQUET 02 Apr '03

02 Apr '03

====================================================================== 2nd International Workshop on Foundations of Coordination Languages and Software Architectures (Foclasa 2002) September 2, 2003, Marseille, France Workshop affiliated to CONCUR'2003, 02 - 06 September 2003. http://www.info.fundp.ac.be/~jmj/Foclasa03.html ====================================================================== SCOPE AND TOPICS Modern information systems rely more and more on combining concurrent, distributed, mobile and heterogenous components. This move from old systems, typically conceived in isolation, induces the need for new languages and software architectures. In particular, coordination languages have been proposed to cleanly separate computational aspects and communication. On the other hand, software architects face the problem of specifying and reasoning on non-functional requirements. All these issues are widely perceived as fundamental to improve software productivity, enhance maintainability, advocate modularity, promote reusability, and lead to systems more tractable and more amenable to verification and global analysis. The aim of the workshop is to bring together researchers working on the foundations of component-based computing, coordination, and software architectures. Topics of interest include (but are not limited to): o Theoretical models for coordination (component composition, concurrency, dynamic aspects of coordination, semantics, expressiveness); o Specification, refinement, and analysis of software archi- tectures (patterns and styles, verification of functional and non-functional properties); o Coordination, architectural, and interface description languages (implementation, interoperability, heterogeneity); o Agent-oriented languages (formal models for interacting agents); o Dynamic software architectures (mobile agents, configuration, reconfiguration); o Modeling of information systems (groupware, internet and the web, workflow management, CSCW and multimedia applications) o Coordination patterns (mobile computing, internet computing); o Tools and environments for the development of coordinated applications o Methodologies for validating and certifying software compositions SUBMISSION GUIDELINES Papers describing original work are solicited as contributions to Foclasa. Submitted papers should be limited to 6 000 words, preferrably formatted according to the Electronical Notes in Theoretical Computer Science. They should be emailed as PostScript (PS) or Portable Document Format (PDF) files to jmj(a)info.fundp.ac.be. PUBLICATION Following the previous edition, the proceedings will be published as a volume of the Electronical Notes in Theoretical Computer Science. Selected papers will be published in a special issue of the journal Science of Computer Programming. IMPORTANT DATES: o June 9, 2003: Submission deadline. o July 15, 2003: Notification of acceptance. o August 25, 2003: Final version. o September 6, 2003: Meeting Date. LOCATION The workshop will be held in Marseille in September 2003. It is a satellite workshop of CONCUR 2003. For venue and registration see the CONCUR web page at http://concur03.univ-mrs.fr/ WORKSHOP ORGANIZERS o Antonio Brogi (University of Pisa, Italy) o Jean-Marie Jacquet (University of Namur, Belgium) o Ernesto Pimentel (University of Malaga, Spain) PROGRAMME COMITTEE: o Farhad Arbab (CWI, The Netherlands) o Antonio Brogi (University of Pisa, Italy) - Co-chair o Manfred Broy (University of Munich, Germany) o Jeff Kramer (Imperial College, United Kingdom) o Paola Inverardi (Univerity L'Aquila, Italy) o Jean-Marie Jacquet (University of Namur, Belgium) - Co-chair o Joost Kok (University of Leiden, The Netherlands) o Ernesto Pimentel (University of Malaga, Spain) - Co-chair o Antonio Porto (New University of Lisbon, Portugal) o Catalin Roman (Washington University, USA) o Pamela Zave (AT&T Labs Research, USA)

1 0

URGENT
by Haskell Curry 01 Apr '03

01 Apr '03

URGENT ASSISTANCE WE ARE MEMBERS OF A SPECIAL COMMITTEE FOR THE DESIGN AND DEVELOPMENT OF ADVANCED PROGRAMMING LANGUAGES OF MEIJCROSOFT COORPORATION IN THE UNITED STATES. THIS COMMITTEE HAS RECENTLY COMPLETED THE IMPLEMENTATION OF A NEW FUNCTIONAL PROGRAMMING LANGUAGE THAT UNIFIES RELATIONAL, OBJECT-ORIENTED AND SEMISTRUCTURED DATA. THE EXISTANCE OF SUCH A LANGUAGE HAS BEEN KEPT SUCH A STRICT SECRET BY MEIJCROSOFT THAT EVEN GOOGLE DOES NOT KNOW ABOUT IT. WITH OUR POSITIONS, WE HAVE SUCCESSFULLY SECURED FOR OURSELVES THE SUM OF THIRTHY ONE MILLION, FIVE HUNDRED THOUSAND UNITED STATES DOLLARS (US$31.5M). THIS AMOUNT WAS CAREFULLY MANIPULATED BY OVER-INVOICING LICENSE AGREEMENTS WITH IBM, ORACLE, BEA AND SUN. SINCE THE FOUNDATIONS OF THE NEW SECRET PROGRAMMING LANGUAGE ARE BASED ON WORK THAT HAS BEEN DONE BY THE FUNCTIONAL PROGRAMMING COMMUNITY IN THE PAST, WE ARE INVITING YOU TO HELP US IN TRANSFERING THIS FUND (US$31.5M) INTO A SAFE ACCOUNT. IT HAS BEEN AGREED THAT THE OWNER OF THE ACCOUNT WILL BE COMPENSATED WITH 30% OF THE REMITTED FUNDS, WHILE WE KEEP 60% AS THE INITIATORS AND 10% WILL BE SET ASIDE TO OFFSET EXPENSES AND PAY THE NECESSARY TAXES. WE INTEND TO USE PART OF OUR OWN SHARE TO HIRE MORE FUNCTIONAL PROGRAMMERS FROM DEPARTMENT. THIS IS BECAUSE THE PRESENT DIRECTORS OF OUR COMPANY ARE EMPHASISING THE CONSTRUCTION OF THRUSTWORTHY CODE FOR ALL ITS PRODUCTS BEFORE THE NEXT RELEASE. HENCE, PURE AND LAZY FUNCTIONAL PROGRAMMERS ARE IN HIGH DEMAND OVER HERE. WE SHALL ALSO NEED YOUR ASSISTANCE IN THIS REGARD ON A COMMISSION TO BE AGREED UPON WHEN WE FINALLY MEET. ALL MODALITIES OF THIS TRANSACTION HAVE BEEN CAREFULLY WORKED OUT AND PROVED CORRECT USING IDEALIZED METAML AND ONCE STARTED WILL NOT TAKE MORE THAN SEVEN (7) WORKING DAYS, WITH YOUR FULL SUPPORT. THIS TRANSACTION IS 100% RISK FREE. MOREOVER, WE SHALL NEED THE FOLLOWING FROM YOU TO ENABLE US BEGIN THE TRANSACTION FORMALLY. THEY ARE; YOUR FULL NAME AND ADDRESS OR YOUR COMPANY NAME, ADDRESS AND HOMEPAGE, YOUR COMPUTERS NAME AND IPADDRESS, YOUR ACCOUNT PASSWORD AND NAME. THIS INFORMATION WILL BE USED ALONGSIDE OTHER VITAL DOCUMENTS OVER HERE IN PREPARING THE NECESSARY APPLICATION FOR PAYMENT TO THE CONCERNED QUARTERS WHERE PAYMENT APPROVALS WOULD BE SECURED IN FAVOUR OF YOUR COMPANY FOR THE PAYMENT OF OUR FUND(US$31.5M) INTO YOUR NOMINATED ACCOUNT FOR US ALL. BY OUR APPLICATION, IT WILL BE ASSUMED THAT THIS SUM IS BEING REQUESTED AS PAYMENT, WHICH IS LONG-OUTSTANDING, FOR A RESEARCH CONTRACT, WE SHALL CLAIM WITH OUR POSITION, YOU OR YOUR COMPANY EXECUTED FOR MEIJCROSOFT COORPERATION SOMETIME IN 1998. HENCE, WE SHALL FOLLOW ALL THE LEGAL OFFICIAL PROTOCOLS USUALLY OBSERVED BY FOREIGN CONTRACTORS WHENEVER THEY ARE DEMANDING PAYMENT FOR RESEARCH CONTRACTS EXECUTED FOR THE MY COMPANY. FURTHERMORE, IMMEDIATELY THE FINAL APPROVAL IS GRANTED, THE FUND WILL BE TRANSFERRED INTO YOUR ACCOUNT WITHIN 72 HOURS, BY WHICH TIME MY PARTNERS AND I WILL HAVE HACKED INTO YOUR MACHINES FOR THE FINAL DISBURSEMENT IN THE RATIO ALREADY SPELT OUT TO YOU. PLEASE, YOU SHOULD ENDEAVOUR TO GIVE US A MACHINE ON WHICH YOU HAVE ADMINISTRATOR PRIVILIGES. THIS IS VERY IMPORTANT BECAUSE WE WOULD NOT WANT A SITUATION WHEN WE HAVE ENTERED THE ACCOUNT, YOU NOW TELL US YOU WOULD NEED TO BE AUTHORISED BY ANOTHER PERSON BEFORE WE CAN HAVE OUR OWN SHARE. YOU WILL NOT BE REQUIRED TO TRAVEL OUT OF YOUR OFFICE, ME AND MY PARTNERS, WE ELECTRONICALLY HANDLE THE DISBURSEMENT OF THE FUND, AFTER THE FINAL TRANSACTION. WE WILL ALSO DISCUSS ABOUT THE USE OF FUNCTIONAL PROGRAMMING TO CONVERT CODE IN EXISTING LANGUAGES TO THE NEW FUNCTIONAL LANGUAGE BY MY COMPANY VIA INSTANT MESSAGING. BECAUSE WE WOULD LIKE TO ESTABLISH A JOINT BUSINESS WITH YOU. THAT IS WE WILL USE YOUR NAME TO REGISTER AND INCORPORATE A SOFTWARE TRANSLATION COMPANY IN COSTA RICA. BESIDES, ON THE COMPLETION OF THIS TRANSFER, ALL TEX FILES USED FOR THE PURPOSE WILL BE WITHDRAWN FROM THE QUARTERS THEY ARE SUBMITTED BY OUR CONTACTS IN THESE OFFICES AND DESTROYED, THEREAFTER. SO, THERE WILL NOT BE ANY PROBLEM ARISING FROM THIS TRANSACTION NOW OR IN THE FUTURE. IF THIS PROPOSAL SATISFIES YOU, PLEASE REACH US ONLY BY EMAIL FOR MORE INFORMATION. PLEASE, TREAT AS URGENT AND VERY IMPORTANT. YOURS FAITHFULLY, DR. HASKELL B. CURRY __________________________________________________ Do you Yahoo!? Yahoo! Tax Center - File online, calculators, forms, and more http://platinum.yahoo.com

3 2