498 search results - page 29 / 100 » Term Rewriting |
JSC
2010
14 years 8 months ago
2010
In this paper we deal with the verification of safety properties of infinite-state systems modeled by term-rewriting systems. An over-approximation of the set of reachable terms...
IFL
2004
Springer
15 years 3 months ago
2004
Springer
One performance-critical phase in the SML.NET compiler involves rewriting intermediate terms to monadic normal form and performing non-duplicating β-reductions. We present an impe...
ESWS
2008
Springer
14 years 11 months ago
2008
Springer
Both Topic Maps and RDF are popular semantic web standards designed for machine processing of web documents. Since these representations were originally created for different purpo...
CIE
2008
Springer
14 years 11 months ago
2008
Springer
We revisit Girard's reducibility candidates by proposing a general of the notion of neutral terms. They are the terms which do not interact with some contexts called eliminati...
RTA
1991
Springer
15 years 1 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...