13 search results - page 2 / 3 » Strong Normalization of Typeable Rewrite Systems |
WFLP
2000
Springer
13 years 9 months ago
2000
Springer
Constructor Systems (CSs) are an important subclass of Term Rewriting Systems (TRSs) which can be used stract model of some programming languages. While normalizing strategies are...
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...
LICS
1990
IEEE
13 years 9 months ago
1990
IEEE
This paper discusses the relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net. We base our discussion on two ...
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
1991
Springer
13 years 9 months ago
1991
Springer
A term rewriting system is called complete if it is both confluent and strongly norrealizing. Barendregt and Klop showed that the disjoint union of complete term rewriting systems...