Skip to main content
Article thumbnail
Location of Repository

On the Implementation of Dynamic Patterns

By Thibaut Balabonski

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.Comment: In Proceedings HOR 2010, arXiv:1102.346

Topics: Computer Science - Logic in Computer Science, Computer Science - Programming Languages, F.4.1, D.3.3, I.1.3
Year: 2011
DOI identifier: 10.4204/EPTCS.49.2
OAI identifier: oai:arXiv.org:1102.3731
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://arxiv.org/abs/1102.3731 (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.