Sciweavers

974 search results - page 1 / 195
» Hardware Synthesis from Term Rewriting Systems
Sort
View
PLILP
1998
Springer
13 years 11 months ago
Solution to the Problem of Zantema on a Persistent Property of Term Rewriting Systems
A property P of term rewriting systems is persistent if for any many-sorted term rewriting system R, R has the property P if and only if its underlying term rewriting system (R), ...
Takahito Aoto
ENTCS
2007
121views more  ENTCS 2007»
13 years 6 months ago
An Account of Implementing Applicative Term Rewriting
Generation of labelled transition systems from system specifications is highly dependent on efficient rewriting (or related techniques). We give an account of the implementation ...
Muck van Weerdenburg
CATS
2006
13 years 8 months ago
Learnability of Term Rewrite Systems from Positive Examples
Learning from examples is an important characteristic feature of intelligence in both natural and artificial intelligent agents. In this paper, we study learnability of term rewri...
M. R. K. Krishna Rao
CADE
2009
Springer
14 years 7 months ago
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
Stephan Falke, Deepak Kapur