From mboxrd@z Thu Jan 1 00:00:00 1970 Received: (from weis@localhost) by pauillac.inria.fr (8.7.6/8.7.3) id TAA21185 for caml-red; Tue, 27 Jun 2000 19:55:18 +0200 (MET DST) Received: from concorde.inria.fr (concorde.inria.fr [192.93.2.39]) by pauillac.inria.fr (8.7.6/8.7.3) with ESMTP id EAA26775 for ; Tue, 27 Jun 2000 04:26:26 +0200 (MET DST) Received: from suburbia.net (suburbia.net [203.4.184.1]) by concorde.inria.fr (8.10.0/8.10.0) with ESMTP id e5R2QI511160; Tue, 27 Jun 2000 04:26:19 +0200 (MET DST) Received: by suburbia.net (Postfix, from userid 110) id D8E626C4D7; Tue, 27 Jun 2000 12:26:14 +1000 (EST) To: Pierre Weis Cc: remi.vanicat@labri.u-bordeaux.fr (Remi VANICAT), caml-list@inria.fr Subject: Re: How to cleanly encode "quasi-constants"? References: <200006261019.MAA15798@pauillac.inria.fr> Cc: proff@iq.org From: Julian Assange Date: 27 Jun 2000 12:26:14 +1000 In-Reply-To: Pierre Weis's message of "Mon, 26 Jun 2000 12:19:16 +0200 (MET DST)" Message-ID: User-Agent: Gnus/5.0802 (Gnus v5.8.2) XEmacs/21.1 (Big Bend) MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Sender: weis@pauillac.inria.fr Pierre Weis writes: > have the compiler looping, we thus need to detect looping programs and > this is not trivial (!). This work can be performed by the user with the aid of a device known as a `bordometer'. Compile-time evulation by lisp and scheme compilers is incredibly useful, and I see no particular reason caml could not apply the same technique. Cheers, Julian.