Re: Neat and tidy solution to following problem?

[Jeffrey Carter <jrcarter@acm.org>]

"chris.danx" wrote:
> 
> In the example given previously, the function getWord is declared like this
> 
> getWord :: String -> (String, String)
> 
> This means it takes a string and returns a pair of strings as a tuple.  If
> you want to add all the words in the String to a data structure in another
> function, you can use recursion.  Somethings might just be neater if this
> could be done without fussing with explicit* record types.

In Ada every type must be explicitly declared before it can be used.
There are no exceptions to this rule. So it might be "neat" or "keen" or
even easier to hack in Ada if this weren't the case, but that doesn't
change Ada.

-- 
Jeff Carter
"Hello! Smelly English K...niggets."
Monty Python & the Holy Grail