🚀 go-pugleaf

In article <1992Apr9.042240.26041@socrates.umd.edu>, rockwell@socrates.umd.edu (Raul Deluth Miller-Rockwell) writes:
|> [...]
|> I find it conceptually simpler than systems where I must pre-declare
|> assignments.  If, as is usually the case, I do not re-declare any
|> names, the entire definition for the name is in one spot, which means
|> I don't have to go hunting around through source code to find the rest
|> of the definition.

It just occurred to me that Ada has exactly this same property.  In Ada,
the type of an expression must be statically determinable.  In addition,
Ada doesn't allow implicit coercions across assignments.  So, the whole
definition of an identifier can be determined by looking at the last
assignment to that identifier (and, the last assignment to each of
the identifiers used there, and the last assignment to each of ...).
Come to think of it, it's much easier to look at the declaration of 
the identifier in the preamble of the code.

J. Giles