882 search results - page 34 / 177 » A Taste of Rewrite Systems |
CORR
2006
Springer
13 years 7 months ago
2006
Springer
In a previous work, the first author extended to higher-order rewriting and dependent types the use of size annotations in types, a termination proof technique called type or size ...
PG
2002
IEEE
14 years 14 days ago
2002
IEEE
Lworld is a computer graphics animation system based on L-systems, a parallel rewriting technique used primarily in computer graphics for plant modeling. Because rulebased program...
CADE
2006
Springer
14 years 7 months ago
2006
Springer
Abstract. Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far i...
RP
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. In this paper we consider ν-MSR, a formalism that combines the two main existing approaches for multiset rewriting, namely MSR and CMRS. In ν-MSR we rewrite multisets o...
FM
1997
Springer
13 years 11 months ago
1997
Springer
Abstract Set boolean operations between 2-dlmensional geometric objects are crucial in computational geometry and deserve rigorous treatments. We build up a simple and convergent s...