Sciweavers

289 search results - page 27 / 58
» Program transformation by templates based on term rewriting
Sort
View
ICLP
2005
Springer
14 years 28 days ago
Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...
Manh Thang Nguyen, Danny De Schreye
ENTCS
2008
91views more  ENTCS 2008»
13 years 7 months ago
Towards Concrete Syntax Patterns for Logic-based Transformation Rules
Logic meta-programming in Prolog is a powerful way to express program analysis and transformation. However, its use can be difficult and error-prone because it requires programmer...
Malte Appeltauer, Günter Kniesel
PPDP
1999
Springer
13 years 11 months ago
A Calculus for Interaction Nets
hemical abstract machine Shinya Sato Himeji Dokkyo University, Faculty of Econoinformatics, 7-2-1 Kamiohno, Himeji-shi, Hyogo 670-8524, Japan Ian Mackie LIX, CNRS UMR 7161, ´Ecole...
Maribel Fernández, Ian Mackie
COMPSAC
2008
IEEE
14 years 1 months ago
Modeling by Form Transformation for End-User Initiative Development
2. Previous studies on end-user computing The development of Web applications should be supported by business professionals themselves since Web applications must be modified frequ...
Takeshi Chusho, Noriyuki Yagi
PLDI
2009
ACM
14 years 2 months ago
Proving optimizations correct using parameterized program equivalence
Translation validation is a technique for checking that, after an optimization has run, the input and output of the optimization are equivalent. Traditionally, translation validat...
Sudipta Kundu, Zachary Tatlock, Sorin Lerner