@article {AlpuenteCEFI08,
	title = {A Compact Fixpoint Semantics for Term Rewriting Systems},
	journal = {Theoretical Computer Science},
	year = {2010},
	note = {To Appear},
	abstract = {This work is motivated by the fact that a {\guillemotleft}compact semantics{\guillemotright} for term rewriting systems, which is essential for the development of effective semantics-based program manipulation tools (e.g. automatic program analyzers and debuggers), does not exist. The big-step rewriting semantics that is most commonly considered in functional programming is the set of values/normal forms that the program is able to compute for any input expression. Such a big-step semantics is unnecessarily oversized, as it contains many {\guillemotleft}semantically useless{\guillemotright} elements that can be retrieved from a smaller set of terms. Therefore, in this article, we present a compressed, goal-independent collecting fixpoint semantics that contains the smallest set of terms that are sufficient to describe, by semantic closure, all possible rewritings. We prove soundness and completeness under ascertained conditions. The compactness of the semantics makes it suitable for applications. Actually, our semantics can be finite whereas the big-step semantics is generally not, and even when both semantics are infinite, the fixpoint computation of our semantics produces fewer elements at each step. To support this claim we report several experiments performed with a prototypical implementation.},
	author = {Maria Alpuente and Marco Comini and Santiago Escobar and Moreno Falaschi and Jos{\`e} Iborra}
}
