From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Delivered-To: caml-list@yquem.inria.fr Received: from nez-perce.inria.fr (nez-perce.inria.fr [192.93.2.78]) by yquem.inria.fr (Postfix) with ESMTP id CD3DCBC2F for ; Thu, 2 Dec 2004 12:57:22 +0100 (CET) Received: from pauillac.inria.fr (pauillac.inria.fr [128.93.11.35]) by nez-perce.inria.fr (8.13.0/8.13.0) with ESMTP id iB2BvMgX017306 for ; Thu, 2 Dec 2004 12:57:22 +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 MAA05521 for ; Thu, 2 Dec 2004 12:57:22 +0100 (MET) Received: from spartacus.cs.unipr.it ([160.78.167.140]) by nez-perce.inria.fr (8.13.0/8.13.0) with ESMTP id iB2BvLrH017302 (version=TLSv1/SSLv3 cipher=DHE-RSA-AES256-SHA bits=256 verify=NO) for ; Thu, 2 Dec 2004 12:57:21 +0100 Received: from cs.unipr.it (localhost [127.0.0.1]) by spartacus.cs.unipr.it (8.12.8/8.12.8) with ESMTP id iB2Bv5xe018243 for ; Thu, 2 Dec 2004 12:57:05 +0100 Message-ID: <41AF0311.7040700@cs.unipr.it> Date: Thu, 02 Dec 2004 12:57:05 +0100 From: Roberto Bagnara Organization: Department of Mathematics, University of Parma, Italy User-Agent: Mozilla/5.0 (X11; U; Linux i686; en-US; rv:1.6) Gecko/20040116 X-Accept-Language: it, en-us, en MIME-Version: 1.0 To: caml-list@inria.fr Subject: Automatic complexity analysis of OCaml programs Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit X-Miltered: at nez-perce with ID 41AF0322.000 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)! X-Miltered: at nez-perce with ID 41AF0321.000 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)! X-Spam: no; 0.00; ocaml:01 pointers:01 ocaml:01 subset:01 pointers:01 roberto:06 roberto:06 group:06 written:06 mathematics:06 complexity:07 complexity:07 analysis:08 analysis:08 university:08 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: 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