- Haskell - Haskell.org

Call for Papers: The International Joint Conferences on Computer, Information and Systems Sciences and Engineering (CISSE 05)
by cisse＠cisse2005.org 16 Sep '05

16 Sep '05

Dear Colleagues, You are invited to submit your work to the following international e-conference. Looking forward to receiving your submissions. Please note: (1) If you wish to unsubscribe from this e-mail list, please visit: http://cisse2005.org/unsubscribe.aspx (2) If you need more information about CISSE 2005, please visit: http://www.cisse2005.org and/or e-mail - info(a)cisse2005.org (3) If this is Call for Papers is outside the scope of work of your department, we would appreciate it if you can forward the Call for Papers to the appropriate department in your institution. Best Regards, ---------------------------------- Tarek M. Sobh, Ph.D., P.E., CMfgE Dean, School of Engineering University of Bridgeport 221 University Avenue Bridgeport, CT 06604, U.S.A. ---------------------------------- ====================================== International Joint Conferences on Computer, Information, and Systems Sciences, and Engineering (CISSE 05) http://www.cisse2005.org December 10-20, 2005 Sponsored by: Institute of Electrical & Electronics Engineers (IEEE) University of Bridgeport --------------------------------------------------------------------- CONFERENCE OVERVIEW --------------------------------------------------------------------- CISSE 05 provides a virtual forum for presentation and discussion of the state-of the-art research on computers, information and systems sciences and engineering. The virtual conference will be conducted through the Internet using web-conferencing tools, made available by the conference. Authors will be presenting their PowerPoint, audio or video presentations using web-conferencing tools without the need for travel. Conference sessions will be broadcast to all the conference participants, where session participants can interact with the presenter during the presentation and (or) during the Q&A slot that follows the presentation. This international conference will be held entirely on-line. The accepted and presented papers will be made available after the conference both on a CD and as a book publication. Conference participants - authors, presenters and attendees - only need an internet connection and sound available on their computers in order to be able to contribute and participate in this international ground-breaking conference. The on-line structure of this high-quality event will allow academic professionals and industry participants to contribute work and attend world-class technical presentations based on rigorously refereed submissions, live, without the need for investing significant travel funds or time out of the office. Potential non-author conference attendees who cannot make the on-line conference dates are encouraged to register, as the entire joint conferences will be archived for future viewing. CISSE 05 is composed of the following four conferences: (1) International Conference on Industrial Electronics, Technology & Automation (IETA 05) Topics: Advanced and Distributed Control Systems, Intelligent Control Systems (NN, FL, GA, .etc), Expert Systems, Man Machine Interaction, Data Fusion, Factory Automation, Robotics, Motion Control, Machine Vision, MEMS Sensors and Actuators, Sensors Fusion, Power Electronics, High Frequency Converters, Motors and Drives, Power Converters, Power Devices and Components, Electric Vehicles and Intelligent Transportation, Process Automation, Factory Communication, Manufacturing Information System Advances in Manufacturing Systems, Industrial Applications of MultiMedia, Intelligent Systems Instrumentation, Industrial Instrumentation, Modeling and Simulation, Signal Processing, Image and Data Processing, VR and Parallel systems. Conference Page: http://www.cisse2005.org/ieta.aspx (2) International Conference on Telecommunications and Networking (TeNe05) Topics: Optical Networks and Switching, Computer Networks, Network architectures and Equipment, Access Technologies, Telecommunication Technology, Coding and Modulation technique, Modeling and Simulation, Spread Spectrum and CDMA Systems, OFDM technology, Space-time Coding, Ultra Wideband Communications, Medium Access Control, Spread Spectrum, Wireless LAN: IEEE 802.11, HIPERLAN, Bluetooth, Cellular Wireless Networks, Cordless Systems and Wireless Local Loop, Mobile Network Layer, Mobile Transport Layer, Support for Mobility, Conventional Encryption and Message Confidentiality, Block Ciphers Design Principles, Block Ciphers Modes of Operation, Public-Key Cryptography and Message Authentication, Authentication Application, Stenography, Electronic Mail Security, Web Security, IP Security, Firewalls, Computer Forensics. Conference Page: http://www.cisse2005.org/tene.aspx (3) International Conference on Systems, Computing Sciences and Software Engineering (SCSS 05) Topics: Grid Computing, Internet-based Computing Models, Resource Discovery, Programming Models and tools, e-Science and Virtual Instrumentation, Biometric Authentication, Computers for People of Special Needs, Human Computer Interaction, Information and Knowledge Engineering, Algorithms, Parallel and Distributed processing, Modeling and Simulation, Services and Applications, Embedded Systems and Applications, Databases, Programming Languages, Signal Processing Theory and Methods, Signal Processing for Communication, Signal Processing Architectures and Implementation, Information Processing, Geographical Information Systems, Object Based Software Engineering, Parallel and Distributed Computing, Real Time Systems Multiprocessing, File Systems and I/O, Kernel and OS Structures. Conference Page: http://www.cisse2005.org/scss.aspx (4) International Conference on Engineering Education, Instructional Technology, Assessment, and E-learning (EIAE 05) Topics: Instructional Design, Accreditation, Curriculum Design, Educational Tools, 2-2-2 Platforms, Teaching Capstone Design, Teaching Design at the Lower Levels, Design and Development of e-Learning tools, Assessment Methods in Engineering, Development and Implementation of E-learning tools, Economical and Social Impacts of E-learning, Platforms and Systems for K-12 / Industry and Higher Education Cooperation. Conference Page: http://www.cisse2005.org/eiae.aspx --------------------------------------------------------------------- PAPER SUBMISSION --------------------------------------------------------------------- Prospective authors are invited to submit full papers electronically in Microsoft Word or PDF format through the website of each conference at http://www.cisse2005.org Accepted papers must be presented in the virtual conference by one of the authors. To submit your paper, visit http://www.cisse2005.org/author/submit.aspx or visit the individual conference pages. --------------------------------------------------------------------- IMPORTANT DATES --------------------------------------------------------------------- Paper submission: September 30, 2005 Notification of Acceptance: October 28, 2005 Final Manuscript and Registration: November 18, 2005

