- Haskell-Cafe - Haskell.org

RE: Replacing the Prelude
by Simon Peyton-Jones 14 May '02

14 May '02

Ashley writes | > I was hoping to do something similar for 'do' notation by redefining | > (>>), (>>=) etc., but unfortunately GHC is quite insistent | that 'do' notation quite specifically refers to GHC.Base.Monad Dylan replies | I'm surprised that ghc uses the fromInteger and fromRational | that are in scope; I thought there was general agreement that | it should use the Prelude.from{Integer,Rational} in scope. Ashley is referring to a GHC extension. Normally, GHC uses Prelude.fromInteger etc, regardless of what is in scope. But if you say -fno-implicit-prelude, GHC will instead use whatver fromInteger is in scope. (This is documented in the manual.) Ashley's question, as I understand is whether something similar could be done for monads. Answer: I think so, without much bother. I'm beavering away on a Haskell workshop paper at the moment, but ping me in a fortnight to do it. Simon

1 0

Re: Replacing the Prelude
by Dylan Thurston 14 May '02

14 May '02

On Sun, May 12, 2002 at 09:31:38PM -0700, Ashley Yakeley wrote: > I have recently been experimenting writing code that replaces large > chunks of the Prelude, compiling with -fno-implicit-prelude. I notice > that I can happily redefine numeric literals simply by creating functions > called 'fromInteger' and 'fromRational': GHC will use whatever is in > scope for those names. > > I was hoping to do something similar for 'do' notation by redefining > (>>), (>>=) etc., but unfortunately GHC is quite insistent that 'do' > notation quite specifically refers to GHC.Base.Monad (i.e. Prelude.Monad, > as the Report seems to require). I don't suppose there's any way of > fooling it, is there? I was rather hoping 'do' notation would work like a > macro in rewriting its block, and not worry about types at all. > > I accept that this might be a slightly bizarre request. There are a > number of things I don't like about the way the Prelude.Monad class and > 'do' notation are set up, and it would be nice to be able to experiment > with alternatives. A while ago, there were extensive discussions about replacing the Prelude on this list. (Search for "Prelude shenanigans".) I started to write up a design document for how to enable replacing the Prelude. This boiled down to taking most of the "syntactic sugar" defined in the report seriously, ignoring the types (as you say). I'm surprised that ghc uses the fromInteger and fromRational that are in scope; I thought there was general agreement that it should use the Prelude.from{Integer,Rational} in scope. As I recall, there were several relevant bits of syntactic sugar: - Numeric types, including 'fromInteger', 'fromRational', and 'negate'. This all works fine, except that the defaulting mechanism is completely broken, causing a number of headaches. - Monads. The translation given in the report is clean, and it seems like it can be used without problems. - Bools. There was a slight problem here: the expansion of 'if ... then ... else ...' uses a case construct referring to the constructors of the Bool type, which prevents any useful redefinition of Bool. I would propose using a new function, 'Prelude.ifThenElse', if there is one in scope. - Enumerations. Clean syntactic sugar. - List comprehensions. The report gives one translation, but I think I might prefer a translation into monads. - Lists and tuples more generally. At some point the translations start getting too hairy; I think I decided that lists and tuples were too deeply intertwined into the language to change cleanly. I'll dig up my old notes and write more, and then maybe write a complete design document and get someone to implement it. --Dylan Thurston

1 0

composeList
by Emre Tezel 13 May '02

13 May '02

Hi all, I recently bought Simon Thompson's Haskell book. I have been doing the exercises while I read on. There are couple questions that I can not solve. Any help would be greatly appreciated. I got stuck on this question in Chapter 10. Define a function composeList which composes a list of functions into a single function. What is the type of composeList? I naively tried the following but the hugs compiler complained about the inferred type not being generic enough. composeList :: [(a -> b)] -> (c -> b) composeList [] = id composeList (x:xs) = x . (composeList xs) or composeList :: [(a -> b)] -> (c -> b) composeList (x:xs) = x . (composeList xs) ERROR "Chapter10.hs":6 - Inferred type is not general enough *** Expression : composeList *** Expected type : [a -> b] -> c -> b *** Inferred type : [a -> a] -> b -> a Anybody can solve this? Emre

2 2

Re: waiting for your reply
by Bob Johnson 12 May '02

12 May '02

