535 search results - page 1 / 107 » Termination of Abstract Reduction Systems |
CATS
2007
13 years 7 months ago
2007
LICS
1991
IEEE
13 years 9 months ago
1991
IEEE
Abstract. We extend the termination proof methods based on reduction orderings to higher-order rewriting systems `a la Nipkow using higher-order pattern matching for firing rules,...
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...
CADE
2008
Springer
14 years 5 months ago
2008
Springer
Abstract. In this paper we describe a new tool for performing KnuthBendix completion with automatic termination tools. It is based on two ingredients: (1) the inference system for ...
ISPA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. This paper presents an efficient parallel algorithm for volume rendering of large-scale datasets. Our algorithm focuses on an optimization technique, namely early ray te...