Sciweavers

882 search results - page 19 / 177
» A Taste of Rewrite Systems
Sort
View
LISP
2006
77views more  LISP 2006»
13 years 7 months ago
Expressing combinatory reduction systems derivations in the rewriting calculus
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 the -calculu...
Clara Bertolissi, Horatiu Cirstea, Claude Kirchner
FOSSACS
2004
Springer
14 years 27 days ago
On Term Rewriting Systems Having a Rational Derivation
Several types of term rewriting systems can be distinguished by the way their rules overlap. In particular, we define the classes of prefix, suffix, bottom-up and top-down system...
Antoine Meyer
FOSSACS
2011
Springer
12 years 11 months ago
Regularity and Context-Freeness over Word Rewriting Systems
We describe a general decomposition mechanism to express the derivation relation of a word rewriting system R as the composition of a (regular) substitution followed by the derivat...
Didier Caucal, Dinh Trong Hieu
RTA
2005
Springer
14 years 1 months ago
Partial Inversion of Constructor Term Rewriting Systems
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...
Naoki Nishida, Masahiko Sakai, Toshiki Sakabe
NAACL
2010
13 years 5 months ago
Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems
The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively f...
Carlos Gómez-Rodríguez, Marco Kuhlma...