The rho cube : some results, some problems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2002

The rho cube : some results, some problems


The rewriting calculus embeds in a same setting the lambda calculus and the rewriting, by allowing abstraction not only on variables but also on patterns. The higher-order mechanisms of the lambda-calculus and the pattern matching facilities of the rewriting are then both available at the same level. It is worth noticing that the complexity of the calculu breaks the confluence property, so that we need to define appropiate strategies or restrictions, in order to recover it. We choose here to look at the rho-calculus as an extension of the lambda-calculus, and we study the typed aspects. Our study is based upon a generalization of Barendregt's lambda-cube, in which we unify both abstractors lambda and Pi into a single one. We need to deal with the original features of the rho-calculus too: matching power, non-determinism, confluence issues. With proper restrictions, we have proved most of the usual properties for typed calculi: substitution lemma, correctness of types, subject reduction, consistency. Uniqueness of typing is generally no longer valid but we can still prove it for one of the most restrictive systems, rho-> and rho2.
Fichier principal
Vignette du fichier
A02-R-470.pdf (345.94 Ko) Télécharger le fichier

Dates and versions

inria-00099411 , version 1 (26-09-2006)


  • HAL Id : inria-00099411 , version 1


Horatiu Cirstea, Claude Kirchner, Luigi Liquori, Benjamin Wack. The rho cube : some results, some problems. First International Workshop on Higher-Order Rewriting Copenhagen, Denmark, July 21st, 2002 Affiliated with RTA 2002, D. Kesner, T. Nipkow and F. van Raamsdonk, Jul 2002, Copenhague, Denmark. ⟨inria-00099411⟩
111 View
74 Download


Gmail Facebook Twitter LinkedIn More