[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: | 2004-12-02 (14:58) |
From: | Frédéric_Gava <frederic.gava@w...> |
Subject: | Re: [Caml-list] Automatic complexity analysis of OCaml programs |
Hi, See the works of - Kevin Hammond about inference cost equation. - Bernd Grobauer about cost recurrence for DML programs, - Whei-Nagan and Siau-Chaeng Khoo about sized types, - Daniel Le metayer, ACE an automatic complexity evaluator, - Brian Reistad and David K. Gifford about satic dependent costs for estimating program excution time - Mads Rosendahl: "automatic complexity analysis" (cost of extracted nuprl programs) Cheers, Frédéric Gava ----- Original Message ----- From: "Roberto Bagnara" <bagnara@cs.unipr.it> To: <caml-list@inria.fr> Sent: Thursday, December 02, 2004 12:57 PM Subject: [Caml-list] Automatic complexity analysis of OCaml programs > > I am looking for references and pointers to existing > works concerning the automatic or semiautomatic > complexity analysis of programs written in OCaml or > in a subset of it. Pointers to the literature > and to available implementations are both very welcome. > Many thanks in advance, > > Roberto > > -- > Prof. Roberto Bagnara > Computer Science Group > Department of Mathematics, University of Parma, Italy > http://www.cs.unipr.it/~bagnara/ > mailto:bagnara@cs.unipr.it > > _______________________________________________ > Caml-list mailing list. Subscription management: > http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list > Archives: http://caml.inria.fr > Beginner's list: http://groups.yahoo.com/group/ocaml_beginners > Bug reports: http://caml.inria.fr/bin/caml-bugs >