- Haskell - Haskell.org

Non-exhaustive pattern in Socket.hsc
by Dominic Steinitz 29 Apr '06

29 Apr '06

I'm getting [root@tility pcap]# ./test test: Socket.hsc:(1434,17)-(1523,20): Non-exhaustive patterns in case The problem is caused because pcap_findalldevs is returning an address family value of 17 #define PF_PACKET 17 /* Packet family. */ #define AF_PACKET PF_PACKET and the ghc Family datatype doesn't support it :-( data Family = AF_UNSPEC | AF_UNIX | AF_INET | AF_INET6 | AF_SNA | AF_DECnet | AF_APPLETALK | AF_ROUTE | AF_X25 | AF_AX25 | AF_IPX -- Imported from Network.Socket *Main> map packFamily [AF_UNSPEC,AF_UNIX,AF_INET,AF_INET6,AF_SNA,AF_DECnet,AF_APPLETALK,AF_ROUTE,AF_X25,AF_AX25,AF_IPX] [0,1,2,10,22,12,5,16,9,3,4] I think I have two choices: 1. Amend ghc. I haven't built ghc for a long time. Would I have to build the whole of ghc? I presume I would have to because of dependencies. 2. Use Network.Alt since http://www.cs.helsinki.fi/u/ekarttun/network-alt/doc/Network.Alt.Types.html defines type Family = Int Any advice? What is the long term plan for Network anyway? Thanks, Dominic.

1 0

FW: TV06 (Threads Verification) Workshop - New Deadlines, Student Bursaries, ...
by Simon Marlow 28 Apr '06

28 Apr '06

Posting on behalf of Ganesh [ganesh(a)cs.utah.edu] INTERNATIONAL WORKSHOP on MULTITHREADING in HARDWARE and SOFTWARE (TV06) Sponsored by Microsoft (bursaries for 6 student papers - see URL) August 21-22, 2006, Seattle, WA (after CAV 2006; part of FLoC 2006) NEW DEADLINES: Submissions: May 15; Acceptance: June 20; Final version: July 20 INVITED SPEAKERS: Maurice Herlihy (Brown), Vijay Saraswat (IBM T.J. Watson Res. Ctr.), Nir Shavit (Sun) URL : http://www.cs.utah.edu/tv06/ (info on submissions, bursaries) TOPICS: * Analysis, testing, and verification techniques for concurrent systems * Experience building reliable and high-performance multithreaded systems * Verification case studies and experience reports * Language design and formal semantics pertaining to threading * Logics and models of concurrency, including transaction memories * Model checking (dealing with library calls, weak consistency models, etc.) * Shared memory consistency models (language, hardware, library levels) * Runtime verification for multithreaded programs and systems * Threading based solutions (hardware/software) in multi-core systems and chips * Designing formally well-specified high-performance thread libraries * Understanding threading issues in specific areas such as high-performance computing (e.g., OpenMP), general purpose libraries (e.g., PThreads), and languages (e.g., C#, Java) PROGRAM COMMITTEE: Arvind, MIT CSAIL Hans Boehm, HP Ching Tsun Chou, Intel Byron Cook, Microsoft Research Cambridge Robert P. Cook, Georgia Southern University Cormac Flanagan, UC Santa Cruz Robert M. Kirby, University of Utah Timothy G. Mattson, Intel Shaz Qadeer, Microsoft Research John Regehr, University of Utah Scott Stoller, SUNY at Stony Brook Yue Yang, Microsoft CONTACT INFO: http://www.cs.utah.edu/tv06/ -- tv06(a)cs.utah.edu ORGANIZERS: Ganesh Gopalakrishnan (Univ of Utah) and John O'Leary (Intel) --

1 0

(2nd CFP) Workshop on Logic-based Methods in Programming Environments
by Wim Vanhoof 27 Apr '06

27 Apr '06

[Apologies for multiple postings] ----------------------------------------------------------- WLPE' 06 - 2nd CALL FOR PAPERS Workshop on Logic-based Methods in Programming Environments (satellite workshop of ICLP’06) August 16, 2006 Seattle (Washington), USA http://lml.ls.fi.upm.es/~susana/Conferences/WLPE06/ ----------------------------------------------------------- Aim and Scope ------------- The 16th Workshop on Logic-based methods in Programming Environments will take place in Seattle (Washington), USA, as a satellite workshop of ICLP'06, the 22th International Conference on Logic Programming. This workshop will continue the series of successful international workshops on logic programming environments held in Ohio, USA (1989), Eilat, Israel (1990), Paris, France (1991), Washington, USA (1992), Vancouver, Canada (1993), Santa Margherita Ligure, Italy (1994), Portland, USA (1995), Leuven, Belgium and Port Jefferson, USA (1997), Las Cruces, USA (1999), Paphos, Cyprus (2001), Copenhagen, Denmark (2002), Mumbai, India (2003), Saint Malo, France (2004) and Sitges, Spain (2005). The workshop aims at providing an informal meeting for the researchers working on logic-based tools for development and analysis of programs. This year we want to emphasize two aspects: on one hand we want to discuss the presentation, pragmatics and experiences of such tools; on the other one, we want to shift the traditional focus on environment tools for logic programming to logic-based environmental tools for programming in general. Specific topic areas relevant to the workshop include, but are not limited to: * tools for debugging and testing * tools for static and dynamic analysis * systems for program verification and validation * code generation from specifications * termination and non-termination analyzers * reasoners on occurs-check freeness and determinacy * profilers and performance analyzers * systems for types and modes analyzes * module systems * optimization tools. In addition to papers describing more conceptual work on environmental tools, we solicit papers describing the implementation of and experimentation with such tools. Submission guidelines --------------------- Length of papers can range from 2 to 17 pages, preferably in LNCS format. Authors are requested to submit their paper using the submission webpage at http://vampire.cs.man.ac.uk/WLPE-06/ Alternatively, authors can send a copy of their paper (in pdf or ps format) to the workshop coordinator (wva(a)info.fundp.ac.be) An informal proceedings will be published as a technical report of the University of Namur and distributed at the workshop. After the workshop, the proceedings will be publicly available on-line in the Computing Research Repository (CoRR). Important dates --------------- Submission: May 15, 2006 Notification: June 15, 2006 Camera-ready: July 10, 2006 Workshop: August 16, 2006 Workshop organizers ------------------- Susana Muñoz-Hernández (Universidad Politécnica de Madrid, Spain) Wim Vanhoof (coordinator) (Univeristy of Namur, Belgium) Program Committee ----------------- María Alpuente (Universidad Politécnica de Valencia, Spain) Mireille Ducassé (INSA/IRISA, Rennes, France) John Gallager (Roskilde University, Denmark) María García de la Banda (Monash University, Australia) José Manuel Gómez-Pérez (ISOCO Madrid, Spain) Gopal Gupta (University of Texas at Dallas, U.S.A) Moreno Falaschi (Università di Udine, Italy) Pat Hill (University of Leeds, U.K.) Michael Leuschel (Heinrich-Heine-Universitat Düsseldorf, Germany) Fred Mesnard (Université de La Réunion, France) Susana Muñoz-Hernández (Universidad Politécnica de Madrid, Spain) Kostis Sagonas (Uppsala University, Sweden) Alexander Serebrenik (Technische Universiteit Eindhoven, The Netherlands) Zoltan Somogyi (University of Melbourne, Australia) Wim Vanhoof (University of Namur, Belgium)

1 0

GPCE 2006 Deadline Extension
by Emir Pasalic 26 Apr '06

26 Apr '06

Apologies for repeated posts. The GPCE 2006 deadline for technical paper submission has been extended to May 14. GPCE provides a venue for researchers and practitioners interested in foundational techniques for enhancing the productivity, quality and time-to-marked in software development that stems from deploying standard componentry and automating program generation. In addition to exploring cutting-edge techniques for developing generative component-based software, our goal is to foster further cross- fertilization between software engineering research community and the programming languages community. Changes: - There will be no pre-submission - Submission deadline: May 14, 2006, 23:59 Apia time (previously May 5) - Notification: June 28, 2005 For more information, check: http://www.program-transformation.org/GPCE06/

1 0

[ANN] Hazakura - search-based MUA written in Haskell
by Jun Mukai 26 Apr '06

26 Apr '06

Dear all, I am pleased to announce the first release of hazakura, a search-based mail client. web page (to build): http://www.city5.org/hazakura/ source code: http://www.city5.org/haskellprog/hazakura/ You can get the source code using darcs as follows. darcs get http://www.city5.org/haskellprog/hazakura/ Although hazakura is written in Haskell, it uses Hyper Estraier as the search-engine, and QDBM as storage. So, you must install these libraries and their bindings. QDBM: http://qdbm.sourceforge.net/ binding: http://www.city5.org/haskellprog/qdbm/ Hyper Estraier: http://hyperestraier.sourceforge.net/ binding: http://www.city5.org/haskellprog/hstraier/ And also, you must install the following libraries: * wxWidgets and wxHaskell * Crypto The current status of hazakura is experimental. It lacks many fundamental functionalities and will have many bugs. But, it works (i.e. it can send, receive, search, and display mails). Any comments are welcome. Thanks, -- Jun Mukai mukai(a)jmuk.org

1 0

speed of Binary serialization libraries
by Bulat Ziganshin 26 Apr '06

26 Apr '06

Hello haskell, i have performed a small test of serialization libraries speed, more to compare GHC's solution with my own. Tests was runned on 1GHz Duron. Each test reads or writes 100 mb of data splitted to 10 kb chunks - arrays or lists. Results are: GHC Binary (memory): Writing UArray: 21.652 secs Reading UArray: 17.064 secs Writing list: 21.231 secs Reading list: 22.562 secs GHC Binary (file): Writing UArray: 198.835 secs Reading UArray: 99.463 secs Writing list: 195.812 secs Reading list: 129.707 secs Other reincarnations of this module (jhc Binary, NewBinary) are slightly slower. Results of my own lib: AltBinary (memory, without bounds checking): Writing UArray: 1.933 secs Reading UArray: 1.683 secs Writing list: 1.832 secs Reading list: 2.744 secs AltBinary (memory): Writing UArray: 4.847 secs Reading UArray: 6.930 secs Writing list: 4.246 secs Reading list: 8.232 secs AltBinary (file): Writing UArray: 12.368 secs Reading UArray: 8.312 secs Writing list: 9.814 secs Reading list: 9.744 secs Testbed is included. -- Best regards, Bulat mailto:Bulat.Ziganshin@gmail.com

1 0

The 2006 GHC Hackathon
by Simon Marlow 26 Apr '06

26 Apr '06

Dearest GHC hackers, We're considering the possibility of organising a GHC Hackathon around ICFP this year. This wiki page has tentative details, and you can indicate whether you'd be interested in coming, and give us your suggestions: http://hackage.haskell.org/trac/ghc/wiki/Hackathon Cheers, Simon

1 0

Haskell.org and Google Summer of Code 2006
by Paolo Martini 25 Apr '06

25 Apr '06

Hello, It is now official. Haskell.org is a mentoring organization for this year's Summer of Code programme. You can see it listed on the official site <http://code.google.com/soc/> clicking on `Haskell.org (ideas)' you'll be directed to the trac site we are setting up. (It's 4 AM and I've just finished adding the projects, and cleaning things up a bit.) I am _very_ happy about seeing this project working out for real. I fear that I wouldn't be able to reach everybody even mailing all the important mailing list; I hope many students will be able to take advantage of this great occasion. Help me spread the word, tell everybody about the project :-) You can find the new site here <http://hackage.haskell.org/trac/summer-of-code/>, the StartPage will be updated with details during the program. Projects ideas and volunteers for mentoring are still very much welcome! students' application period starts on May 1. Thanks very much for the support, hope to hear thoughts and proposals, Paolo. --

