On 26.09 01:01, David Menendez wrote:
We'll also define the injection combinator from Kieburtz's paper[1]:
(.) :: Functor d = d a - b - d b
d . a = fmap (const a) d
We add some nice combinators:
(-) :: Comonad co = (co a - co b) - (co b - co c) - co a - co c
a - b = b . a
infixr -
(--)
Folks,
Is the procedure of creating shared libraries with Haskell and
loading them from C described somewhere?
Is this even possible?
Thanks, Joel
--
http://wagerlabs.com/
___
Haskell mailing list
Haskell@haskell.org
Dear Dave,
Thanks for the nice propaganda!
A few comments regarding the points you made in your message.
Ineffeciency of fibo-like programs: Your observations are true. But this is a
comonadic interpreter analogous to the cbv monadic interpreter. One can also
define an analogue to the cbn
Hello,
I computing student entering my final year at Northumbria University,
Newcastle upon Tyne. I am doing some research for
my final year project which is to design and build a Syntax Directed Editor for
a high level computing language.
The problem which I have is that I would
Ninth Italian Conference on
Theoretical Computer Science (ICTCS'05)
Certosa di Pontignano (Siena), Italy
October 12 - 14, 2005
http://ictcs05.dsmi.unisi.it
Call for Partecipation
The Ninth Italian Conference on Theoretical Computer
Science
On 25/09/05, Craig Middlemast [EMAIL PROTECTED] wrote:
Hello,
I computing student entering my final year at Northumbria University,
Newcastle upon Tyne. I am doing some research for my final year project
which is to design and build a Syntax Directed Editor for a high level
computing
Hi,
I've been trying to write some code in Haskell and have been
running into trouble not knowing the already built-in IO
functions. For example, is there a function that will take
a line and turn it into a list?
Is there a reference where one can lookup all these things?
Thanks,
Creighton
On Mon, Sep 26, 2005 at 10:19:09AM -0500,
Creighton Hogg [EMAIL PROTECTED] wrote
a message of 13 lines which said:
Is there a reference where one can lookup all these things?
I use:
http://www.zvon.org/other/haskell/Outputglobal/index.html
___
On 26/09/05, Creighton Hogg [EMAIL PROTECTED] wrote:
Hi,
I've been trying to write some code in Haskell and have been
running into trouble not knowing the already built-in IO
functions. For example, is there a function that will take
a line and turn it into a list?
Is there a reference
On Mon, 26 Sep 2005 04:44:37 +0900, Craig Middlemast
[EMAIL PROTECTED] wrote:
I computing student entering my final year at Northumbria University,
Newcastle upon Tyne. I am doing some research for my final year project
which is to design and build a Syntax Directed Editor for a high level
Simon Peyton-Jones wrote:
Hmm. Q is a monad, so I think
fail :: Monad m = String - m a
will do the job.
'recover' should catch the exception, and let you try something else.
So I think I have bug report :)
Haskell-cafe is probably wrong place for this, where do I go now with my
On Mon, 2005-09-26 at 10:36 +0200, Gracjan Polak wrote:
Simon Peyton-Jones wrote:
Hmm. Q is a monad, so I think
fail :: Monad m = String - m a
will do the job.
'recover' should catch the exception, and let you try something else.
So I think I have bug report :)
Haskell-cafe
On Fri, 23 Sep 2005, Marcin Tustin wrote:
Thanks for this: All I have to do now is fix the fact that my maths is
stupidly screwed!
'div' is the integer division and rounds down. You should either use
Rational (or Double) everywhere or use % which builds a ratio from two
integers.
On Sat, 24 Sep 2005, Marcin Tustin wrote:
For some reason the following code is producing an error message from ghci
that the the patterns are non-exhaustive. Does anyone have any idea why that
could be, given that the patterns are, at least in my meaning, provably
exhaustive?
Hello,
I need to zip together multiple lists.
The lists are sorted by date, and each entry in the list represents data for
a time interval.
The time intervals between the lists may be missmatched from each other.
This means that sometimes you don't need to move forward in list, while you
Rene de Visser wrote:
Hello,
I need to zip together multiple lists.
The lists are sorted by date, and each entry in the list represents data
for a time interval.
The time intervals between the lists may be missmatched from each other.
Does a single list have only disjoint intervals?
From: ChrisK [EMAIL PROTECTED]
Rene de Visser wrote:
Does a single list have only disjoint intervals?
Yes. The lists are strictly increasing
Doing this for two lists with a recursive function is easy. There being
an output element whenever the intervals of the two input lists overlap.
Yes, I
On Monday 26 September 2005 17:14, Rene de Visser wrote:
Hello,
I need to zip together multiple lists.
The lists are sorted by date, and each entry in the list represents data
for a time interval.
The time intervals between the lists may be missmatched from each other.
Is this the sort of
Why not have a merging function which takes all lists and merges them
into a single ordered list marked with which list the events came from
and their timestamps. Then you can just traverse this single, merged
list. if I am understanding the problem properly...
John
--
John Meacham -
Doh! ignore me. apparently I understand the problem, but offer nothing
in the way of solution. :)
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
20 matches
Mail list logo
