A Fully Abstract Semantics for Constructor Systems



Downloads per month over past year

López-Fraguas, F.J. and Rodríguez-Hortalá, Juan and Sánchez-Hernández, Jaime (2009) A Fully Abstract Semantics for Constructor Systems. In Rewriting Techniques and Applications. Lecture Notes in Computer Science (5595). Springer, Berlin, pp. 320-334. ISBN 978-3-642-02347-7

[thumbnail of RodHortala07.pdf] PDF
Restringido a Repository staff only


Official URL: http://www.springerlink.com/content/h882302u488l838q/fulltext.pdf


Constructor-based term rewriting systems are a useful subclass of TRS, in particular for programming purposes. In this kind of systems constructors determine a universe of values, which are the expected output of the computations. Then it would be natural to think of a semantics associating each expression to the set of its reachable values. Somehow surprisingly, the resulting semantics has poor properties, for it is not compositional nor fully abstract when non-confluent systems are considered. In this paper we propose a novel semantics for expressions in constructor systems, which is compositional and fully abstract (with respect to sensible observation functions, in particular the set of reachable values for an expression), and therefore can serve as appropriate basis for semantic based analysis or manipulation of such kind of rewrite systems.

Item Type:Book Section
Additional Information:

20th international conference on Rewriting Techniques and Applications, RTA 2009, Brasilia, Brazil, June 29–July 1, 2009

Subjects:Sciences > Computer science > Programming languages (Electronic computers)
ID Code:18000
Deposited On:29 Jan 2013 09:45
Last Modified:29 Jun 2018 10:59

Origin of downloads

Repository Staff Only: item control page