comp.lang.haskell Google Group

Re: Transparent results cache

2009-11-20T22:23:42Z

Huh, yes, I seem good at reinventing wheels. (The lessons stick with me
better that way though!) Thank you. Some of that code looks rather familiar!
Mmm. I'm hoping that it doesn't become enough of a problem that I have
to try to put together a simple test case that evinces the bug.
Mark

Re: Transparent results cache

2009-11-20T22:13:34Z

You may be interested in this paper:
[link]
And, I do think you probably want NOINLINE on the call of cached (otherwise
the call may be inlined, and you may end up with multiple separately
memoized functions), but I'm not 100% sure. I'm not sure why that'd be

Re: Transparent results cache

2009-11-20T16:14:36Z

I did indeed grow doubtful about where I'd put it and have tried moving
it around and thinking about it more.
Still, now I'm getting the occasional segmentation fault from my code.
I'm not knowingly using threading or concurrency, unless
Control.Parallel.Strategies.rn f does it behind the scenes in a way that

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

Re: happs coming alone?

2009-10-30T17:09:12Z

It's not something I've had to know about. I remember some talk of a
fork - see [link] - but I have no experience with either.
Also, for dynamic sites,
[link] may be useful.
Mark

Re: happs coming alone?

2009-10-30T05:21:50Z

coming along I meant
nice youtube vid by the way
how about some demo sites?
something like a mock craigslist or digg would be cool

happs coming alone?

2009-10-30T04:51:35Z

see this? [link] lisp has a nice webserver

Re: monads for lambda calculus

2009-10-21T07:57:24Z

Exactly. Though in don't see what the latter has to do with the former :-)
If you haven't done already, I recommend reading up on F-Algebras.
Exactly. It's superficial, it's unnatural, it doesn't fit the intended
use. So why insist on it?
In general, they don't necessarily exist. If you look at it categorically,

Re: monads for lambda calculus

2009-10-21T07:13:34Z

Right, that's the point of data in the lambda calculus. Inductive
data types are there own folds. So that
nil = \nc.n
cons a l = \nc. c a (l n c) <=>
cons = \al.\nc.c a (l n c)
Then
fold v f l = l v f <=>
fold = \vfl.lvf
And
map f l = fold nil (\a m. cons (f a) m) l <=>
map = \f l . fold nil (\am.cons (f a) m) l

Re: monads for lambda calculus

2009-10-20T21:59:40Z

BTW, if you define the representation this way, a nice test case is
(\x.x x)(\x.x x). If that doesn't work like it should, you need to improve
the alpha-conversion handling :-)
BTW, one can define fold and (f)map for every covariant ADT, so that's
in no way special to Lambda. Though I think it's a bit roundabout to

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 **

comp.lang.haskell Google Group

Re: Transparent results cache

Re: Transparent results cache

Re: Transparent results cache

Transparent results cache

Shaved Bare - Shaved Asians Movie

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

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

Re: happs coming alone?

Re: happs coming alone?

happs coming alone?

Re: monads for lambda calculus

Re: monads for lambda calculus

Re: monads for lambda calculus

monads for lambda calculus

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

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