Dear Madam/Sir @->->- Let me first say Welcome and to introduce myself to you. My name Bob Johnson, I operate J.H p&s online store from my home out Muskegon Michigan. J.H p&s online store has been online since Nov 1st of 2001. Our warehouse is located in Utah, where most of the online items are sent from. To begin an Relationship with Potential customers, and to earn your trust, I am offering you a Complimentary Gift. Sent you at my expense. Just for registering with J.H p&s online store. There is no fees to register.There no catch , simple register with my online store and I will send you one free gift out of the choices that are available. Click on to claim your FREE Gift Offer. While supplies last. http://home.attbi.com/~johnsonhomestor1/YOUR_COMPLIMENTARY_GIFT.htx I would Like to get to know you, and also for you to get to know me. There are Several Different Gifts to choose From. Plus once you become registered with J.H p&s online Store. You will be enter in the monthly drawing contest every month automatically. http://home.attbi.com/~johnsonhomestor1/MAINMPF.htm Click of to visit Our Online Features Please Click on to Check out our online special Features of products, Winners of our monthly contest. Featuring website. http://www.johnsonhome2276.com/default.asp?S=500&A=F Click on over to view our complete line of quality products, We are now offer over 1500 Products online. Incentive Program Every Order You Place You will earn buying Point, JH P.S Tokens. 1 JH P.S has a cash value of $0.025 10 JH P.S tokens has a Cash Value of $0.25 100 JH P.S tokens has a Cash Value of $2.50 1000 JH P.S tokens has a Cash Value of $25.00 Every $25.00 You spend, Earn's 1 Jh P.S Token, Your token account will earn a Cash Value Balance of $0.025 You Can use the tokens to purchase items from our online super store. Or have the Cash value of tokens you earn,Taken off any order. All Register Members are Given 100 Token Applied to their Membership Account, After your very first order you place with our online store, The Free 100 JH P.S tokens in your account will be available for you to use on any new purchase. When You Place an Order with J.H p&s online store, I offer you a free gift with any order you place with J.H p&s online store. http://home.attbi.com/~johnsonhomestor1/freebeepage32002.htm Click On to see the Free Offer we have with any order. http://home.attbi.com/~johnsonhomestor1/orderingistruction.htm Click on to read about ordering by mail, telephone orders,ordering,through the mail, fax orders, Paypal, and From J.H p&s online Store. I accept all major credit cards, checks and money orders. I offer a Toll Free Telephone number 1-866-236-1208 to place your order. You can also Print out our online order form. The Following is about my Online Features I been offering. I also offer Live help You can Chat with me when I am Online with any questions, comments, concerns or suggestion you may have. http://www.johnsonhome2276.com/default.asp?S=AC3&Document=HOROSCOPES Click on to Read Your Daily Horoscope . http://home.attbi.com/~johnsonhomestor1/gameinstructions.htm Click on over to Learn how to Play our Word search & Banner Bingo games. Games and win weekly Prizes. http://www.johnsonhome2276.com/default.asp?S=AC3&Document=About+Us Click over to learn more about us, Also Join my online store email list, and Send me your feedback about my online super store. http://www.johnsonhome2276.com/default.asp?S=AC3&Document=Our+Policies Click over to read our Policies on Products & Services, also On Shipping Rates. The following are some of the services I am offering and seeking new one to add http://home.attbi.com/~johnsonhomestor1/jhsadvertising.htm Click on over to Check out our great advertising free Offer. Receive your 3 day free trial offer of advertising. After the 3 days are over, you will have the option to buy the service Plus for only $4.95 per month, your text ad will be sent to 13,000 plus email. http://www.ffanet.com/links/JOHNSONHOME2276.htm Click on to Post Your link to our FFA site http://www.ebaymarketer.com/johnsonhome Please Click on to purchase this Ebook for only $24.95.Learn about selling on ebay and making money online. http://home.attbi.com/~johnsonhomestor1/PRESSRELintroduct.htm Click on over to Read our press release. A topic we can all learn and grow From. Thank you for your time, It will be a pleasure serving you. Sincerely, Robert W Johnson owner Johnson Home P & S online Super Store http://www.johnsonhome2276.com Email storemanager2276(a)msn.com To Be Remove from my Email list JHSM(a)attbi.com Under Bill s.1618 TITLE III passed by the 105th US Congress, this letter cannot be considered "Spam" as long as the sender includes contact information & a method of "removal". Click me on to click you off my email list Please Type "Remove Me " in the subject area of your email. Wishing you a Great Week! Welcome to Johnson Home Products & Services http://www.johnsonhome2276.com YOUR COMPLIMENTARY GIFT From Johnson Home P & S Register TODAY! if haven't already. Hurry while supplies Last. Free Gift Offer at my expense. http://home.attbi.com/~johnsonhomestor1/YOUR_COMPLIMENTARY_GIFT.htx

1 0

preprocessing printf/regex strings (like ocaml)
by Oliver George 12 May '02

12 May '02

