Path: utzoo!attcan!utgpu!news-server.csri.toronto.edu!rutgers!cs.utexas.edu!mailrus!ncar!noao!arizona!gudeman
From: gudeman@cs.arizona.edu (David Gudeman)
Newsgroups: comp.lang.misc
Subject: Re: The Forbidden (previously misspelled ``Forbiden'')
Message-ID: <24323@megaron.cs.arizona.edu>
Date: 18 Aug 90 08:28:07 GMT
Organization: U of Arizona CS Dept, Tucson
Lines: 18

In article  <90@ai.etl.army.mil> hoey@ai.etl.army.mil (Dan Hoey) writes:
>In article <24279@megaron.cs.arizona.edu> gudeman@cs.arizona.edu
(David Gudeman) sticks his foot in his mouth:
>
>>... I feel confident in saying that non-recursion can
>>be automatically proven in correct non-recursive programs.
>
>That's true of simple recursion, but mutually recursive program units
>(functions or subroutines) are more problematical...

Grumble.  I also forgot the problems with procedures-valued variables
(we were talking about C weren't we?).  Oh well, you can still detect
a _large_ majority of non-recursive programs...
-- 
					David Gudeman
Department of Computer Science
The University of Arizona        gudeman@cs.arizona.edu
Tucson, AZ 85721                 noao!arizona!gudeman