5499 search results - page 10 / 1100 » Generalized Rewrite Theories |
PODC
2009
ACM
14 years 8 months ago
2009
ACM
In 2004, Klavins et al. introduced the use of graph grammars to describe--and to program--systems of self-assembly. It turns out that these graph grammars can be embedded in a gra...
RTA
2009
Springer
14 years 2 months ago
2009
Springer
It is known that the first-order theory with a single predicate → that denotes one-step rewriting reduction on terms is undecidable already for formulae with ∃∀ prefix. Sev...
PEPM
2010
ACM
13 years 9 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
TLCA
2007
Springer
14 years 1 months ago
2007
Springer
Inspired by recent work on normalisation by evaluation for sums, we propose a normalising and confluent extensional rewriting theory for the simply-typed λ-calculus extended with...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract--Flash memory is well-known for its inherent asymmetry: the flash-cell charge levels are easy to increase but are hard to decrease. In a general rewriting model, the store...