1 0

RE: [Haskell] Realistic max size of GHC heap
by Simon Marlow 16 Sep '05

16 Sep '05

On 15 September 2005 01:04, Karl Grapone wrote: > I'm considering using haskell for a system that could, potentially, > need 5GB-10GB of live data. > My intention is to use GHC on Opteron boxes which will give me a max > of 16GB-32GB of real ram. I gather that GHC is close to being ported > to amd64. > > Is it a realistic goal to operate with a heap size this large in GHC? > The great majority of this data will be very long tenured, so I'm > hoping that it'll be possible to configure the GC to not need to much > peak memory during the collection phase. It'll be a good stress test for the GC, at least. There are no reasons in principle why you can't have a heap this big, but major collections are going to take a long time. It sounds like in your case most of this data is effectively static, so in fact a major collection will be of little use. Generational collection tries to deal with this in an adaptive way: long-lived data gets traversed less and less often as the program runs, as long as you have enough generations. But if the programmer really knows that a large chunk of data is going to be live for a long time, it would be interesting to see whether this information could be fed back in a way that the GC can take advantage of it. I'm sure there must be existing techniques for this sort of thing. Cheers, Simon

4 3

RE: [Haskell] Realistic max size of GHC heap
by Simon Marlow 15 Sep '05

15 Sep '05

On 15 September 2005 14:48, S. Alexander Jacobson wrote: > Should one interpret this as GHC now targets 64-bit systems or does > one need to employ some sort of clevernesss to use this much memory? > (I posted this question a while ago and was told that GHC did not at > that time support 64-bit so could not use that much memory) GHC has supported 64 bit systems for quite some time, eg. we have had Alpha support for many years. Recently we've added amd64 support, which will be fully supported in the upcoming 6.4.1 release. Perhaps you're thinking of nhc98 - if I recall correctly it isn't ported to 64 bit yet. > On a related note, does GHC now distribute IO threads over multiple > CPUs or is it still a 1 CPU system? GHC has distributed IO threads over multiple CPUs for quite some time :-) You need to use the -threaded option when compiling your program. Cheers, Simon

