168 search results - page 12 / 34 » Imperative Program Transformation by Rewriting |
IEICET
2007
13 years 8 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...
PADL
2007
Springer
14 years 2 months ago
2007
Springer
Abstract The Haskell String type is notoriously inefficient. We introduce a new data type, ByteString, based on lazy lists of byte arrays, combining the speed benefits of strict a...
CC
2003
Springer
14 years 1 months ago
2003
Springer
Many processes can be seen as transformations of tree-like data structures. In compiler construction, for example, we continuously manipulate trees and perform tree transformations...
SCAM
2006
IEEE
14 years 2 months ago
2006
IEEE
Metamorphic malware — including certain viruses and worms — rewrite their code during propagation. This paper presents a method for normalizing multiple variants of metamorphi...
DOCENG
2003
ACM
14 years 1 months ago
2003
ACM
XPath [3, 5] is a powerful and quite successful language able to perform complex node selection in trees through compact specifications. As such, it plays a growing role in many ...