Dear all,
There are several libraries in haskell for abstract algebra but they
don't seem to cover my use case I was wondering if other people have had
similar issues and if there are any packages I am missing.
What I am prinicpaly interested in is operation on algebraic stuctures
Iain Alexander wrote:
You might want to take a look at
RFC 2445
Internet Calendaring and Scheduling Core Object Specification
Section 4.8.5.4 Recurrence Rule
Another source of inspiration might be the syntax used in remind[1].
/M
[1]: http://www.roaringpenguin.com/products/remind
--
Magnus
You might want to take a look at
RFC 2445
Internet Calendaring and Scheduling Core Object Specification
Section 4.8.5.4 Recurrence Rule
--
Iain Alexander i...@stryx.demon.co.uk
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Hello,
I need some cron-like functionality for long running daemon written in
Haskell.
I want to be able to schedule an event to be run:
1. once, at a specific time
2. some regularly scheduled time
I don't see an existing library to do this, so I am starting work on
my own.
The
Gustavo Villavicencio wrote:
Hi all,
I am trying to understand the algebraic laws and operators
behind a functional expression...
f = g \equiv g* . f
in the Kleisli Star context. Is this right?
Yep.
If it is so, can I combine g*.f with a fork for example?
What do you mean by a fork?
Frank Atanassow said:
Gustavo Villavicencio wrote:
Hi all,
I am trying to understand the algebraic laws and operators
behind a functional expression...
f = g \equiv g* . f
in the Kleisli Star context. Is this right?
Yep.
If it is so, can I combine g*.f with a fork
Hi all,
I am trying to understand the algebraic laws and operators
behind a functional expression. So, for example, I can
understand that the standard length function is a catamorphism,
(| [_0, succ . \pi_2] |)
where _0 is a constant function, . is the
function composition, \pi_2 is a
Gustavo Villavicencio wrote:
Frank Atanassow said:
What do you mean by a fork?
So, the question is, if i have
f : A - T B and g : A - T C
where T is a monad, i.e. an endofunctor, can i combine f and g as
f,g : A - T (BxC)
knowing that T involves side effects?
I guess you are asking: if
Frank Atanassow wrote:
Gustavo Villavicencio wrote:
Hi all,
I am trying to understand the algebraic laws and operators
behind a functional expression...
f = g \equiv g* . f
in the Kleisli Star context. Is this right?
Yep.
Oops, or rather, not quite.
m = g
means
g* m
The
The Kleisli composition (-)* . (-) is sometimes written as (@@):
(@@) :: (Monad m) = (b - m c) - (a - m b) - (a - m c)
(f @@ g) x = let m = f x in m = g
Man, I can't get anything right today. I meant:
(g @@ f) x = let m = f x in m = g
Apologies for the flooding.
Regards,
Frank
10 matches
Mail list logo