1 0

how to cite the (revised) Haskell Report
by Wolfgang Jeltsch 15 Sep '05

15 Sep '05

Hello, how should one cite the revised Haskell Report? As "Journal of Functional Programming 13(1)" or "Haskell 98 Language and Libraries, The Revised Report"? Who should be mentioned as the editor? According to http://www.cambridge.org/uk/journals/JFP/, Paul Hudak is the editor of the Journal of Functional Programming but Simon Peyton Jones is the editor of the revised Haskell Report. Would someone be able to post a sample BibTeX entry? That would be nice. Best wishes, Wolfgang

3 8

Call For Participation APLAS'05
by Kwangkeun Yi 15 Sep '05

15 Sep '05

Apologies for multiple copies. -- CALL FOR PARTICIPATION The 3rd Asian Symposium on Programming Languages and Systems (APLAS 2005) November 3-5, 2005 Tsukuba, Japan http://ropas.snu.ac.kr/aplas05 Early Registration Ends on October 14, 2005 ------------------------------------------- VENUE -- Building: Advanced Research Laboratory B Room number 110 (Main Lecture Hall) University of Tsukuba, Japan REGISTRATION FEE -- Early Online registration (Until Oct.14) 18000 JPY (students) 25000 JPY (others) Normal online registration (Until Oct. 27) & on-site registration (Nov.2-4) 20000 JPY (students) 30000 JPY (others) HIGHLIGHTS -- . 2.5-day Technical Program . Three invited talks by . Patrick Cousot . Haruo Hosoya . Thomas Reps . 24 Contributed Papers . .5-day Tutorial . One Poster Session . Proceedings as LNCS 3780 of Springer . Excursion at Kagami Crystal (Japanese beaux-arts) and Asahi Beer brewery (cutting-edge research on beer) . Banquet Dinner at Sansui Tei (traditional Japanese cuisine) . Early Registration: Oct. 14 Please visit the conference Web site for details: http://ropas.snu.ac.kr/aplas05 POSTERS -- For poster submission, please visit: ropas.snu.ac.kr/aplas05/openconf PROGRAM -- DAY 0: November 2, 2005 13:00-17:30 Tutorials * 13:00-15:00 Type Classes with Associated Types Manuel M.T. Chakravarty * 15:30-17:30 Type Systems for Object-Oriented Languages Atsushi Igarashi 18:00-20:00 Reception in Advanced Research Laboratory B building DAY I: November 3, 2005 09:00-10:00 Invited Talk * Type Systems for XML Haruo Hosoya 10:30-12:30 Session 1 * The Essence of Dataflow Programing Tarmo Uustalu, Varmo Vene * Data Refinement with Low-level Pointer Operations Ivana Mijajlovic, Hongseok Yang * A Simple Semantics for Polymorphic Recursion William Harrison * Symbolic Execution with Separation Logic Josh Berdine, Cristiano Calcagno, Peter O'Hearn 14:00-16:00 Session 2 * An Abstract Interpretation Perspective on Linear vs. Branching Time Francesco Ranzato, Francesco Tapparo * The Parallel Implementation of the Astree Static Analyzer David Monniaux * Using Datalog with Binary Decision Diagrams for Program Analysis John Whaley, Dzintars Avots, Michael Carbin, Monica Lam * Loop invariants on demand K. Rustan M. Leino, Francesco Logozzo 16:00-17:30 Poster Session DAY II: November 4, 2005 09:00-10:00 Invited Talk Integrating Physical Systems in the Static Analysis of Embedded Control Software Patrick Cousot 10:30-12:30 Session 3 * Reflection Analysis for Java Benjamin Livshits, John Whaley, Monica Lam * Lightweight Family Polymorphism Atsushi Igarashi, Chieri Saito, Mirko Viroli * A Portable and Customizable Profiling Framework for Java Based on Bytecode Instruction Counting Walter Binder * Race Conditions in Message Sequence Charts Chien-An CHEN, Sara Kalvala, Jane Sinclair 13:00-18:00 Excursion 18:00-20:00 Banquet DAY III: November 5, 2005 09:00-10:00 Invited Talk A Next-Generation Platform for Analyzing Executables Thomas Reps, G. Balakrishnan, J. Lim, T. Teitelbaum 10:30-12:30 Session 4 * Calculating Polynomial Runtime Properties Hugh Anderson, Saiu-Cheng Khoo, Stefan Andrei, Beatrice Luca * Resource Bound Certification for a Tail-Recursive Virtual Machine Silvano Dal Zilio, Regis Gascon * A Path Sensitive Type System for Resource Usage Verification of C-like Language Hyun-Goo Kang, Youil Kim, Taisook Han, Hwansoo Han * Temrination Analysis of Higher-Order Functional Programs Damien Sereni, Neil D. Jones 14:00-16:00 Session 5 * Heterogeneous Fixed Points with Application to Points-to Analysis Aditya Kanade, Uday Khedker, Amitabha Sanyal * Register Allocation via Coloring of Chordal Graphs Fernando Magno Quintao Pereira, Jens Palsberg * Transformation to Dynamic Single Assignment Using a Simple Data Flow Analysis Peter Vanbroekhoven, Gerda Janssens, Maurice Bruynooghe, Francky Catthoor * Abstract Dependences for Alarm Diagnosis Xavier Rival 16:30-18:30 Session 6 * A Typed, Compositional Logic for a Stack-Based Abstract Machine Nick Benton * A New Occurrence Counting Analysis for BioAmbients Roberta Gori, Francesca Levi * Parametric Model Checking for Mobile Ambients Dino Distefano * On the Role of Abstract Non-Interference in Language-based Security Isabella Mastroeni 18:30-18:40 Closing --

