Paper Info
Title
On the Implementation of Dynamic Patterns
Abstract
The evaluation mechanism of pattern matching with dynamic patterns is modelled in the Pure Pattern Calculus by one single meta-rule. This contribution presents a refinement which narrows the gap between the abstract calculus and its implementation. A calculus is designed to allow reasoning on matching algorithms. The new calculus is proved to be confluent, and to simulate the original Pure Pattern Calculus. A family of new, matching-driven, reduction strategies is proposed.
Year
DOI
Venue
2010
10.4204/EPTCS.49.2
HOR
Keywords
Field
DocType
pattern matching,programming language
Relational calculus,Situation calculus,Computer science,Proof calculus,Tuple relational calculus,Theoretical computer science,Pattern calculus,Pattern matching,Calculus
Journal
ISSN
Citations 
PageRank 
EPTCS 49, 2011, pp. 16-30
1
0.38
References 
Authors
2
1
Name
Order
Citations
PageRank
Thibaut Balabonski1206.56