- Haskell-Cafe - Haskell.org

Re: HI && TypeCast
by Iavor Diatchki 07 Aug '03

07 Aug '03

hello, this is not supposed to be serious :-) Sebastian Sylvan wrote: > ... > List comprehensions are overrated =) > > How about this: > > concatMap ( (':':) . (:[]) . fst ) [('d',3),('f',3)] > or even better: [('d',3),('f',3)] >>= (':':) . return . fst bye iavor -- ================================================== | Iavor S. Diatchki, Ph.D. student | | Department of Computer Science and Engineering | | School of OGI at OHSU | | http://www.cse.ogi.edu/~diatchki | ==================================================

2 1

why are you waiting
by a_tatarsky2＠saksinc.com 07 Aug '03

07 Aug '03

VIRUS ALERT - YOU MAY BE INFECTED WITHOUT EVEN KNOWING IT a trojan allows hackers complete access to your bookmarks, documents, emails and messanger logs. Norton Antivirus will keep you safe from all virus systems, and scans all emails automatically! btw, you look great today. Purchase Norton Now! http://FDSAPP@softwaresavings2you.biz/default.asp?id=3000 ps. dont want any more of this shit? http://FDSA2PP@softwaresavings2you.biz/remove/remove.html

1 0

Re: Another typing question
by Jon Cast 06 Aug '03

06 Aug '03

I wrote: > Wolfgang Jeltsch <wolfgang(a)jeltsch.net> wrote: > > On Tuesday, 2003-08-05, 15:22, CEST, Nick Name wrote: > > <snip> > > > > This is called "dependent types" and is not a feature of haskell > > > (nor of any language that I know); there was "cayenne" (try a google > > > search) but I don't believe it is still mantained. > > <snip> > > > > BTW, why is there no general interest for such a thing as dependent > > > types? > > > What negative consequences does their implementation have? > > It depends on whether you just want to write functions to take in > values of such types, or whether you want to write functions to return > values of such types. Doing the former uses dependant products, which > would require a significant extension to GHC's guts, but not (AIUI) > inherently unpleasant. Doing the latter (AIUI) essentially requires > dependant sums. Basically, a family of types A_i parameterized by a > value i :: I is written, for long-honored traditional reasons too > complex to get into here, Sigma i::I.A_i. Now, if you have such > dependant sums, there's a bad interaction with polymorphism: either > you must have a type alpha which cannot appear in a family of types > A_i in a dependant sum, or, for any function f :: alpha -> alpha, > there exists a type beta such that f cannot be aplied at either beta > or Sigma i::Int.beta. Clear? Actually, on second thought, I think this could be simplified to: if we have dependant types, then either there is a type which cannot be used in a dependant type, or for every polymorphic function there is a type it cannot be applied at. Jon Cast

4 3

Re: Another typing question
by Jon Cast 05 Aug '03

05 Aug '03

> On Tuesday, 2003-08-05, 15:22, CEST, Nick Name wrote: <snip> > > This is called "dependent types" and is not a feature of haskell > > (nor of any language that I know); there was "cayenne" (try a google > > search) but I don't believe it is still mantained. <snip> > > BTW, why is there no general interest for such a thing as dependent > > types? > What negative consequences does their implementation have? It depends on whether you just want to write functions to take in values of such types, or whether you want to write functions to return values of such types. Doing the former uses dependant products, which would require a significant extension to GHC's guts, but not (AIUI) inherently unpleasant. Doing the latter (AIUI) essentially requires dependant sums. Basically, a family of types A_i parameterized by a value i :: I is written, for long-honored traditional reasons too complex to get into here, Sigma i::I.A_i. Now, if you have such dependant sums, there's a bad interaction with polymorphism: either you must have a type alpha which cannot appear in a family of types A_i in a dependant sum, or, for any function f :: alpha -> alpha, there exists a type beta such that f cannot be aplied at either beta or Sigma i::Int.beta. Clear? The alternative, btw., is to have both dependant sums and an undecidable type-checking problem. > I think, sometimes they could be quite handy. Sure. <Sarcastic comment censored>. Jon Cast

1 0

Another typing question
by Konrad Hinsen 05 Aug '03

05 Aug '03

Is there any way to parametrize a type by a value, rather than another type? What I would like to do is to define "list of length 3" and "list of length 4" as separate parametrization of the same type, such that I could write functions that accept lists (under my new typename) of any length as long as parameters have the same length. The goal is to remove the need for runtime checks all over the code. Konrad.

4 7

Show with Strings
by Thomas L. Bevan 05 Aug '03

05 Aug '03

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Is there any reason why show :: String -> String is not equivalent to 'id' ? At the moment, show "one" = "\"one\"" which leads to problems because it often requires String to be treated as a special case, rather than just a member of Show. Tom -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.2.2 (GNU/Linux) iD8DBQE/Li8QYha8TWXIQwoRApCgAJ49iJcOuf88WTIKVJWBkHF/QyugOwCfS2Gu jcJFn48T4uc+ooeSAaCkAhs= =pIel -----END PGP SIGNATURE-----

3 2