1 0

Re: Mixing monadic and non-monadic functions
by Lyle Kopnicky 15 Sep '05

15 Sep '05

It appears to me that: * Many people don't like having to "extract values" from a monad on a separate line, but would like to be able to mix monadic return values into pure expressions, on the way to calculating a monadic result. * Some people want to fix this by doing an implicit lifting operation on functions, when their parameters are monadic * It is not really clear what values are "monadic" and which aren't, so the implicit lifting is a guessing game, and likely to produce confounding errors. * If you aren't going to be precise about what's in the monad and what's not, you might as well use ML. I propose instead an explicit, lightweight notation, with a simple rewrite rule. Instead of: do putStr "What is your name? " s <- getLine putStrLn ("Hello " ++ s) I would like to write something like: do putStr "What is your name? " putStrLn ("Hello " ++ {* getLine *}) In other words, we use some kind of special brackets (I don't care what) to indicate that this value needs to be extracted from the monad on a previous line, and inserted back here as a "pure" value. If these occur multiply nested, they can be flattened out according to a dependency rule. E.g., do m1 {* m2 {* m3 *} v4 *} {* m5 *} ...would be rewritten as... do v3 <- m3 v2 <- m2 v3 v4 v5 <- m5 m1 v2 v5 ...and... do m1 {* {* m2 *} *} ...would become... do m2a <- m2 v2 <- m2a m1 v2 I'm sure this has been suggested before... but what do folks think? - Lyle

1 0

Realistic max size of GHC heap
by Karl Grapone 15 Sep '05

15 Sep '05

Hello, I'm considering using haskell for a system that could, potentially, need 5GB-10GB of live data. My intention is to use GHC on Opteron boxes which will give me a max of 16GB-32GB of real ram. I gather that GHC is close to being ported to amd64. Is it a realistic goal to operate with a heap size this large in GHC? The great majority of this data will be very long tenured, so I'm hoping that it'll be possible to configure the GC to not need to much peak memory during the collection phase. Thanks Karl

