- Haskell - Haskell.org

SURVEY - Haskell editing
by C.Reinke 22 Jul '02

22 Jul '02

As some of you know, our refactoring project here at UKC has just started (at long last). Of course, it will take some time before this leads to concrete artifacts in terms of detailed refactoring catalogues and prototype tools, but we would like to know a bit more about the environment into which any such refactoring tools would have to fit. After all, you might have different development habits and tools than we do;-) So it would be great if you could spare a few minutes to fill in the following survey and send it back to <refactor-fp(a)ukc.ac.uk> (reply-to should be set?). We'll summarize to this list. We will try to keep you involved in later stages of the project as well, e.g., to ask for input on what refactorings you'd find most useful, but if you'd like to share your thoughts on this earlier, feel free to email us. Thanks for your input, Claus "Refactoring Functional Programs" http://www.cs.ukc.ac.uk/research/groups/tcs/fp/Refactor/ ----------July 2002---------------------- SURVEY - Haskell editing 1. When developing Haskell programs, - which OS-platforms do you work on? - which Haskell implementations are you using (please indicate rough version info: "whatever", "latest source release", "latest binary release", "latest CVS", "latest stable version", ..)? Hugs98 GHC nhc98 .. - to what extent do you use (which?) features outside Haskell 98? class/instance-restrictions existential types arrow notation .. - what editors, IDEs or source-manipulation tools are you using? - editors Vim Emacs .. - tag-file generators HaskTags .. - documentation generators Haddock .. - pre-processors DrIFT cpp .. - revision control manual CVS bitkeeper .. - .. 2. To what extent are your editors/IDEs Haskell-aware? - what Haskell-specific functionality do they offer? syntax highlighting pretty-printing tag-files permitting jump-to-definition syntax-aware movements (to next definition/expression/..) .. - what non-Haskell-specific editing functionality do you find most helpful when developing Haskell programs? matching of parentheses macro recording and playback (what do you use these for?) integration with external tools (which ones?) .. - what Haskell-specific editing functionality do you you miss most? .. - what interface options does your editor/IDE offer for integration of external tools (brief explanations or pointers to detailed documentations would be great)? coarse-grained (piping text through formatters, spell-checkers; preparation of tag files, ..) fine-grained (bi-directional access, i.e., editor can use external functionality, and external tools can use editor functionality) scripting (to weave it all together)

1 0

lines/unlines and "inverse"
by Ian Lynagh 22 Jul '02

22 Jul '02

Just above http://research.microsoft.com/Users/simonpj/haskell98-revised/haskell98-rep… it says -- lines breaks a string up into a list of strings at newline -- characters. The resulting strings do not contain newlines. -- Similary, words breaks a string up into a list of words, which -- were delimited by white space. unlines and unwords are the -- inverse operations. unlines joins lines with terminating -- newlines, and unwords joins words with separating spaces. I think the use of "inverse" is potentially confusing given, well, they aren't inverses (or even left or right inverses). e.g. unwords (words " ") == "" words (unwords [""]) == [] unlines (lines " ") == " \n" lines (unlines ["\n"]) == ["",""] Thanks Ian, who thinks (unlines . lines == id) would have been useful. Oh well.

5 5

RE: foralls in class assertions
by Simon Peyton-Jones 22 Jul '02

22 Jul '02

