23201 search results - page 92 / 4641 » Rewriting Systems with Data |
201
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...
170
click to vote
CADE
2012
Springer
13 years 9 months ago
2012
Springer
We introduce a technique to prove non-termination of term rewrite systems automatically. Our technique improves over previous approaches substantially, as it can also detect non-lo...
173
click to vote
FMCO
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. This tutorial paper describes a framework for modelling several aspects of distributed computing based on Synchronised Hyperedge Replacement (SHR), a graph rewriting form...
174
click to vote
WADT
2004
Springer
16 years 2 days 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...
188
Voted
ECAL
2003
Springer
15 years 12 months ago
2003
Springer
A formal language approach for the specification of ALife models is presented. “Relational Growth Grammars” incorporate rulebased, procedural and object-oriented concepts. By ...