comp.lang.haskell Google Group

Transparent results cache

2009-11-18T18:29:07Z

I wrote something that is possibly a bit horrifying. I seem to have got
away with it for now. I don't normally use things like unsafePerformIO
but it occurred to me that I could write a kind of transparent results
cache for functions. I'd certainly be interested in comments about how
I screwed it up or shouldn't even be thinking such awful things. At

Shaved Bare - Shaved Asians Movie

2009-11-04T15:58:12Z

============================== ============================== =============
========= My sister shave her pussy: hidden cam
=========
VVVVVVVVVVVVVVVVVVVVVVVVVVVVVV VVVVVVVVVVVVVVVVVVVVVVVVVVVVVV VVVVVVVVVVVV
========= ENTER HERE:
=========
========= [link]

best buy nike shoes,cheap supra shoes,nike air jordans,jordan fusions,newest SUPRA sneaker,China Cheap Nike Sneakers,Supra Shoes Wholesale Gucci Sneakers

2009-11-04T12:01:28Z

Welcome to visit [link] hottest Nike Shoes, Nike Jordans,
Nike Air Jordans, Air Jordan Fusion,Sell nike shoes air jordan,Jordan
fusions,Air jordan women fusins,AJ fusions,AJ Fusions low,cheap Prada
shoes, Gucci shoes, Adidas shoes, Nike shoes, Puma shoes,Cheap brand
jeans:Coogi pants, Evisu jeans, RMC jeans, Crown Holder, Aftful Dodger

Wholesale Women's and Men's Shoes and sneakers,Discount Prices Supra Shoes,China Factory Cheap Price Sell air Jordan Shoes

2009-11-04T12:00:29Z

happs coming alone?

2009-10-30T04:51:35Z

see this? [link] lisp has a nice webserver

monads for lambda calculus

2009-10-20T05:04:28Z

Greetings Comp.Lang.Haskell Community,
I have a program that serves a lambda calculus reducer, but I want to
play with it and see what various class representations give, such as
functors and monads.
So consider
Then, of course fold,
So that we can give an instance of functor,
Next we can try to write an instance of monads. We have an obvious

* extended deadline: FLOPS 2010: Last Call for Papers *

2009-10-20T02:42:40Z

------------------------------ ------------------------------ ----------------
LAST CALL FOR PAPERS
Tenth International Symposium on Functional and Logic Programming
(FLOPS 2010)
April 19-21, 2010
Sendai, Japan
[link]
** EXTENDED SUBMISSION DEADLINES **

Just beginning problem

2009-10-17T21:52:52Z

I am just beginning to learn Haskell. Just for starters I'm watching a
video lecture from Channel 9. The lecturer defines a function like this
"myadd (x,y) = x + y". When I enter this into GHCi I get the error message
":1:12: parse error on input `='". Could I get a simple explanation of
this?

Rational -> Double conversion?

2009-10-08T09:57:43Z

Hello Haskellers,
I'm a novice Haskell user. I'm wondering how to get an approximate
value in Double of a Rational. I'm doing a little numerical
calculation using Rational to avoid truncation error, but want the
final results printed as Doubles that approximate original Rationals.
(I need this to read the results in Fortran.)

* FLOPS 2010: Last Call for Papers *

2009-10-03T02:42:10Z

Logger monad

2009-10-01T15:16:56Z

It has been a long time since I really had to think about how monads are
implemented so I thought I should take a refresher course, in probably
reinventing the wheel by implementing from scratch a sequential logging
monad I need for a project. The point of it is that client code can
append to it, but not do anything else with it if I hide the Log and

Kenlighten - A social network for knowledge seekers and providers

2009-09-29T07:51:48Z

Dear friends,
I am writing to share with you about a unique social knowledge network
- Kenlighten [link] .
At Kenlighten you can register for a free account and create online
tutorials in your area of expertise by uploading your ebooks,
presentations, articles, videos, audio files. You can also use the

Laziness of sequence

2009-09-18T16:03:25Z

During an interesting discussion in de.alt.sysadmin.recovery we touched
laziness issues of mapM.
Just 4
Just [1,2,3]
_|_
This can be stripped down to the laziness behavior of sequence and from its
definition the strictness issues of (>>=).
Now the question arises, how to define sequence, to allow indefinite long

whither operational semantics?

2009-09-18T00:07:52Z

hi,
sounds like folks criticize haskell (and probably rightly so) for not
having a good definition, so implementations can ethically vary
widely. so which fp actually does have well nailed-down semantics?
plus a useful-in-the-real-world implementation (or two or three)?
thanks.

overflow behavior

2009-09-13T22:39:32Z

Hi
I would like to know if you could point me to a document specifying the
behavior of haskel with integer overflow. I mean when you have two
integers, what happens when you multiply them? Is overflow checked?
Thanks