11 search results - page 1 / 3 » Expressing combinatory reduction systems derivations in the ... |
LISP
2006
13 years 4 months ago
2006
The last few years have seen the development of the rewriting calculus (also called rho-calculus or -calculus) that uniformly integrates first-order term rewriting and the -calculu...
FOSSACS
2007
Springer
13 years 10 months ago
2007
Springer
The last few years have seen the development of the rewriting calculus (also called rho-calculus or ρ-calculus) that uniformly integrates first-order term rewriting and λ-calcul...
PPDP
2004
Springer
13 years 9 months ago
2004
Springer
We present a generalisation of first-order rewriting which allows us to deal with terms involving binding operations in an elegant and practical way. We use a nominal approach to...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. We study normalising reduction strategies for infinitary Combinatory Reduction Systems (iCRSs). We prove that all fair, outermost-fair, and needed-fair strategies are nor...
ACTA
2005
13 years 4 months ago
2005
A general framework for typing graph rewriting systems is presented: the idea is to statically derive a type graph from a given graph. In contrast to the original graph, the type g...