I have a very efficient C implementation wrapped properly in OCaml here:
https://github.com/alexy/katz/blob/master/kendall.ml
A+
On Thu, Apr 19, 2012 at 7:51 PM, Francois Berenger wrote:
> Hello,
>
> Is there some Kendall tau implementation out there in OCaml?
>
> I'm looking for something with
Hello,
Is there some Kendall tau implementation out there in OCaml?
I'm looking for something with better complexity than N^2, if
that's possible, as I have a lot of points...
Regards,
F.
--
Caml-list mailing list. Subscription management and archives:
https://sympa-roc.inria.fr/wws/info/caml
**
2nd CALL FOR INFORMAL PRESENTATIONS - DEADLINE MAY 11th, 2012:
TURING CENTENARY CONFERENCE
http://www.cie2012.eu
Computability in Europe 2012: How the World Computes
*To be removed from our mailing list, please respond to this message with
UNSUBSCRIBE in the subject*
*
2012 INTERNATIONAL SPRING SCHOOL IN NATURAL COMPUTING
SSNC 2012
Tarragona, Spain
May 28 June 1st, 2012
August 2010:
Now also posting to the web via Twitter at:
http://twitter.com/Northern_Clips
Hi...
As of January 16, 2004 - I am no longer working for the Nunavut Department of
Education.. I am no longer moderating the Haa Ai e-mail list at
http://groups.yahoo.com/group/haa-ai
so I have stared a n
Hello,
On 19 Apr 2012, at 02:56, Francois Berenger wrote:
> I'm curious, what is it used for?
>
> Is it for people doing proof checkers or things like this?
>
Like that, yes:
We successfully use it for reducing the size of programs we want to perform
model checking on. My concrete target are
Le jeudi, 19 avril 2012 à 15:02, Satoshi Ogasawara a écrit :
> 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].
Yes. You can read about the denotational seman
(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
Le jeudi, 19 avril 2012 à 12:31, Daniel Bünzli a écrit :
> While I'm not very fond of the sub/unscribe part I think it's an interesting
> implementation and may try, once I get some time, to adapt it to React to see
> what we can get from it (I also think that the resulting implementation coul
Le jeudi, 19 avril 2012 à 10:59, Satoshi Ogasawara a écrit :
> If I understand correctly sending [v] to [e] immediately during update cycle
> are violate the semantics because it cause more than one values on one event
> at
> the same time.
Yes.
> Using React,
>
> let e, sender = E.create (
CALL FOR PARTICIPATION iFM & ABZ 2012
**
9th International Conference on Integrated Formal Methods (iFM 2012)
3rd International Conference on ASM, Alloy, B, VDM, and Z (ABZ 2012)
Joint conferences in honour of Egon Boerger's 65t
(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
13 matches
Mail list logo
