Harmon Nine wrote:
Wow. The CTM doesn't really say that pattern matching is broken down
into such primitive operations.
With my (erroneous) assumption, mainly that pattern-matching was some
sort of unification-entailment hybrid, I thought problem 4(b), p. 107
of the CTM was impossible because you'd have to check if variables
were bound (i.e. with 'IsBound', which is outside the declarative model).
Thanks very much for the info.
-- Harmon
Actually, it does. Section 2.6 (page 79-90) explains how the practical
language is
translated into the kernel language. Page 82 has an example of how the
full case
statement is translated into the kernel case statement.
The kernel language itself (see Tables 2.1 and 2.2) does not define
nested patterns,
but only patterns of the form foo(f1:X1 ... fn:Xn) where the Xi are
variables.
Page 67 gives the semantics of the kernel case statement. It doesn't
have nested
patterns.
Peter
_________________________________________________________________________________
mozart-users mailing list
[email protected]
http://www.mozart-oz.org/mailman/listinfo/mozart-users
