Sciweavers

LPAR
2005
Springer
14 years 6 months ago
Matching with Regular Constraints
We describe a sound, terminating, and complete matching algorithm for terms built over flexible arity function symbols and context, function, sequence, and individual variables. C...
Temur Kutsia, Mircea Marin