- Haskell-Cafe - Haskell.org

Constructing Cases
by Carl McTague 27 May '02

27 May '02

Hi there, is there a simple way to carry out the following type of conversion? Suppose I have a list (finite) of (value,image) pairs such as: list = [(0,1),(1,0)] >From this I want to generate a function f 0 = 1 f 1 = 0 Is there a way to do this? Note, I don't want to define a function that searches through the list each time it is invoked, I want to generate the function once and have it be as fast as the pattern-matcher can make it. So, I'm looking for a function g :: [(a,b)] -> a -> b Is this simple to do? Thanks, Carl

4 4

Segmentation fault
by ck15 23 May '02

23 May '02

Hi, I am getting a segmentation fault , when I execute a code in hugs. (only some times) What are the conditions that give rise to a segmentation fault , when executing a Haskell code in hugs? I would appreciate very much if some could spare some time to help me. Thanks Chitra

2 1

�𾴵��Ͽͻ��Ǻ�!
by web 22 May '02

22 May '02

�𾴵��Ͽͻ��Ǻ�! ��繫˾(http://www.oydns.com)��վ��¸İ棬��ҵ�ʾֹ��ϵͳҲ�� °汾(IMail Server Web Messaging v7.04)��Ϊ��С��ҵ��ṩ�Լ۱�� ŵĲ�Ʒ��ڴ��Ƴ��²�Ʒ�� 1��200M ��HTML�ռ�+1��ʶ��150Ԫ/�� 2��100M ASP��ռ�+100��ҵ�ʾ�+1��ʶ��+20M ACCESS��ݿ⣬��288Ԫ/�� 3��300M ASP��ռ�+300��ҵ�ʾ�+1��ʶ��+100MACCESS��ݿ⣬��488Ԫ/�� ҹ�˾�Ŀռ䣬��ֲ��˾ע��ģ�ֻ�뽫��DNS�ĳ��ǹ�˾�Ļ�� ֱ��ת��˾��Ŷ��в��֮��Ÿ�֪��䣬�Ա㼰ʱ��ҵ��ʼ��б��ɾ��! �ɹ��Żݶ�ࡣ��ӭ��Ҷ��0592-5567025ת81��QQ��755139��ѯ�� Ʒ��ѡ��----- ��棺http://www.oydns.com --------------------------------------------------------------- �е�Ⱥ��ʼ�,��ר��(http://www.21cmm.com) ��CMM��У(http://www.21cmm.com)��Ŀ��ר��

1 0

RE: Re: Fixed point of n-mutually recursive functors
by gonflores＠guay.com 22 May '02

22 May '02

> I don't think this is possible in plain Haskell 98. > It is possible in Generic Haskell, see: > http://www.generic-haskell.org/ > [...] > Generic Haskell's type system is sufficient. > > Is it possible using dependent types? > > I would expect so. I have been looking to Generic Haskell and it may be possible to define a generic map function like: mapN :: (a1 -> b1) -> ... -> (aN -> bN) -> f a1 ... aN -> f b1 ... bN However, I still don't know how could I define something like: > data FixN1 f1 ... fN = InN1 (f1 (FixN1 f1 ... fN) ... (FixNN f1 ... fN)) > ... > data FixNN f1 ... fN = InNN (fN (FixN1 f1 ... fN) ... (FixNN f1 ... fN)) I think that I would need dependent types, because I want to define a number of data types that depend on a given natural...any suggestions? Best regards, Gonzalo Flores

1 0

convering Fds to Handles
by Abraham Egnor 22 May '02

22 May '02

Is there a way to convert an Fd variable to a Handle variable? Specifically, I'd like to use "pipe" from the Posix library to create a pipe and then pass one end of it to runProcess as its stdin. Abe

6 11

Fixed point of n-mutually recursive functors
by gonflores＠guay.com 22 May '02

22 May '02

I am able to define the fixed point of a functor as > data Fix f = In (f (Fix f)) where I can also define the type class > class Functor1 f > where map1 :: (a -> b) -> f a -> f b I can also define the fixed-point of 2 mutually recursive bifunctors as: > data Fix21 f g = In21 (f (Fix21 f g) (Fix22 f g)) > data Fix22 f g = In22 (g (Fix21 f g) (Fix22 f g)) where bifunctors can be captured in the type class > class Functor2 f > where map2 :: (a1 -> b1) -> (a2 -> b2) -> f a1 a2 -> f b1 b2 Now, I would like to generalize those definitions to n-functors. Is it possible? If it isn't, what kind of type system would I need? Is it possible using dependent types? I would also appreciate any points to literature using n-mutually recursive functors. Best regards, Gonzalo Flores

2 1

derivative (S f g) ?
by Conal Elliott 22 May '02

22 May '02

This isn't really a Haskell question, but I'm hoping a fellow Haskeller might have some helpful pointers. Has anyone seen a generalization of the chain rule for derivatives that applies to applications of the S combinator? The conventional chain rule applies to the more restricted composition combinator: D (f . g) = (D f . g) * D g Where D is the differentiation higher-order function, "*" is multiply lifted pointwise to functions (\ a b x -> a x * b x), and "." is function composition. Thanks, - Conal

2 1

(no subject)
by Andy Fugard 22 May '02

22 May '02

* * * * * * * * * * * * * * * * * * * * * * * Get your free @ecosse.net account http://www.ecosse.net Scotland's Free Internet Service Provider * * * * * * * * * * * * * * * * * * * * * * *

1 0

Re: SUGGESTION: haskell-announce mailing list
by Jens Petersen 22 May '02

22 May '02

"Simon Marlow" <simonmar(a)microsoft.com> writes: > I'm happy to set up and moderate > haskell-announce(a)haskell.org if there's a general > consensus that this would be a useful thing. I think there are enough announcements on the haskell list, to warrant having a separate announce list. It would make filtering announcements to a separate folder much easier too. > As to whether we should merge haskell and haskell-café - > personally I wasn't in favour of the split at the time, > but I recall that support was roughly 50/50 in favour. > Unless there's an overwhelming majority in favour of a > merge I suggest we leave things as they are. I don't have a strong opinion on this either way, however I agree with some of the earlier comments that it only really makes sense to have two different lists if their agenda are more clearly distinct. (IMHO "cafe" is too vague.) Jens

3 2

SAVE 40-50% at Gift Caravan - coupon included xp
by giftcaravan＠usa.com 20 May '02

20 May '02

****************************************************************************** You are receiving this email because you or someone you know requested that you receive a special promotion from Gift Caravan, or you have been selected for this special promotion. To be removed from this list, please see below. ***************************************************************************** WELCOME to the Gift Caravan Super sale. For a limited time you can save BIG $$$ at Gift Caravan. Right now during our Spring sale you can save up to 50% on all items. Save on Home & Garden Decor, Candles and Votives, Collectibles, Porcelain Dolls, Wind Chimes, Trinket Boxes, Novelties and much, much more! Please accept the following coupon as a welcoming gift: # GCCB44 for a 20% discount Use this coupon to SAVE 20% Plus... Orders under $50 get additional 10% off. Orders over $50 get an additional 20% off. Orders over $100 get an additional 30% off. WOW! So, an order over $100 gets 30% off plus use the coupon above for another 20% off, for a total of 50% off. That's Savings... Coupon valid on all items. Visit us now! http://www.giftcaravan.com Coupon Code: GCCB44 HURRY! This is a limited time offer. Regards, Promo Dept http://www.giftcaravan.com ******************************************************************************* ALL Remove requests AUTOMATICALLY honored upon receipt Reply to the following email address offlist777@hotmail.com?subject=remove *******************************************************************************

1 0