From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Delivered-To: caml-list@yquem.inria.fr Received: from concorde.inria.fr (concorde.inria.fr [192.93.2.39]) by yquem.inria.fr (Postfix) with ESMTP id A835EBC2F for ; Thu, 2 Dec 2004 15:58:54 +0100 (CET) Received: from pauillac.inria.fr (pauillac.inria.fr [128.93.11.35]) by concorde.inria.fr (8.13.0/8.13.0) with ESMTP id iB2Ewsuu008519 for ; Thu, 2 Dec 2004 15:58:54 +0100 Received: from nez-perce.inria.fr (nez-perce.inria.fr [192.93.2.78]) by pauillac.inria.fr (8.7.6/8.7.3) with ESMTP id PAA13677 for ; Thu, 2 Dec 2004 15:58:53 +0100 (MET) Received: from smtp10.wanadoo.fr (smtp10.wanadoo.fr [193.252.22.21]) by nez-perce.inria.fr (8.13.0/8.13.0) with ESMTP id iB2Ewr5M012565 for ; Thu, 2 Dec 2004 15:58:53 +0100 Received: from me-wanadoo.net (unknown [127.0.0.1]) by mwinf1003.wanadoo.fr (SMTP Server) with SMTP id 7485D20002F5; Thu, 2 Dec 2004 15:58:53 +0100 (CET) Received: from nono (ARouen-106-1-34-195.w81-48.abo.wanadoo.fr [81.48.71.195]) by mwinf1003.wanadoo.fr (SMTP Server) with SMTP id 010A720002E9; Thu, 2 Dec 2004 15:58:52 +0100 (CET) Message-ID: <003101c4d87f$9ec0d3e0$0100a8c0@mshome.net> From: =?iso-8859-1?Q?Fr=E9d=E9ric_Gava?= To: "Roberto Bagnara" , References: <41AF0311.7040700@cs.unipr.it> Subject: Re: [Caml-list] Automatic complexity analysis of OCaml programs Date: Thu, 2 Dec 2004 16:00:09 +0100 MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 8bit X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 5.50.4133.2400 X-MimeOLE: Produced By Microsoft MimeOLE V5.50.4133.2400 X-Miltered: at concorde with ID 41AF2DAE.000 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)! X-Miltered: at nez-perce with ID 41AF2DAD.001 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)! X-Spam: no; 0.00; gava:01 gava:01 caml-list:01 ocaml:01 inference:01 bernd:01 metayer:01 mads:01 cheers:01 caml-list:01 ocaml:01 pointers:01 subset:01 pointers:01 beginner's:01 X-Spam-Checker-Version: SpamAssassin 3.0.0 (2004-09-13) on yquem.inria.fr X-Spam-Status: No, score=0.0 required=5.0 tests=none autolearn=disabled version=3.0.0 X-Spam-Level: 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" To: 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 >