1 0

Haskell Weekly News: September 13, 2005
by John Goerzen 14 Sep '05

14 Sep '05

Haskell Weekly News: September 13, 2005 Greetings, and thanks for reading the seventh issue of HWN, a weekly newsletter for the Haskell community. Each Tuesday, new editions will be posted (as text) to [1]the Haskell mailing list and (as HTML) to [2]The Haskell Sequence. 1. http://www.haskell.org/mailman/listinfo/haskell 2. http://sequence.complete.org/ New Releases * CabalFind 0.1. Dimitry Golubovsky [3]announced CabalFind 0.1, an interface to search engines such as Google and Yahoo designed to help find Cabalized packages out on the Internet. 3. http://article.gmane.org/gmane.comp.lang.haskell.cafe/8214 * gtk2hs with Cairo. Duncan Coutts [4]announced a special release of gtk2hs as a "tech preview" of the included Cairo bindings. Some impressive screenshots are in there as well. 4. http://article.gmane.org/gmane.comp.lang.haskell.general/12082 * OOHaskell. Ralf Laemmel and Olaf Kiselyov [5]announced a new version of their paper, "Haskell's overlooked object system" and its accompanying library. 5. http://article.gmane.org/gmane.comp.lang.haskell.general/12077 * StringMap. Adrian Hey [6]announced his new module, Data.StringMap, which provides mapes from String keys to arbitrary values. 6. http://article.gmane.org/gmane.comp.lang.haskell.general/12104 * AVL 2.3. Adrian Hey [7]announced version 2.3 of his Data.Tree.AVL library, adding a few new features and a bit of renaming. 7. http://article.gmane.org/gmane.comp.lang.haskell.libraries/3714 Discussion Why is HWN a day late this week? Your HWN editor was stuck in some large airports that had a [8]surprising lack of Wifi. Sigh. 8. http://changelog.complete.org/node/388 Binary parser combinators. Einar Karttunen [9]asked about a binary parser combinator interface for network protocol parsing. Malcolm Wallac pointed out that nhc98 has a Binary library with a "<<" operator that could be useful. 9. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/8256 Windows programming in Haskell. Brian McQueen [10]asked about Windows programming in Haskell, including access to the Windows registry, APIs, and communicating with other Windows apps. Several suggestions relating to Hugs were offered, including .NET support and some libraries. 10. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/8221 Functional vs. Imperative. Dhaemon began an [11]interesting discussion by asking for some help understanding functional vs. imperative approaches. Several people commented on the IO monad, and how it is still a functional interface even though it may appear imperative at first glance. 11. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/8254 Mixing monadic and non-monadic functions. A long [12]thread on this subject appeared in the Haskell list this week. Rather too long to summarize here -- take a look at the link. 12. http://thread.gmane.org/gmane.comp.lang.haskell.general/12077 Language workbenches. Yoel Jacobsen [13]wrote about an article on language workbenches, in which configuration files are actually valid code in a general-purpose language. Yoel went on to ask about doing this in Haskell. Some suggestions, such as hs-plugins, were offered. 13. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/8227 Types in Template Haskell. Gracjan Polak [14]posted about some trouble with typing in Template Haskell. Several responses regarding quoting types were posted, including a reference to Simon Marlow's "update" [15]paper. 14. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/8235 15. http://research.microsoft.com/~simonpj/tmp/notes2.ps Web applications. Gary began a large [16]discussion by asking about writing Web applications. Several options were mentioned, including Wash and HAppS. S. Alexander Jacobsen [17]mentioned that he will be launching a commercial chat service using Haskell and AJAX with HAppS as the underlying core. 16. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/8215 17. http://article.gmane.org/gmane.comp.lang.haskell.cafe/8242 Calling Haskell from C++. Felix Breuer [18]wrote about some trouble calling into Haskell from C++ programs. Several suggestions were provided, mostly relating to C++ name mangling. 18. http://thread.gmane.org/gmane.comp.lang.haskell.glasgow.user/8652 What gets profiled? Niels began a [19]discussion on the use of profiling features by commenting that profiling didn't seem to show the problem in his own code. Several suggestions regarding memory use and possible reasons that profilers might miss things were provided. 19. http://thread.gmane.org/gmane.comp.lang.haskell.glasgow.user/8622 Haskell Toolchain GHC 6.4.1. Simon Marlow posted an [20]update on GHC 6.4.1. Though more bug reports have been rolling in while he was away, only a few are blockers for 6.4.1. The tentative release date is September 19. 20. http://article.gmane.org/gmane.comp.lang.haskell.glasgow.user/8649 Data.Monoid. Ross Paterson [21]proposed replacing an instance of Data.Monoid. There was some discussion about whether the old or new instance was better. 21. http://thread.gmane.org/gmane.comp.lang.haskell.libraries/3719 Quotes of the Week <poetix> "Oh, a monad...that's just a funny name for a particular sort of arrow" <mcnster> Chocolate Frosted Monads, new from Cadbury <mcnster> ... "All the sugar, twice the arrows" <mcnster> Mr. Tweedsmuir, we're going to have to bypass your left ventrical monad. You'll probably never play Chopin again <poetix> Readers of the ABC Warriors strip in 2000AD may remember The Monad as the concentrated essence of human evil <mcnster> Monadocet. Because category theory should be understood by everyone. About Haskell Weekly News Want to continue reading HWN? Please help us create new editions of this newsletter. Please see the [22]contributing information, or send stories to hwn -at- complete -dot- org. There is also a Darcs repository available. 22. http://sequence.complete.org/hwn-contrib

