Sciweavers

273 search results - page 5 / 55
» A Compositional Semantics for Conditional Term Rewriting Sys...
Sort
View
PPDP
2005
Springer
15 years 5 months ago
Program transformation by templates based on term rewriting
Huet and Lang (1978) presented a framework of automated program transformation based on lambda calculus in which programs are transformed according to a given program transformati...
Yuki Chiba, Takahito Aoto, Yoshihito Toyama
IWPC
2003
IEEE
15 years 4 months ago
How Understanding and Restructuring Differ from Compiling - A Rewriting Perspective
Syntactic and semantic analysis are established topics in the area of compiler construction. Their application to the understanding and restructuring of large software systems rev...
Paul Klint
AAECC
2007
Springer
148views Algorithms» more  AAECC 2007»
14 years 11 months ago
Enhancing dependency pair method using strong computability in simply-typed term rewriting
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
Keiichirou Kusakari, Masahiko Sakai
WADT
1998
Springer
15 years 3 months ago
Complete Strategies for Term Graph Narrowing
Abstract. Narrowing is a method for solving equations in the equational theories of term rewriting systems. Unification and rewriting, the central operations in narrowing, are ofte...
Annegret Habel, Detlef Plump
CTRS
1992
15 years 3 months ago
Decidability of Regularity and Related Properties of Ground Normal Form Languages
ded abstract of this paper is published in the proceedings of the 3rd International Workshop on Conditional Term Rewriting Systems, Pont- -Mousson, 1992 1
Gregory Kucherov, Mohamed Tajine