Yes that looks plausible, though I assume you meant | class ( | Monad m, | forall a. Monoid (m a) | ) => MonadPlus m I.e. parens round the (m a). This business of having 'foralls' in a context (whether for a class or a function) is not hard to implement in principle, but in practice it'd take few days of hacking I guess. And, more to the point, thinking. What are the interactions with functional dependencies or implicit parameters? (Maybe none, but I've been caught before.) So it's really waiting for someone to say "having foralls in contexts would change my life and I would love you for ever", rather than "it'd be nice". Simon "lazy evaluation" PJ | -----Original Message----- | From: Ashley Yakeley [mailto:ashley@semantic.org] | Sent: 19 July 2002 03:24 | To: Simon Peyton-Jones; Haskell List | Subject: RE: foralls in class assertions | | | At 2002-02-20 13:15, Simon Peyton-Jones wrote: | | >OK, so it does look as though it's the same idea as | >that described in our paper. Good. | > | >I have not implemented, yet. | | I don't suppose you did for GHC 5.04?... | | >As always my implementation | >priorities are strongly influenced by my perception of whether some | >enhancement would be used. Maybe you can outline why such a change | >would be useful to you? I only have the example in our paper as | >motivation so far. | | I just thought of another motivating example for this: | | class Monoid a where | mempty :: a | mappend :: a -> a -> a | mconcat :: [a] -> a | | class ( | Monad m, | forall a. Monoid m a | ) => MonadPlus m | | Of course, you folks might not want to rewrite | Control.Monad.MonadPlus. | But I think is shows this sort of thing is useful in | principle (and it | would great for my HBase, which does its own Prelude). | | -- | Ashley Yakeley, Seattle WA | |

1 0

COLOGNET Joint Workshop
by Manuel Carro 19 Jul '02

19 Jul '02