Hi Haskellers, I'm interested to know why a string translating preprocessor doesn't exist for haskell. It seems to me that it would alleviate printf and regex like problems in an convenient, elegant and type-safe manner. An example of this I came across recently was the ocaml printf statement: # Printf.printf "roar";; roar- : unit = () # Printf.printf "numbers %d %d" 11 23;; numbers 11 23- : unit = () # Printf.printf "a number %d" "word";; This expression has type string but is here used with type int You can see logically how this might work in haskell, compile time evaluation would translate the string into the appropriate native expressions before the statements type is evaluated. I see a similar possibility for regular expression matching, wouldn't it be nice in a haskell script to write: perl like things... msg' = replace "s/love/lust/" msg or, nice regex stuff... main = case match "^(\d+)" of Nothing -> 0 Just (i) -> i the python string notation (str % tuple) would fit really well too... putStrLn "hello %s, you got %d right" % ("oliver", 5) Am I the only one who sees this as being a really valuable extension to haskell? or does it exist and i've just never noticed? cheers, Oliver.

2 1

Wishing you a wonderful day
by Bob Johnson 12 May '02

12 May '02

Welcome to Johnson Home Products & Services http://www.johnsonhome2276.com YOUR COMPLIMENTARY GIFT From Johnson Home P & S Register TODAY! if haven't already. Hurry while supplies Last. Free Gift Offer at my expense. http://home.attbi.com/~johnsonhomestor1/YOUR_COMPLIMENTARY_GIFT.htx

1 0

examples of functional objects
by Pixel 11 May '02

11 May '02

It seems to be hard to have something both abstract and concrete. http://merd.net/pixel/language-study/various/non-mutable-objects-and-subtyp… The first version (file haskell.listing) is quite simple, but the last one (file haskell3.listing) gets pretty hairy: ---------------------------------------- class Show a => Point a where translate :: a -> Double -> a my_length :: a -> Double add :: a -> a -> a pack :: a -> Packed_point unpack :: a -> Points pack = Packed_point data Packed_point = forall a. Point a => Packed_point a data Points = TPoint2d Point2d | TPoint3d Point3d data Point2d = Point2d(Double, Double) deriving Show data Point3d = Point3d(Double, Double, Double) deriving Show ---------------------------------------- is there a simpler solution? thanks! PS: please, don't give me the simple non-OO version, it's already there (haskell3bis.listing), and I give an explaination why i think it's not enough: non-OO Haskell and OCaml versions are the simplest, but do not allow precise enough typing: no distinction between Point2d and Point3d is done at compile time. So the only way to have a function working only on Point3d's is to raise an error when that function is called with a Point2d (see get_z) (of course, compared to dynamically typed languages versions, it's already much better)

1 0

ObjectIO install
by Andre W B Furtado 10 May '02

10 May '02

The INSTALL file that comes with the objectIO files says that one must use the following commands to register the package: $ ghc-pkg -r objectio $ ghc-pkg -a objectio -f pckg.cfg The second command is not recognized as a valid one, and the ghc-pkg help appears showing the correct syntax. I needed to use $ ghc-pkg -a < pckg.cfg in order to get the package correctly registered. Am I missing something or is the INSTALL file wrong? -- Andre

2 1

��ṩ��ڻ��Ӫ��ļ��ѯ
by sales137＠163.com 09 May '02

09 May '02

