RE: optimization and purity

From: John Skaller (
Date: Sat Jul 24 1999 - 14:45:41 MET DST

Message-Id: <>
Date: Sat, 24 Jul 1999 22:45:41 +1000
To: Andrew Kennedy <>,
From: John Skaller <>
Subject: RE: optimization and purity
In-Reply-To: <7CD674FF54FBD21181D800805F57CD5488B073@RED-MSG-44>

At 08:48 23/07/99 -0700, Andrew Kennedy wrote:
>> -----Original Message-----
>> From: Markus Mottl []
>> Subject: optimization and purity
>> I would like to know whether anyone has already thought about means of
>> indicating or inferring purity of functions.

>You are indeed correct that knowing the purity of functions would permit a
>number of optimisations such as the loop-hoisting example you present.

        Actually, I'm quite interested in the same thing
from a different angle: rather than being concerned with
_compiler_ code optimisation, I'm concerned with human ability
to reason about code: ocaml loses the simplicity of reasoning about
derived from referential transparency available in 'pure' functional
languages. (But of course the two things are strongly related)

John Skaller email:
                phone: 61-2-96600850
                snail: 10/1 Toxteth Rd, Glebe NSW 2037, Australia

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