Sciweavers

289 search results - page 22 / 58
» Program transformation by templates based on term rewriting
Sort
View
PPDP
2007
Springer
14 years 1 months ago
Higher-order semantic labelling for inductive datatype systems
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
Makoto Hamana
ICASSP
2011
IEEE
12 years 11 months ago
Image prediction based on non-negative matrix factorization
This paper presents a novel spatial texture prediction method based on non-negative matrix factorization. As an extension of template matching, approximation based iterative textu...
Mehmet Türkan, Christine Guillemot
POPL
1997
ACM
13 years 11 months ago
Shape Types
Type systems currently available for imperative languages are too weak to detect a significant class of programming errors. For example, they cannot express the property that a l...
Pascal Fradet, Daniel Le Métayer
LCPC
1992
Springer
13 years 11 months ago
A Calculus of Gamma Programs
The Gamma model is a minimal programming language based on local multiset rewriting (with an elegant chemical reaction metaphor); Hankin et al derived a calculus of Gamma programs...
Chris Hankin, Daniel Le Métayer, David Sand...
ICFP
2008
ACM
14 years 7 months ago
Compiling self-adjusting programs with continuations
Self-adjusting programs respond automatically and efficiently to input changes by tracking the dynamic data dependences of the computation and incrementally updating the output as...
Ruy Ley-Wild, Matthew Fluet, Umut A. Acar