Copenhagen Programming Language Seminar
Higher-order patterns are important for describing concise calculation
rules. They are capable of checking and binding subtrees far from the
root, which is useful for program manipulation. To obtain the bindings of
higher-order variables, higher-order matching is used. There are three
major problems from the practical viewpoint, though. First, it is
difficult to explain why a particular desired matching result cannot be
obtained because of the complicated higher-order matching algorithm.
Second, the general higher-order matching algorithm is of high cost, which
may be exponential time at worst. Third, the (possibly infinite)
nondeterministic solutions of higher-order matching prevent its use in a
Robert Glück, Administrative host:
Camilla Jensen. All are welcome.
The Copenhagen Programming Language Seminar (COPLAS) is a collaboration between DIKU, ITU and KVL.
COPLAS is sponsored by FIRST Graduate School.
To receive information about COPLAS talks by email, send a message to firstname.lastname@example.org with the word 'subscribe' as subject or in the body.
For more information about COPLAS, see http://www.coplas.org