»¥ÁªÍø·¢Õ¹µœœñÌìÒÑŸ±»Žó¶àµÄÉÌŒÒËùÀûÓÃ£¬ÕâÊÇÍÆ¹ãÉÌŒÒ²úÆ·³É±Ÿ×îµÍÓÖÓÐÐ§µÄÓªÏú²ßÂÔ¡£ µ«ÓÐµÄÈËËäÈ»œšÁ¢µÄÍøÕŸ£¬µ«ÈŽÃ»°ÑÍøÕŸÍÆ¹ã³öÈ¥£»ÓÐµÄÈËÌìÌì¶ŒÉÏÍø£¬µ«ÈŽÃ»°Ñ×ÔŒºµÄ²ú Æ··¢²ŒµœÍøÉÏÈ¥¡£ÏÖÔÚ£¬ÎÒÃÇÍš¹ýÒ»Ð©×šÒµµÄÈíŒþ£¬¿ÉÒÔÒ»ŽÎÐÔµÄ¡¢Œòµ¥µÄ¡¢ÑžËÙµÄœ«ÄúµÄ ÍøÕŸŒ°²úÆ·ÍÆ¹ãµœž÷žöÒýÇæŒ°ÉÌÎñÕŸµãÉÏ£¡ ---ÎÒÃÇµÄ·þÎñ--- 1¡¢Ãâ·Ñ·þÎñ£º Ãâ·ÑÌá¹©¹ØÓÚ»¥ÁªÍøÓªÏú·œ·šµÄŒŒÊõ×ÉÑ¯ 2¡¢²úÆ·ÐÅÏ¢·¢²Œ£º ¹úÄÚÉÌÎñÍøÕŸ·¢²Œ 800žö 100Ôª/ŽÎ ¹úÍâÍøÕŸ·¢²Œ 1500žö 200Ôª/ŽÎ 3¡¢ÍøÕŸÍÆ¹ã£º ÖÐÎÄËÑË÷ÒýÇæµÇÂŒ 350žö 100Ôª/ŽÎ Ó¢ÎÄËÑË÷ÒýÇæµÇÂŒ 3500žö 200Ôª/ŽÎ 4¡¢ÆóÒµÃûÂŒ¹âÅÌ£º ÖÐ¹úÆóÒµÃûÂŒ¹âÅÌ£¬ÏêÏžµÄËµÃ÷ÁË¡°µ¥Î»Ãû³Æ¡¢·šÈËŽú±í¡¢ÍšÑ¶µØÖ·¡¢ÐÐÕþÇø»®ŽúÂë¡¢ µç»°¡¢µç»°·Ö»ú¡¢Ž«Õæ¡¢ Õþ±àÂë¡¢ÓªÒµ·¶Î§¡¢ŸŒÃÐÔÖÊ¡¢ÆóÒµ¹æÄ£¡¢ÐÐÕþÇø»®¡±¡£ ÆóÒµÃûÂŒ¹âÅÌÎªÒ»žöAccessµÄÊýŸÝ¿âÎÄŒþ£¬¹²4,390,659žöÆóÒµ£¬°üº¬100¶àžöÐÐÒµ¡£ ±šŒÛ£ºÕûÌ×1500ÔªÈËÃñ±Ò£šÊÐ³¡ÉÏŽóÔŒÔÚ4000Ôª~5000Ôª£© °ŽÐÐÒµ³öÊÛ£¬Ã¿žöÐÐÒµ£º100ÔªÈËÃñ±Ò3¡¢ÐÅÏ¢ÊÕŒ¯£º 5¡¢ÐÅÏ¢ÊÕŒ¯£º ÐÐÒµÐÅÏ¢¡¢ÆóÒµÄ¿ÂŒ¡¢ÐÐÒµÓÊŒþµØÖ·µÈ£¬¿É°Ž¿Í»§ÒªÇó¶©×ö£¬ŒÛžñÁíÒé¡£ 6¡¢ÍøÕŸœšÉè£º ÍøÕŸÕûÌå²ß»®£¬ÍøÒ³ÉèŒÆŒ°ÖÆ×÷£¬ŒÛžñÁíÒé¡£ ÏëÁËœâžü¶àµÄÄÚÈÝÇëµã»÷ÎÒÃÇµÄÍøÕŸ£ºhttp://www.e137.net Ò»ÈýÆßÍøÂçÓªÏú·þÎñÖÐÐÄ ÒµÎñÁªÏµ£ºmail137(a)163.com ÁªÏµµç»°£º0592-8834438 ¶ÏÈÉú Íø Ö·£ºhttp://www.e137.net Èç¹ûŽËÓÊŒþžøÄúŽøÀŽ²»±ã£¬±íÊŸÇžÒâ£¡

1 0

RE: Using "type"
by Simon Peyton-Jones 09 May '02

09 May '02

GHC currently takes the following (non-Haskell 98) attitude to type synonyms: first expand type synonyms only then check for partial applications of type synonyms then perform type checking So in his case type for f expands to: f :: m () -> m () test :: Int -> Int You can see how the type for test comes out: Thing (Const Int) = Const Int () = Int Now GHC tries to unify m () with Int and fails, as it should. The error message is phrased in terms of the original un-expanded types, which is usually a good thing but on this occasion gives a rather odd looking error message. GHC shouldn't really do this lazy checking unless you say -fglasgow-exts Simon | -----Original Message----- | From: Samuel E. Moelius III [mailto:usmoeliu@mcs.drexel.edu] | Sent: 04 May 2002 20:45 | To: haskell-cafe(a)haskell.org | Subject: Using "type" | | | I apologize if this question has been asked before... | | It seems to me the following code should be legal: | | type Thing m = m () | | type Const a b = a | | f :: Thing m -> Thing m | f x = x | | test :: Thing (Const Int) -> Thing (Const Int) | test = f | | However, GHC gives the following error: | | Couldn't match `Thing m' against `Thing (Const Int)' | Expected type: Thing m | Inferred type: Thing (Const Int) | Expected type: Thing (Const Int) -> Thing (Const Int) | Inferred type: Thing m -> Thing m | | But if you change the definition of Const | | newtype Const a b = MakeConst a | | the code compiles fine. | | Is this the desired behavior? | | Is it the case that when you have quantification of a type | variable of | kind * -> * (in this case, m), that variable may only become | bound to a | type constructor? | | Sam Moelius | | _______________________________________________ | Haskell-Cafe mailing list | Haskell-Cafe(a)haskell.org | http://www.haskell.org/mailman/listinfo/haskell-cafe |

1 0