1385 search results - page 51 / 277 » Natural Rewriting for General Term Rewriting Systems |
185
click to vote
IEICET
2007
15 years 6 months ago
2007
The completeness (i.e. confluent and terminating) property is an important concept when using a term rewriting system (TRS) as a computational model of functional programming lang...
155
click to vote
WADT
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Computational systems are often represented by means of Kripke structures, and related using simulations. We propose rewriting logic as a flexible and executable framewo...
122
click to vote
ECEASST
2010
15 years 3 months ago
2010
This short paper explores the potential of embedding-based graph rewriting as a tool for understanding natural computing, and in particular self-assembly. The basic point of view i...
180
click to vote
PPDP
2007
Springer
16 years 6 days ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
154
click to vote
ESOP
2007
Springer
16 years 8 days ago
2007
Springer
When students first learn programming, they often rely on a simple operational model of a program’s behavior to explain how particular features work. Because such models build o...