On the Implementation of Dynamic Patterns
Logic in Computer Science
2011-02-21 v1 Programming Languages
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.
Cite
@article{arxiv.1102.3731,
title = {On the Implementation of Dynamic Patterns},
author = {Thibaut Balabonski},
journal= {arXiv preprint arXiv:1102.3731},
year = {2011}
}
Comments
In Proceedings HOR 2010, arXiv:1102.3465