(2012/04/19 23:09), Daniel Bünzli wrote:
Do you have any experience to proof a theorem against event combination term
by using above axiom and event combinators semantics? I'm interested in this
kind of reasoning.
In this post I use the semantics and equational reasoning to understand why
some
(2012/04/19 19:57), Daniel Bünzli wrote:
Le jeudi, 19 avril 2012 à 12:31, Daniel Bünzli a écrit :
If P1 occurs then you start walking back from L, but you don't know where P1 is
so you have to walk down every branch until you find P1 and then walk back from
there up to L to make the update.
Co
Thank you for helping me understand with your explanation.
Your event semantics has two invariant.
1. for all e, t : occurrence of [e] at time [t] is one or zero.
2. if primitive [e] is occurred in time [t], update cycle runs in time [t].
Do you have any experience to proof a theorem against
(2012/04/19 7:32), Daniel Bünzli wrote:
Yes because the semantics of [e] is violated, it has three values at the same
time, the current value during the update cycle, the value 1 and the value 2.
Now suppose I reason about the semantics of [e] in this program, it has a
well-defined outcome *f
First of all, I apologize about my first message. Now I understand React can be
easily adapted to send a value during update cycle by using thunk. To forbid
sending events during update cycle in React is not restriction but design
choice.
(2012/04/18 22:27), Daniel Bünzli wrote:
> and now what
Hello,
Thank you very much for your prompt reply.
(2012/04/18 16:36), Daniel Bünzli wrote:
1) Thread-safety and compositionality. React has no global data structure.
I'm sorry about my misunderstanding that React has a global structure.
2) Semantic issues. As soon as primitive events are tr
Hello,
(2012/04/18 4:23), Daniel Bünzli wrote:
- PEC's update cycle is separated from sending events.
You can send a value to event during update cycle.
What's the semantics if you send two different values to an event during an
update cycle ?
They fires two different event if you send two d
(2012/04/18 2:52), Adrien wrote:
I haven't been able to take more than a close look at PEC but I'm
interested in it (in particular for the ability to send values to
events during the update cycle).
Thank you for your interest in my library.
I've noticed EventSig.scan: val scan : ('a -> 'b ->
Hello lists,
I'm please to announce release PEC version 1.1, a push-based event combinator
library
which is helpful to write event driven systems with purely functional style.
https://github.com/osiire/Pec
PEC is similar to React library but there are some different points.
- PEC's update cyc
t event A has pointer of
event B.
So the event A will be garbage-collected automatically when the reference to
the
event A from application layer disappeared. That is the reason why "no memory
leaks".
Regards,
ogasawara
cheers,
Philippe.
2011/9/15 Satoshi Ogasawara mailto:og
Hello,
I'd like to announce the release of PEC, a push style event combinator.
PEC : https://github.com/osiire/Pec
This small module(about 350 LOC) provides
- a composable event.
- map, choose, never, join and several useful functions.
- immediate reactions corresponds sending data to events.
11 matches
Mail list logo
