Encoding rewriting strategies in lambda-calculi with patterns - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2009

Encoding rewriting strategies in lambda-calculi with patterns

Abstract

We propose a patch to the pure pattern calculus: we claim that this is strictly more powerful to define the application of the match fail as the pure \lambda-term defining the boolean false instead of the identity function as it is done in the original version of the pure pattern calculus~\cite{JayK09}. We show that using non algebraic patterns we are able to encode in a natural way any rewriting strategies as well as the branching construct | used in functional programming languages. We close the open question (raised in~\cite{Cirstea00,CirsteaK01}) whether rewriting strategies can be directly encoded in lambda-calculi with patterns.
Fichier principal
Vignette du fichier
rapport.pdf (208.2 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00413178 , version 1 (03-09-2009)
inria-00413178 , version 2 (03-09-2009)

Identifiers

  • HAL Id : inria-00413178 , version 2

Cite

Germain Faure. Encoding rewriting strategies in lambda-calculi with patterns. [Research Report] RR-7025, INRIA. 2009. ⟨inria-00413178v2⟩
94 View
60 Download

Share

Gmail Facebook X LinkedIn More