1 0

parallel seq
by Scherrer, Chad 25 Apr '06

25 Apr '06

I was thinking about the dynamic behavior of par, and there's something that's a little confusing to me. Am I right in understanding that (x `par` y) evaluates to y, and may or may not evaluate x along the way? I think it would be easier to reason about if we knew that x would be evaluated, either by a newly-spawned thread or by the parent thread. If I'm understanding this correctly, this could be done by defining x `pSeq` y = x `par` y `seq` x `seq` y (seq has higher precedence than par) When (x `pSeq` y) is evaluated, x may or may not be evaluated by a new thread. The parent thread continues along evaluating y. Then the parent makes sure x was evaluated before finally returning y. I've not seen this approach used before -- Is there something I'm missing that makes using pSeq as above just silly? Thanks! Chad Scherrer Computational Mathematics Group Pacific Northwest National Laboratory "Time flies like an arrow; fruit flies like a banana." -- Groucho Marx

1 0

wxHaskell with active GHCI input loop?
by Simon Guest 25 Apr '06

25 Apr '06

Hello Haskell Hackers, I am trying to create a wxHaskell program which, while the GUI is active, enables the user to type arbitrary haskell program fragments to interact with the GUI. Initially I thought I would run the wxHaskell main loop in a different thread, and interact via the GHCI main loop, but I see that multiple threads are not supported by wxHaskell. I am wondering if hs-plugins is the way to go, arranging for string input to be taken in the GUI, and passed to the hs-plugins eval function. However I want the interactive Haskell to be able to manipulate objects displayed on the GUI, and am not sure if this can be done with such a subservient hs-plugins evaluator? Any suggestions? cheers, Simon

1 0