882 search results - page 96 / 177 » A Taste of Rewrite Systems |
86
Voted
RTA
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. As a window into the subject, we recount some of the history (and geography) of two mature, challenging, partially open, partially closed problems in the theory of rewrit...
111
Voted
AGTIVE
1999
Springer
15 years 5 months ago
1999
Springer
We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming l...
94
Voted
LICS
1990
IEEE
15 years 4 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 ...
88
Voted
IFIP
2000
Springer
15 years 4 months ago
2000
Springer
Existing software integration frameworks typically require large manual rewrites of existing codes, or specific tailoring of codes written to be used in the framework. The result i...
96
Voted
AMAST
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Declarative debugging has been applied to many declarative programming paradigms; in this paper, a declarative debugger for rewriting logic specifications, embodied in th...