23201 search results - page 97 / 4641 » Rewriting Systems with Data |
183
click to vote
MOBISYS
2008
ACM
16 years 5 months ago
2008
ACM
It is now common for Web sites to use active Web content, such as Flash, Silverlight, or Java applets, to support rich, interactive applications. For many mobile devices, however,...
151
Voted
LICS
1991
IEEE
15 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,...
127
click to vote
FUIN
2007
15 years 5 months ago
2007
It is shown that the boundedness problem for a certain class of basic object nets and a corresponding class of multiset rewriting systems is decidable. To achieve this result Dicks...
158
Voted
CIKM
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we propose a versatile disambiguation approach which can be used to make explicit the meaning of structure based information such as XML schemas, XML document struc...
178
click to vote
XPU
2004
Springer
15 years 10 months ago
2004
Springer
We describe how a small, successful, self-selected XP team approached a seemingly intractable problem with panache, flair and immodesty. We rewrote a legacy application by deliver...