We apologize for multiple copies ========================================================================== Call for Papers and Participation --------------------------------- COLOGNET Joint Workshop on -------------------------- Component-based Software Development ------------------------------------ and Implementation Technology for Computational Logic Systems --------------------------------------------------------- (http://clip.dia.fi.upm.es/COLOGNET-WS/) Affiliated with LOPSTR 2002 19 - 20 September 2002, Madrid, Spain COLOGNET (http://www.colognet.org) the European Network of Excellence in Computational Logic is organizing a workshop on two of its workpackages: Component-based Software Development (CBD) and Implementation Technology for Computational Logic Systems (ITCLS). This joint workshop will be collocated with SAS/LOPSTR/AGP (http://clip.dia.fi.upm.es/SAS-LOPSTR-AGP) The aim of the workshop is to present and discuss current research issues, both in academia and industry. The joint workshop will be organized in two sessions: Component Based Software Development ------------------------------------ The goal of this session is to examine the process of component-based software development in all phases of the development life-cycle (i.e., specification, design, composition, testing, deployment). Special emphasis will be placed on the use of Computational Logic throughout the process. A non-exhaustive list of topics includes: - Methodological foundation of component-based software development. - Modeling of component-based systems. - Tools supporting component-based development. - Integration of the component paradigm into existing environments. - Component testing, verification, distribution, maintenance. - Combination of heterogeneous component technologies. - The role of Computational Logic in all the above. - Industrial experience reports. Implementation Technology for Computational Logic Programming ------------------------------------------------------------- This session is intended to be a continuation of the series of workshops on Implementations of Logic Programming Systems held in the context of COMPULOG NET, the former Network of Excellence in Computational Logic. But, in contrast to the COMPULOG area meetings on implementation, which were rather centered toward logic and constraint logic programming systems, the target of this workshop is broader: it includes implementation technology for other areas which are part of the COLOGNET network. The aim is to bring together researchers from fields such as automated reasoning, natural language processing, constraint logic programming, model checking, etc., in order to share common problems and solutions regarding implementation issues which arise in the logic-based systems arena. Suggested topics of interest for the implementation workshop include, but are not limited to: - Implementation of resolution and model elimination theorem provers. - Implementation for non-monotonic reasoning systems and semantics. - Implementation of higher-order, linear, etc. logics. - Implementation techniques for natural language processing. - Standard and non-standard sequential implementation schemes for constraint logic programing languages (e.g., generalization / modification of WAM, translation to C, etc.) - Memory management and garbage collection issues. - Implementation of concurrency and parallelism in logic-based languages. - Extensions to the Warren Abstract Machine. Term indexing. Invited Talks ------------- The workshop programme will consist of invited talks and accepted papers. So far, invited talks include the following: Keynote Speaker (shared among CBD, ITCLS and LOPSTR): ---------------------------------------------------- Robert Hall, AT & T (still pending of final confirmation). Robert Hall does research on Automated Software Engineering, particularly in making networked services and components secure, reliable, and scalable. CBD: ---- Antonio Brogi, University of Pisa, Modeling Component Behaviors. Kung-Kiu Lau, University of Manchester, A Priori Reasoning for CBD. Manuel Carro, UPM, Madrid, The AMOS Project. ITCLS: ------ Michael Fisher, University of Liverpool, Implementing Temporal Logics: Tools for Execution and Proof. Submissions and Deadlines ------------------------- Authors are invited to contribute to the programme by submitting extended abstracts (6 pages maximum) or full papers (12 pages maximum) on the workshop themes. Limits are strict, and the llncs format (http://www.springer.de/comp/lncs/authors.html) must be used. Submissions are to be sent to the organizing committee by emailing them to: - kung-kiu(a)cs.man.ac.uk (for CBD papers) or to - colognet-imp(a)clip.dia.fi.upm.es (for ITCLS papers) Submission deadline: July 26 Notification to authors: August 5 Camera-ready copies: September 5 Workshop: September 19-20 Informal proceedings will be available at the workshop. Organizing Committee -------------------- Antonio Brogi, University of Pisa, Italy. Manuel Carro, UPM, Madrid, Spain. Shui Ming Ho, University of Manchester, UK. Kung-Kiu Lau, University of Manchester, UK. Mario Ornaghi, University of Milan, Italy. German Puebla, UPM, Madrid, Spain. Claudio Vaucheret, UPM, Madrid, Spain. ===========================================================================

1 0

RE: foralls in class assertions
by Ashley Yakeley 19 Jul '02

19 Jul '02

At 2002-02-20 13:15, Simon Peyton-Jones wrote: >OK, so it does look as though it's the same idea as >that described in our paper. Good. > >I have not implemented, yet. I don't suppose you did for GHC 5.04?... >As always my implementation >priorities are strongly influenced by my perception of whether >some enhancement would be used. Maybe you can outline >why such a change would be useful to you? I only have the >example in our paper as motivation so far. I just thought of another motivating example for this: class Monoid a where mempty :: a mappend :: a -> a -> a mconcat :: [a] -> a class ( Monad m, forall a. Monoid m a ) => MonadPlus m Of course, you folks might not want to rewrite Control.Monad.MonadPlus. But I think is shows this sort of thing is useful in principle (and it would great for my HBase, which does its own Prelude). -- Ashley Yakeley, Seattle WA

1 0

Your message to Hugs-Users awaits moderator approval
by hugs-users-admin＠haskell.org 18 Jul '02

18 Jul '02

Your mail to 'Hugs-Users' with the subject Central Europeu Is being held until the list moderator can review it for approval. The reason it is being held: Message body is too big: 146589 bytes but there's a limit of 40 KB Either the message will get posted to the list, or you will receive notification of the moderator's decision.

1 0

another minor fault in the Haskell Report
by Malcolm Wallace 17 Jul '02

17 Jul '02

I have just discovered another minor fault in the revised Haskell'98 Report. In the definition of the Standard Prelude, (page 115) instance Read Float where readsPrec p = readFloat instance Read Double where readsPrec p = readFloat are incorrect because they do not deal with a leading minus sign. The correct versions are: instance Read Float where readsPrec p = readSigned readFloat instance Read Double where readsPrec p = readSigned readFloat Funnily enough, all the implementations seem to have this fix already, it is just the Report that gets it wrong! Regards, Malcolm

1 0

会议提醒
by ee31＠163.com 16 Jul '02

16 Jul '02

1 0

上海苑通计算机网络工程有限公司
by shanghaiyt＠163.com 13 Jul '02

13 Jul '02

Èç¹ûÕâ·ÝÐÅŒþŽòÈÅÁËÄã£¬ÎÒÃÇ±íÊŸÖÁÇ«£¬²¢ÏòÄãËµÉù£º ¶Ô²»Æð£¬ÇëÔÁÂ£¡£¡£¡ ÉÏº£Ô·ÍšŒÆËã»úÍøÂç¹€³ÌÓÐÏÞ¹«ËŸÊÇ×šÃÅ³ÐœÓÓÐÏß µçÊÓË«Ïò¿íŽøÍø¡¢ŒÆËã»úŸÖÓòÍø¡¢ÎÀÐÇµçÊÓ¡¢³Ì¿Øœ»»» »úµç»°Íø¡¢IPµç»°¡¢ÖÇÄÜÐ¡ÇøÈý±íŽ«ÊäÏµÍ³Œ°Œà¿Ø±šŸ¯ ÏµÍ³µÈÒµÎñµÄ¹€³Ì¹«ËŸ¡£ ±Ÿ¹«ËŸŒŒÊõÁŠÁ¿ÐÛºñ²¢³€ÆÚŒá³Ö¡°ÖÊÁ¿µÚÒ»£¬ÐÅÓþ Ö®ÉÏ¡±µÄÆóÒµŸ«Éñ£¬Îªž÷µØ·œÕþž®°ì¹«Â¥¡¢ž÷Žó±ö¹Ý¡¢ ŸÆµê¡¢Ñ§Ð£ÐŽ×ÖÂ¥¡¢°ìÊÂŽŠ¡¢žßµµ×¡Õ¬Ð¡Çø¡¢ÐÂŸÓŒÒÍ¥ ×°ÐÞÌá¹©ÓÅÖÊ×šÒµµÄ×ÛºÏ²ŒÏß·þÎñ¡£ ÎªÊÊÓŠ¶ÔÍâ¿ª·¢¡¢ÓœÓÊÀ²©»áÔÚÉÏº£µÄÕÙ¿ª£¬±Ÿ¹« ËŸÎªž÷Žó±ö¹Ý¡¢ŸÆµê°²×°µçÄÔ¿íŽøŸÖÓòÍø£¬ŽÓ¶øÊ¹±ö¹Ý ŸÆµêµÄÃ¿Œä¿Í·¿¶ŒÄÜ±ãœÝµØÉÏ¹úŒÊ»¥ÁªÍø£¬žøÖÐÍâÀŽ±ö Ìá¹©·œ±ã£¬Ò²Îª±ö¹ÝŸÆµêÔöŒÓÐ§Òæ¡£ Ô·Íš£¬Ò»²œµœÎ»µÄÍøÂç¹€³Ì£¬œôžúÐÅÏ¢Ê±Žú²œ·¥£¬ ŽÓ¶øÊ¹¹óµ¥Î»ÎÞÐèÖØžŽžÄÔìÏßÂ·Ÿ¡ÏíÐÅÏ¢Ê±ŽúŽøžøÄãµÄ ÖÖÖÖ±ãÀû£¡ ±Ÿ¹«ËŸœ«ÒÔÒ»Á÷µÄÊ©¹€¡¢ÓÅÖÊµÄ·þÎñ¡¢ÁŒºÃµÄÐÅÓþ Óë¹ãŽó¿Í»§¹²Í¬ÓœÓ¶þÊ®Ò»ÊÀŒÍµÄÐÅÏ¢žïÃü£¡ ÉÏº£Ô·ÍšŒÆËã»úÍøÂç¹€³ÌÓÐÏÞ¹«ËŸÏÂÉèÁœŽó²¿ÃÅ£º Ò».ÆóÒµ²¿ ×šÃÅ³ÐœÓ±ö¹Ý¡¢ŸÆµê¡¢Ñ§Ð£¡¢ÐŽ×ÖÂ¥¡¢°ìÊÂŽŠ¡¢ žßµµ×¡Õ¬Ð¡ÇøµÈ×šÒµ×ÛºÏ²ŒÏßºÍÏµÍ³Œ¯³ÉÒµÎñ¡£ ²ŒÏßÄÚÈÝ°üÀš£º 1.ÓÐÏßµçÊÓ¿íŽøÍøÂç£šÃ¿žö·¿Œä¶ŒÄÜÇåÎúÊÕ¿Ž£¬ ¶øÖ»ÉêÇëÒ»žöÓÐÏßÖÕ¶Ë£¬ŽÓ¶øŽóŽóœµµÍÁËÊÕÊÓ·ÑµÄÖ§ ³ö£©¡£ 2.³Ì¿Øµç»°œ»»»»úÍø 3.µçÄÔŸÖÓòÍø£šº¬¹ÜÀíÏµÍ³£© 4.ÀûÓÃÓÐÏßµçÊÓ¿íŽøÍøµÄIPµç»°ÏßÂ·¡£ 5.ÖÇÄÜÐ¡ÇøÔ¶Ž«Œ¯ÖÐÖÇÄÜ³±íÏµÍ³¡£ 6.ÖÇÄÜŒà¿Ø¡¢×Ô¶¯±šŸ¯ÉèÊ©¡£ 7.ÒôÆµÏµÍ³ÍøÂç¡£ 8.ÎÀÐÇµçÊÓÐÅºÅœÓÊÕÏµÍ³¡£ 9.VODÓ°ÊÓµã²¥ÏµÍ³¡£ ¶þ.ŒÒÍ¥²¿ ×šÃÅ³ÐœÓÐÂŸÓ×šÒµ×ÛºÏ²ŒÏßºÍŒÒÍ¥ÖÇÄÜ»¯¡¢ÐÅ Ï¢»¯ŒÒÍ¥×°è«ÒµÎñ¡£ 1.ÓÐÏßµçÊÓ¿íŽøÍøÂç Ã¿žö·¿Œä¶ŒÄÜÇåÎúÊÕ¿Ž£¬¶øÖ»ÉêÇëÒ»žöÓÐÏßÖÕ¶Ë£¬ ŽÓ¶øŽóŽóœµµÍÁËÊÕÊÓ·ÑµÄÖ§³ö¡£ 2.³Ì¿Øœ»»»»úÍøÂç Ê¹ÄãµÄÃ¿Ò»Œä·¿¶ŒÓÐµç»°£¬ŒÈÊÇÖ÷»ú£¬ÓÖÊÇ·Ö»ú ŒÈÄÜÄÚ²¿Íš»°¡¢ÓÖÄÜ¶ÔÍâÖ÷Žò¡£¶øÄãÖ»ÐèÉêÇëÒ»Ìõµç »°ÏßÂ·¡£ 3.¿íŽøÍøÂç Ä¿Ç°£¬¿íŽøÉÏÍøÖ»ÓÐÁœÖÖ·œÊœ£ºADSLºÍÓÐÏßÍš£¡ ÔÚÄã»¹Ã»ÓÐÈ·¶šÊ¹ÓÃÄÄÒ»ÖÖÉÏÍø·œÊœ£¬Äã±ØÐëÊÂ ÏÈ²ŒºÃÕâÁœÖÖÏßÂ·¡£¶øÇÒ£¬Ã¿žö·¿Œä¶Œ±ØÐëÒªÓÐ²å¿Ú£¬ ÕâÑù£¬ÄãÒÔºó²»¹ÜÔÚÄÇžö·¿Œä¶ŒÄÜÉÏ¿íŽøÍø¡£ 4.µçÄÔŸÖÓòÍøÂç Èç¹ûÄãÒÔºóÓÐÁœÌšÒÔÉÏµÄµçÄÔÍ¬Ê±ÉÏÍø£¬ŸÍ±ØÐë ²ŒÉèµçÄÔŸÖÓòÍø£š¶øÄãÖ»ÐèÉêÇëÒ»žù¿íŽøÏßÂ·£©¡£ 5.IPµç»°ÍøÂç Ã¿žö·¿Œä¶ŒÓÐIPµç»°²å¿ÚŒŽœ«ÔÚÉÏº£µØÇø¿ªÍšµÄ ÀûÓÃÓÐÏßµçÊÓÍøÂçŽòIPµç»°£¬ŒÛžñ·Ç³£µÍÁ®ŸÝËµÃ¿ÔÂ Ö»Ðè15Ôª£š°üÔÂ£©¡£ 6.ŒÒÍ¥Ó°ÔºÏµÍ³ ŒÒÍ¥Ó°ÔºÏµÍ³µÄÉùÏó¶šÎ»ºÜÖØÒª£¬Èç¹û°ÑÒôÆµÏß Â·œÓ·ŽÁË£¬Ð§¹ûŸÍŽóŽòÕÛ¿Û£¬ÇëÔÚ×°ÐÞ²ŒÏßÊ±Ò»¶šÒª ×¢Òâ¡£ ¹«ËŸÁªÂç·œ·š£º µØÖ·£ºÉÏº£ÊÐÂ¬ÍåÇø»Žº£ÖÐÂ·830ºÅ¶þÂ¥A£š¹úÌ©µçÓ°ÔºÅÔ£© µç»°£º£š021£©54048777 £š021£©54032592 Ž«Õæ£º£š021£©54032592 ÓÊ±à£º200020 E-mail: shyt(a)shyt.net ¹«ËŸÍøÒ³£ºhttp://www.shyt.net

1 0

URGENT RESPONSE NEEDED
by MAXWELL EZE 13 Jul '02

13 Jul '02

REQUEST FOR URGENT /CONFIDENTIAL BUSINESSRELATIONSHIP. I am the Financial Controller, National Electric Power Authority (NEPA) here in Lagos, Nigeria. I am seeking for assistance of a reliable foreigner through whom I can transfer the sum of US$38,600.00(Thirty-Eight Million, Six Hundred Thousand U. S. Dollars) which arose from the deliberate over-inflated contract value of the general expansion of the Kanji Dam Thermal Station on behalf of National Electric Power Authority (NEPA) for increased energy generation to Nigeria and some other Western African Countries. The present government of chief Olusegun Obasanjo through the chairman contract award committee National Electric Power Authority awarded the contract to an expatriate firm with the consideration of 10% commission agreement on the total contract value. The contract has been completed and the contractor has long been paid, we are left with this US$38,600,000.00 being our own share that is remaining in the federal government account. The current favorable political / economic climate in the country now presented an opportunity for this money to be transferred out of the country. My contact in the federal ministry of finance have given me a go ahead advice to begin the process of the remittance, hence I have set in motion the machinery for the take off of this transaction and further actions will commence immediately I hear from you. At the conclusion of the transfer into your nominated account, 20% of this sum would be for you, 5% would be used to reimburse all expenses made during the processing of the transfer by both parties, while 75% is for me. The nature of your business is not particular relevant for the transaction. All I require is your willingness to co-operate and assurance that my own share will be given to me when this money is transferred into your account. All necessary precautions have been taken to ensure a no risk situation on the sides of both parties and it is believed that this conclusion of this transaction will not last more than 14 working days. Since I have no knowledge of business, my plan is to invest this money into real estate, stock and I can also invest in some other profitable business in your country based on your advice because many of my years has been spent as civil servant, and I may likely resign from government service to private business after this money is transferred into your account. Please if this proposal is acceptable to you, or if you have any questions feel free to contact me on the above e-mail address. I will oblige you with further information and please I need your private telephone/fax numbers, for easy and confidential communication. Best regards, MAXWELL EZE

1 0