Abstract
Second-order patterns and second-order matching play an important role in program transformation, but the second-order matching algorithm is known to be NP-hard and real efficient implementation is out of question. To resolve this problem, we introduced a class of deterministic second-order patterns, and proposed an efficient matching algorithm. In this paper, we further extend this class to cove more deterministic second-order patterns, discuss both sufficient and necessary conditions for a second-order pattern to be deterministic, and demonstrate its usefulness in program transformation.
