Path: utzoo!attcan!uunet!ns-mx!iowasp.physics.uiowa.edu!ceres.physics.uiowa.edu!zaphod.mps.ohio-state.edu!rpi!bu.edu!husc6!m2c!umvlsi!dime!yodaiken
From: yodaiken@chelm.cs.umass.edu (victor yodaiken)
Newsgroups: comp.realtime
Subject: Re: Unbounded loops and recursion (Re: Software primitives)
Message-ID: <20590@dime.cs.umass.edu>
Date: 1 Oct 90 11:00:03 GMT
References: <5005@uqcspe.cs.uq.oz.au> <14193@netcom.UUCP>
Sender: news@dime.cs.umass.edu
Reply-To: yodaiken@chelm.cs.umass.edu (victor yodaiken)
Organization: University of Massachusetts, Amherst
Lines: 8

There is an underlying difference between a loop and an iteration in that
loops can repeat state, while each iteration is different.  Standard prog.
languages do not distinguish between the two, but maybe a r.t. language
should.  Or maybe we need to distinguish between constructs that compute
mathematical functions e.g., "sum all the bits", and those which manipulate
time, e.g. "wait until x>0" or "strobe x every k ms".