10.4230/LIPICS.RTA.2012.117
Bonelli, Eduardo
Eduardo
Bonelli
Kesner, Delia
Delia
Kesner
Lombardi, Carlos
Carlos
Lombardi
Rios, Alejandro
Alejandro
Rios
Normalisation for Dynamic Pattern Calculi
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2012
Article
Pattern calculi
reduction strategies
sequentiality
neededness
Tiwari, Ashish
Ashish
Tiwari
2012
2012-05-29
2012-05-29
2012-05-29
en
urn:nbn:de:0030-drops-34889
10.4230/LIPIcs.RTA.2012
978-3-939897-38-5
1868-8969
10.4230/LIPIcs.RTA.2012
LIPIcs, Volume 15, RTA 2012
23rd International Conference on Rewriting Techniques and Applications (RTA'12)
2013
15
11
117
132
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Tiwari, Ashish
Ashish
Tiwari
1868-8969
Leibniz International Proceedings in Informatics (LIPIcs)
2012
15
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
16 pages
535702 bytes
application/pdf
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
info:eu-repo/semantics/openAccess
The Pure Pattern Calculus (PPC) extends the lambda-calculus, as well as the family of algebraic pattern calculi, with first-class patterns; that is, patterns can be passed as arguments, evaluated and returned as results. The notion of matching failure of the PPC not only provides a mechanism to define functions by pattern matching on cases but also supplies PPC with parallel-or-like, non-sequential behaviour. Therefore, devising normalising strategies for PPC to obtain well-behaved implementations turns out to be challenging.
This paper focuses on normalising reduction strategies for PPC. We define a (multistep) strategy and show that it is normalising. The strategy generalises the leftmost-outermost strategy for lambda-calculus and is strictly finer than parallel-outermost. The normalisation proof is based on the notion of necessary set of redexes, a generalisation of the notion of needed redex encompassing
non-sequential reduction systems.
LIPIcs, Vol. 15, 23rd International Conference on Rewriting Techniques and Applications (RTA'12), pages 117-132