1 0

A Gentle Introduction to Haskell Version 98
by Wolfgang Jeltsch 14 Sep '05

14 Sep '05

Hello, the web page under http://haskell.org/tutorial/ says: This is the master HTML version of the Gentle Introduction To Haskell, version 98. Revised June, 2000 by Reuben Thomas. However, the Postscript, gezipped PDF, PDF and DVI versions don't mention Reuben Thomas as co-author and have October 1999 as their date. The downloadable HTML version doesn't mention Reuben Thomas too and has September 28, 1999 as its date. So what is true? Ist the online version different from the download versions and is the downloadable HTML version different from the other download versions? Did Reuben Thomas modify the tutorial? Which versions do contain his modifications, which not? Best wishes, Wolfgang

2 1

RE: [Haskell] reading call graphs
by Simon Marlow 13 Sep '05

13 Sep '05

On 24 August 2005 11:10, Malcolm Wallace wrote: > "Scherrer, Chad" <Chad.Scherrer(a)pnl.gov> writes: > >> individual inherited >> COST CENTRE MODULE no. entries %time %alloc %time %alloc >> >> >> MAIN MAIN 1 0 0.0 0.0 100.0 100.0 >> main Main 228 92329 0.2 0.9 99.8 99.8 >> step Main 259 679 38.4 26.6 56.6 39.2 >> >> I'm trying to understand the "entries" column. I thought this was the >> number of times a given function is called. But "main" is >> nonrecursive, and only calls "step" (also nonrecursive) once. Where >> are the 92329 and 679 coming from? > > Perhaps these functions are split into smaller chunks by the > compiler/optimiser? Then the profiler would aggregate the data for > the individual chunks back up into the original cost centre. That's a plausible hypothesis. Each time an expression of the form ({-# SCC "foo" #-} e) is evaluated, the entries count for "foo" is incremented. The effect of -auto-all is to wrap each top-level function in an {-# SCC #-} expression, so you would normally get one entry per call of the function. However, the optimiser can change the structure of the code. Optimisations are supposed to retain the cost attribution model, but they don't necessarily retain the same entry counts. Basically I find the entries figure is a useful sanity check (i.e. "is this function called at all?"), but not much more than that. Cheers, Simon

1 0