Re: Structural unification (pattern matching) in Ada [was: Re: S-expression I/O in Ada]

["Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>]

On Wed, 11 Aug 2010 19:51:23 +0200, _FrnchFrgg_ wrote:

> I don't understand what Streams have to do with ML pattern matching. 

You mentioned to constructors stream I/O deploys them.

> Just to be sure we are talking about the same thing, I read one of you 
> wishing Ada had a more powerful/generic "switch" construct, and I 
> noticed that the description of such a "switch" looked like a subset of 
> structural unification as you can find in most functionnal languages.

Can you explain why it looked so to you.

Actually I didn't wish a more generic "switch", I wished it as it is. What
I needed is an enumeration interface for non-discrete types in order to be
able to use them in case. String was just one example.

> Perhaps the current Ada is powerful enough to write some function/code 
> doing this switch machinery, but I was thinking it would be a new 
> language construct (or an extension of "switch").

That was my first thought, so I asked if you meant *normal* patterns, like
regular expressions etc. No, I certainly don't want them in Ada
case-statement. Alternatives of a case statement can be evaluated in any
order, they can be statically verified for being exhaustive and not
overlapping. These are most important features, which any more or less
usable pattern language lacks.

-- 
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de