On Pi, 2009-11-06 at 17:25 -0500, Brent Yorgey wrote:
On Fri, Nov 06, 2009 at 03:29:47PM +, Stephen Tetley wrote:
Hello all,
Are any of the of the more exotic recursion schemes definable without
a least-fixed point /Mu/ type?
Note that Haskell datatypes have a built-in implicit mu
Matus Tejiscak wrote:
On Pi, 2009-11-06 at 17:25 -0500, Brent Yorgey wrote:
On Fri, Nov 06, 2009 at 03:29:47PM +, Stephen Tetley wrote:
Hello all,
Are any of the of the more exotic recursion schemes definable without
a least-fixed point /Mu/ type?
Note that Haskell datatypes have a
Matus Tejiscak wrote:
zygohistomorphic prepromorphisms
Please tell me this isn't a real technical term. o_O
As for concrete suggestions... I've always thought we could do more to
use static information about the program to aid runtime GC. It's no deep
secret that destructive updates are
2009/11/5 Andrew Coppin andrewcop...@btinternet.com:
Matus Tejiscak wrote:
zygohistomorphic prepromorphisms
Please tell me this isn't a real technical term. o_O
http://www.haskell.org/haskellwiki/Zygohistomorphic_prepromorphisms
Still can't tell if it's a joke or not...
--
Deniz Dogan
Andrew,
As for concrete suggestions... I've always thought we could do more
to use static information about the program to aid runtime GC. It's
no deep secret that destructive updates are essentially like a
compile-time / coding-time GC operation. You determine before
runtime that the
And we wonder why Haskell isn't mainstream...
On Thu, Nov 5, 2009 at 4:31 PM, Deniz Dogan deniz.a.m.do...@gmail.com wrote:
2009/11/5 Andrew Coppin andrewcop...@btinternet.com:
Matus Tejiscak wrote:
zygohistomorphic prepromorphisms
Please tell me this isn't a real technical term. o_O
Deniz Dogan wrote:
2009/11/5 Andrew Coppin andrewcop...@btinternet.com:
Matus Tejiscak wrote:
zygohistomorphic prepromorphisms
Please tell me this isn't a real technical term. o_O
http://www.haskell.org/haskellwiki/Zygohistomorphic_prepromorphisms
Still can't tell if it's a joke or not...
On Thu, Nov 5, 2009 at 11:11 PM, Andrew Coppin
andrewcop...@btinternet.com wrote:
Matus Tejiscak wrote:
zygohistomorphic prepromorphisms
Please tell me this isn't a real technical term. o_O
You can even generalize them:
g_prepro_zygo :: (Functor f, Comonad w) = GAlgebra f w b - Dist f w
-
Stefan Holdermans wrote:
http://people.cs.uu.nl/stefan/pubs/hage08heap.html
Getting connection refused on that.
Erik
--
--
Erik de Castro Lopo
http://www.mega-nerd.com/
___
2009/11/6 Erik de Castro Lopo mle...@mega-nerd.com:
Stefan Holdermans wrote:
http://people.cs.uu.nl/stefan/pubs/hage08heap.html
Getting connection refused on that.
Try this one, from Google's cache:
http://preview.tinyurl.com/ydjuw2j
--
Deniz Dogan
2009/11/6 Deniz Dogan deniz.a.m.do...@gmail.com:
2009/11/6 Erik de Castro Lopo mle...@mega-nerd.com:
Stefan Holdermans wrote:
http://people.cs.uu.nl/stefan/pubs/hage08heap.html
Getting connection refused on that.
Try this one, from Google's cache:
http://preview.tinyurl.com/ydjuw2j
Erik,
http://people.cs.uu.nl/stefan/pubs/hage08heap.html
Getting connection refused on that.
Don't know: it still works for me.
Cheers,
Stefan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Stefan Holdermans wrote:
Erik,
http://people.cs.uu.nl/stefan/pubs/hage08heap.html
Getting connection refused on that.
Don't know: it still works for me.
Working for me as well now.
Cheers,
Erik
--
--
Erik de
Hello, -Cafe,
I'm looking for an interesting topic to hack on in my thesis.
The thesis should be rather theoretical/abstract (writing a mail
client in Haskell is not, for example), dealing with FP or related
fields. I've had a few (blurry) ideas, ranging from investigating
(possibilities for)
14 matches
Mail list logo