June 2002 - Haskell - Haskell.org

ASSISTANCE NEEDED
by WILLIAMS KOJO 19 Jun '02

19 Jun '02

WILLIAMS KOJO. AUDITING AND ACCOUNTING UNIT. FOREIGN REMITTANCE DEPT. ECO BANK,LOME- TOGO. Dear Sir, I am WILLIAMS KOJO, the director in charge of auditing and accounting section of Eco Banque Lome,Republic of Togo with due respect and regard. I have decided to contact you on a business transaction that will be very beneficial to both of us at the end of the transaction. During our investigation and auditing in this bank, my department came across a very huge sum of money belonging to a deceased person who died on november 1997 in a plane crash and the fund has been dormant in his account with this Bank without any claim of the fund in our custody either from his family or relation before our discovery to this development. Although personally,I keep this information secret within myself and partners to enable the whole plans and idea be profitable and successful. During the time of execution. The said amount was us$10M(Ten million united states dollarS Meanwhile all the whole arrangement to put claim over this fund as the bonafide next of kin to the deceased, get the required approval and transfer this money to a foreign account has been put in place and directives and needed information will be relayed to you as soon as you indicate your interest and willingness to assist us and also benefit your self to this great business opportunity. In fact I could have done this deal alone but because of my position in this country as a civil servant,we are not allowed to operate a foreign account and would eventually raise an eye brow on my side during the time of transfer because I work in this bank. This is the actual reason why it will require a second party or fellow who will forward claims as the next of kin with affidavit of trust of oath to the Bank and also present a foreign account where he will need the money to be re-transferred into on his request as it may be after due verification and clarification by the correspondent branch of the bank,where the whole money will be remitted from to your own designation bank account. I will not fail to inform you that this transaction is 100% risk free. On smooth conclusion of this transaction, you will be entitled to 30% of the total sum as gratification, while 70% will be for me and my partners. Please,you have been adviced to keep top secret as we are still in service and intend to retire from service after we conclude this deal with you. I will be monitoring the whole situation here in this bank until you confirm the money in your account and ask us to come down to your country for subsequent sharing of the fund according to percentages previously indicated and further investment, either in your country or any country you advice us to invest in.All other necessary information will be sent to you when I hear from you. I suggest you get back to me as soon as possible stating your wish in this deal.You can also call me on phone 228 911 49 94 for phone discussions Best Regard, WILLIAMS KOJO.

1 0

Re: ANNOUNCE: Happy version 1.13
by Wolfgang Jeltsch 19 Jun '02

19 Jun '02

On Wednesday, 2002-06-19, 16:43, CEST Simon Marlow wrote: > [...] > released primarily to add support for generating code that works with > newer GHC versions (>= 5.03) By the way, when is the first stable release of GHC 5.03 expected to be released? > [...] Wolfgang

1 0

ANNOUNCE: Happy version 1.13
by Simon Marlow 19 Jun '02

19 Jun '02

ANNOUNCING Happy 1.13 - The LALR(1) Parser Generator for Haskell ------------------------------------------------------------------ Happy 1.13 is a small increment over 1.11, released primarily to add support for generating code that works with newer GHC versions (>= 5.03), because some libraries have moved around as part of the move towards hierarchical libraries. Support for other Haskell 98 compilers remains as before. NOTE: Happy version 1.13 will be *required* for building newer versions of GHC shortly. If you build GHC from source, get this release, or build it from CVS. Happy is available in source form, which can be compiled with GHC version 4.xx or 5.xx (4.08+ recommended), and we also provide binaries for some architectures. The Happy homepage with links to the various distributions lives at: http://www.haskell.org/happy/ Please send any bug reports and comments to simonmar(a)microsoft.com.

1 0

% 6,95
by finans400 19 Jun '02

19 Jun '02

1 0

�𾴵��Ͽͻ��
by syhua3000 19 Jun '02

19 Jun '02

�𾴵��Ͽͻ�� ã� www.8dns.netΪ�˴�л��Լ��ͻ��˾��֧�ֺ��Σ��ٴ��¾ɷ��ܣ��… ��ȫ��ͬʱ��ǻ��˲�Ʒ �۸��ܸ��ʵķ��񡣣��˾��վ��ȫ�¸İ棺www.8dns.net�� 200M HTML�ռ�+1��۸�150Ԫ/�� 100M�ռ�(֧��ASP)+100M��ҵ�ʾ�+20M ACCESS��ݿ�+1�� 288Ԫ/�� 200M�ռ�(֧��ASP)+200M��ҵ�ʾ�+30M Access��ݿ�+1�� 338Ԫ/�� ֻ��ۼ۸񡣻�ӭѡ��Ҳ��ӭ��Ϊ��ǵĴ��! ��ǻ��и��Żݼ۸�� http://www.8dns.net �� ===================================================================== ��ʼ��õ��˵��Ϣ��˵��û�ã��ֱ�Ǹ�� ʼ��Գ�ŵֻ��һ�Ρ��ϣ��Ǵ��б��ɾ��ĵ�ַ��š�лл��<br> ===================================================================== --------------------------------------------------------------- �е�Ⱥ��ʼ�,��ר��(http://www.21cmm.com) ��CMM��У(http://www.21cmm.com)��Ŀ��ר��

1 0

Re: slightly too(?) complex list pattern matching
by Yoann Padioleau 18 Jun '02

18 Jun '02

Hal Daume III <hdaume(a)ISI.EDU> writes: > Hi all, > > I don't think I can do this, but I figured I'd ask anyway. Suppose I > have: > > > data X = X | Y | Z > > and I want to match against a list of Xs. But all I want is to ensure > that there's a Y followed by a Z, but I don't care if there's anything > else (or lots of other stuff) in between. Namely, I want to match: > > .*Y.*Z.* I think that http://www.dcs.gla.ac.uk/~meurig/regexp has some stuff for you > > Now, I can match YZ.* easily with: > > > foo (X:Y:_) = ... > > furthermore, my matches never require any backtracking, so you won't see > something like ".*X.*Y.*X.*Z" which could possibly make you backtrack (so, > there are no duplicates in what I'm matching against). > > Anway, the current way I do this is by having a function: > > > match [] _ = True > > match (m:ms) (x:xs) > > | m == x = match ms xs > > | otherwise = match (m:ms) xs > > (Actually, I do a bit more -- I return Maybe [Int] where Nothing signifies > that the match failed and Just intList specifies the indices of the > matched elements, but this is superfluous). > > so this requires me to write things like: > > > foo l > > | Just indices <- [X,Y] `match` l = > > let [x,y] = map (l!!) indices > > in ... > > instead of the nice haskellesque syntax: > > > foo [..,x@X,..,y@Y,..] = ... > > anyway, I'm curious if anyone else has pounded against this wall at all > and if there's any tool (drift, or something perhaps) that would allow me > to write more succinct versions? > > Thanks! > > - Hal > > -- > Hal Daume III > > "Computer science is no more about computers | hdaume(a)isi.edu > than astronomy is about telescopes." -Dijkstra | www.isi.edu/~hdaume > > _______________________________________________ > Haskell mailing list > Haskell(a)haskell.org > http://www.haskell.org/mailman/listinfo/haskell > -- Yoann Padioleau, INSA de Rennes, France, Opinions expressed here are only mine. Je n'écris qu'à titre personnel. **____ Get Free. Be Smart. Simply use Linux and Free Software. ____**

1 0

slightly too(?) complex list pattern matching
by Hal Daume III 17 Jun '02

17 Jun '02

Hi all, I don't think I can do this, but I figured I'd ask anyway. Suppose I have: > data X = X | Y | Z and I want to match against a list of Xs. But all I want is to ensure that there's a Y followed by a Z, but I don't care if there's anything else (or lots of other stuff) in between. Namely, I want to match: .*Y.*Z.* Now, I can match YZ.* easily with: > foo (X:Y:_) = ... furthermore, my matches never require any backtracking, so you won't see something like ".*X.*Y.*X.*Z" which could possibly make you backtrack (so, there are no duplicates in what I'm matching against). Anway, the current way I do this is by having a function: > match [] _ = True > match (m:ms) (x:xs) > | m == x = match ms xs > | otherwise = match (m:ms) xs (Actually, I do a bit more -- I return Maybe [Int] where Nothing signifies that the match failed and Just intList specifies the indices of the matched elements, but this is superfluous). so this requires me to write things like: > foo l > | Just indices <- [X,Y] `match` l = > let [x,y] = map (l!!) indices > in ... instead of the nice haskellesque syntax: > foo [..,x@X,..,y@Y,..] = ... anyway, I'm curious if anyone else has pounded against this wall at all and if there's any tool (drift, or something perhaps) that would allow me to write more succinct versions? Thanks! - Hal -- Hal Daume III "Computer science is no more about computers | hdaume(a)isi.edu than astronomy is about telescopes." -Dijkstra | www.isi.edu/~hdaume

1 0

�𾴵��Ͽͻ��
by syhua3000 17 Jun '02

17 Jun '02

�𾴵��Ͽͻ�� ã� www.8dns.netΪ�˴�л��Լ��ͻ��˾��֧�ֺ��Σ��ٴ��¾ɷ��ܣ��… ��ȫ��ͬʱ��ǻ��˲�Ʒ �۸��ܸ��ʵķ��񡣣��˾��վ��ȫ�¸İ棺www.8dns.net�� 200M HTML�ռ�+1��۸�150Ԫ/�� 100M�ռ�(֧��ASP)+100M��ҵ�ʾ�+20M ACCESS��ݿ�+1�� 288Ԫ/�� 200M�ռ�(֧��ASP)+200M��ҵ�ʾ�+30M Access��ݿ�+1�� 338Ԫ/�� ֻ��ۼ۸񡣻�ӭѡ��Ҳ��ӭ��Ϊ��ǵĴ��! ��ǻ��и��Żݼ۸�� http://www.8dns.net �� ===================================================================== ��ʼ��õ��˵��Ϣ��˵��û�ã��ֱ�Ǹ�� ʼ��Գ�ŵֻ��һ�Ρ��ϣ��Ǵ��б��ɾ��ĵ�ַ��š�лл��<br> ===================================================================== --------------------------------------------------------------- �е�Ⱥ��ʼ�,��ר��(http://www.21cmm.com) ��CMM��У(http://www.21cmm.com)��Ŀ��ר��

1 0

Re: runIO (?)
by Ashley Yakeley 17 Jun '02

17 Jun '02

At 2002-06-16 16:20, Andre W B Furtado wrote: >I'd like to run some IO operations in a Monad (other than the IO Monad). Is >there any kind of "runIO" to do this? No (unless your monad encapsulates the IO monad). -- Ashley Yakeley, Seattle WA unsafePerformIO is NOT Haskell!

1 0

runIO (?)
by Andre W B Furtado 17 Jun '02

17 Jun '02

I'd like to run some IO operations in a Monad (other than the IO Monad). Is there any kind of "runIO" to do this? (One approach is to make my Monad to encapsulate the IO Monad, but I'd not like to do this for other reasons). Thanks a lot, -- Andre

1 0