31 search results - page 3 / 7 » Cobham's theorem for substitutions |
SAIG
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Short cut fusion is a particular program transformation technique which uses a single, local transformation — called the foldr-build rule — to remove certain intermed...
OOPSLA
2001
Springer
13 years 9 months ago
2001
Springer
Checking pre- and post-conditions of procedures and methods at runtime helps improve software reliability. In the procedural world, pre- and post-conditions have a straightforward...
GG
2004
Springer
13 years 10 months ago
2004
Springer
We propose to study two infinite graph transformations that we respectively call bounded and unbounded path transduction. These graph transformations are based on path substitutio...
FUIN
2006
13 years 5 months ago
2006
We prove that negative hyper-resolution using any liftable and well-founded ordering refinement is a sound and complete procedure for answering queries in disjunctive logic program...
AISC
2006
Springer
13 years 9 months ago
2006
Springer
We present a search engine for mathematical formulae. The MathWebSearch system harvests the web for content representations (currently MathML and OpenMath) of formulae and indexes ...