22 search results - page 2 / 5 » The Rewriting Calculus as a Combinatory Reduction System |
RTA
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We show that the structures of binding algebras and Σmonoids by Fiore, Plotkin and Turi are sound and complete models of Klop’s Combinatory Reduction Systems (CRSs). T...
ACTA
2005
13 years 5 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...
BIRTHDAY
2005
Springer
13 years 11 months ago
2005
Springer
Huet and L´evy (1979) showed that needed reduction is a normalizing strategy for orthogonal (i.e., left-linear and non-overlapping) term rewriting systems. In order to obtain a de...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
Abstract : The main novelty of this paper is to consider an extension of the Calculus of Constructions where predicates can be defined with a general form of rewrite rules. We prov...
RTA
2004
Springer
13 years 11 months ago
2004
Springer
Several authors devised type-based termination criteria for ML-like languages allowing non-structural recursive calls. We extend these works to general rewriting and dependent type...