Sciweavers

66 search results - page 10 / 14
» Rewriting Haskell Strings
Sort
View
ICSE
2001
IEEE-ACM
14 years 1 days ago
Using Transformation Systems for Software Maintenance and Reengineering
Software maintenance costs dominate software engineering costs, partly because most such engineering is done manually. Program Transformation tools leverage an engineer-provided b...
Ira D. Baxter
RTA
2005
Springer
14 years 1 months ago
Open. Closed. Open
Abstract. As a window into the subject, we recount some of the history (and geography) of two mature, challenging, partially open, partially closed problems in the theory of rewrit...
Nachum Dershowitz
APBC
2004
154views Bioinformatics» more  APBC 2004»
13 years 9 months ago
Dispensation Order Generation for Pyrosequencing
This article describes a dispensation order generation algorithm for genotyping using the Pyrosequencing method. The input template of the algorithm is a slightly restricted regul...
Mats Carlsson, Nicolas Beldiceanu
DLT
2006
13 years 9 months ago
Bag Context Tree Grammars
Bag context is a device for regulated rewriting in tree and string grammars. It represents context that is not part of the developing tree or string, but evolves on its own during ...
Frank Drewes, Christine du Toit, Sigrid Ewert, Bri...
ERSHOV
1999
Springer
13 years 12 months ago
On Perfect Supercompilation
We extend positive supercompilation to handle negative as well as positive information. This is done by instrumenting the underlying unfold rules with a small rewrite system that h...
Jens P. Secher, Morten Heine Sørensen