1385 search results - page 11 / 277 » Natural Rewriting for General Term Rewriting Systems |
RTA
2005
Springer
15 years 5 months ago
2005
Springer
Abstract In order to extend the modeling capabilities of rewriting systems, it is rather natural to consider that the firing of rules can be subject to some probabilistic laws. Co...
FMCAD
2008
Springer
15 years 1 months ago
2008
Springer
88
Voted
FOSSACS
2007
Springer
15 years 5 months ago
2007
Springer
The last few years have seen the development of the rewriting calculus (also called rho-calculus or ρ-calculus) that uniformly integrates first-order term rewriting and λ-calcul...
91
Voted
FLOPS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Outermost-needed rewriting/narrowing is a sound and complete optimal demand-driven strategy for the class of inductively sequential constructor systems. Its parallel exte...
89
Voted
RTA
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Partial-inversion compilers generate programs which compute some unknown inputs of given programs from a given output and the rest of inputs whose values are already give...