Re: OCaml and tail recursion

From: Jean-Francois Monin (JeanFrancois.Monin@cnet.francetelecom.fr)
Date: Wed Dec 15 1999 - 15:10:16 MET


Date: Wed, 15 Dec 1999 15:10:16 +0100
Message-Id: <199912151410.PAA08626@lsun565.lannion.cnet.fr>
From: Jean-Francois Monin <JeanFrancois.Monin@cnet.francetelecom.fr>
To: caml-list@inria.fr
Subject: Re: OCaml and tail recursion
In-Reply-To: <19991214222015.46916@pauillac.inria.fr>
        <19991214222015.46916@pauillac.inria.fr>

Since it is not always immediate to see if a function is
tail-recursive, a kind of compile time "assert" could be useful to
check this. E.g. some memory leaks could be prevented in this way.

  Jean-Francois



This archive was generated by hypermail 2b29 : Sun Jan 02 2000 - 11:58:29 MET