Sciweavers

289 search results - page 10 / 58
» Program transformation by templates based on term rewriting
Sort
View
APLAS
2000
ACM
13 years 11 months ago
A New Criterion for Safe Program Transformations
Previous studies on safety of program transformations with respect to performance considered two criteria: preserving performance within a constant factor and preserving complexit...
Yasuhiko Minamide
LISP
2008
105views more  LISP 2008»
13 years 7 months ago
Proving operational termination of membership equational programs
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
Francisco Durán, Salvador Lucas, Claude Mar...
ICMCS
2006
IEEE
120views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Shape-Based Visual Query Rewriting
A visual query is based on pictorial representation of conceptual entities and operations. One of the most important features used in visual queries is the shape. Despite its intu...
Georges Chalhoub, Richard Chbeir, Kokou Yét...
ICSE
2001
IEEE-ACM
13 years 11 months 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
LICS
1994
IEEE
13 years 11 months ago
Higher-Order Narrowing
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...
Christian Prehofer