Newbie Design Question
by Tanton Gibbs 05 Aug '03

05 Aug '03

Haskellers, I'm currently working on my first Haskell program. I really like the language so far, though it has been hard to break the OO frame of mind. Normally, I'm a C++/Perl programmer, but I have really enjoyed the type-safety of Haskell over Perl as well as the Hugs interpreter over a make cycle. Since execution time is not important, I haven't found any issues with using Hugs. Now, on to my problem. Our company uses XML to describe our processes. I'm writing a DSL in Haskell that will print that XML out. I've done most of it, but now I'm describing the I/O in the XML. Basically, we have files come in in various formats from various file contributors and we use a mapping program to map the fields to the right spots in the XML. So, for example, one contributor could have the following layout: Field Name Start Pos Length First Name, 1, 10 Last Name, 11, 10 and another contributor could have them in exactly the opposite order. Furthermore, some contributors may have fields that others don't (for example: DOB). I'm now trying to come up with a way to map this information into Haskell dynamically. It would be trivial to create a module for each Contributor and then import all the modules. However, we have hundreds of contributors and it would be a pain to have to change and re-release the program every time we added a new contributor. Therefore, I need someway to take this information and map it into my Haskell structures. I have come up with two options. One would be to let Haskell dynamically import a contributor module (but I don't think that is currently possible); the other would be to use a configuration file and have the user specify the information through it. Is there a standard Config file module? Is there any other way to do this that I missed? Thanks in advance, Tanton Gibbs, Ph.D. Technical Architect Abilitec Knowledge Base Acxiom Corporation Conway, AR 72034

3 2

Persistent storage
by Nick Name 04 Aug '03

04 Aug '03

Is there someone who has implemented some limited form of persistency in haskell? I don't mean the longly-debated persistence of functional values, but something rough, like a persistent MVar with a thread saving modified values every n seconds or so. Vincenzo

2 2

Parsec allocating a lot of memory
by Nick Name 04 Aug '03

04 Aug '03

Hi all, I am using "parsec" to parse the output from "xmame -listinfo" wich is a list of records of the form game ( attr1 value1 ... attrN valueN ) and for approx. 3500 records I got ~250 mb of RSS memory during parsing, wich takes 20 seconds on my athlon 1400. I think that I must have done something wrong (this is the first time I use parsec), here is my parser: --- Begin games = many game game = do openGame x <- manyTill attribute closeGame return (mkGameInfo x) attribute = do whitespaces x <- identifier whitespaces y <- tillEOL return (x,y) openGame = do string "game (" newline closeGame = do string ")" newline newline whitespace = "\v\f\t\r " whitespaces = skipMany (oneOf whitespace) tillEOL = manyTill anyChar newline identifier = many alphaNum --- End Thanks for any advice Vincenzo

2 1

PROMOTION
by SANDER SMITH 04 Aug '03

04 Aug '03

BINGO NETHERLANDS SWEEEPSTAKE LOTTERY NL BURDENSTRAAT21B 1053 DS AMSTERDAM, THE NETHERLANDS TEL NO: +31-611-188-193 FROM: THE DESK OF THE MANAGING DIRECTOR INTERNATIONAL PROMOTION/PRIZE AWARD DEPT REF: HWS/200118308/02 BATCH: 18/203/JJS. ATTN: CEO We are pleased to inform you of the release today the 29th JULY 2003, of the BINGO NETHERLANDS SWEEPSTAKE LOTTERY/INTERNATIONAL PROGRAMMS held on the 10th JULY 2003. Your company name attached to the ticket numbers 564-75600545-188 with serial number 5388/01 drew the lucky numbers 3-11-27-30-34-41, which consequently won the lottery in the 2 category. You have therefore been approved for a lump sum pay out of us$1million in cash credited to file HWS/2001183808/01.this is from a total cash prize of us$10million share the ten international lucky winners in this category. CONGRATULATIONS. Your funds is now deposited with our security department to your name, due to the mixed up of some numbers and names, we ask that you keep this winning a top secret from the public notice until your claims has been processed and your remitted to your account as this is apart of security protocol, to avoid double claiming or unwarranted taking advantage of this program by participants. All participants were selected through a computer ballot system drawn from the 30,000 company and 20,000 individuals� names from all over the world as part of our international promotions program, which we conduct every year. We hope with a part of winning, you will take part in our end of year stake us$50million international lottery. TO begin your claim, please contact your claim agent, Jame Morrison, Foreign Service manager FOREX BUREAU AMSTERDAM, THE NETHERLANDS.TEL:+31-615-264-830,E-Mail:jamemorrison1@europe.com,jamemorrison1@winnIng.com, for processing and remittance of your cash to a designated account of your choice. Remember, all winning must be claiming not later than AUGUST 18th 2003, after this date all funds will be returned as unclaimed. NOTE: In order to avoid unnecessary delays and complications, please remember to quote your reference and batch numbers in every correspondence with your agent. Furthermore, should there be any change of your address, do inform your agent as soon as possible. Congratulations again from all members of our staff and thank you for being part of our promotions program. Sincerely, Sander Smith.

1 0