Publication: A Fully Abstract Semantics for Constructor Systems
Loading...
Full text at PDC
Publication Date
2009
Advisors (or tutors)
Editors
Journal Title
Journal ISSN
Volume Title
Publisher
Springer
Citations
Exportar
Abstract
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.
Description
20th international conference on Rewriting Techniques and Applications, RTA 2009, Brasilia, Brazil, June 29–July 1, 2009
UCM subjects
Unesco subjects
Keywords
Citation
Alpuente, M., Comini, M., Escobar, S., Falaschi, M., Lucas, S.: Abstract diagnosis of functional programs. In: Leuschel, M.A. (ed.) LOPSTR 2002. LNCS, vol. 2664, pp. 1–16. Springer, Heidelberg (2003)
Alpuente, M., Falaschi, M., Ramis, M., Vidal, G.: Narrowing approximations as an optimization for equational logic programs. In: Penjam, J., Bruynooghe, M. (eds.) PLILP 1993. LNCS, vol. 714, pp. 391–409. Springer, Heidelberg (1993)
Antoy, S.: Optimal non-deterministic functional logic computations. In: Hanus, M., Heering, J., Meinke, K. (eds.) ALP 1997 and HOA 1997. LNCS, vol. 1298, pp. 16–30. Springer, Heidelberg (1997)
Antoy, S., Iranzo, P.J., Massey, B.: Improving the efficiency of non-deterministic computations. ENTCS, 64 (2002)
Bert, D., Echahed, R., Østvold, B.M.: Abstract Rewriting. In: Cousot, P., Fil´e, G., Falaschi, M., Rauzy, A. (eds.) WSA 1993. LNCS, vol. 724, pp. 178–192. Springer, Heidelberg (1993)
Boudol, G.: Une semantique pour les arbres non deterministes. In: Astesiano, E., Böhm,C.(eds.)CAAP1981.LNCS,vol. 112,pp.147–161.Springer,Heidelberg (1981)
Boudol, G.: Computational semantics of term rewriting
systems. In: Algebraic methods in semantics, pp. 169–236. Cambridge University Press, Cambridge (1986)
Braßel, B.,Huch, F.:On a tighter integration of functional and logic programming. In: Shao,Z. (ed.)APLAS2007.LNCS,vol. 4807,pp.122–138.Springer,Heidelberg (2007)
Clavel, M., et al. (eds.): All About Maude - A High-Performance Logical Framework. LNCS, vol. 4350. Springer, Heidelberg (2007)
González-Moreno, J.C., Hortalá-González, T., López-Fraguas, F., Rodríguez-Artalejo, M.: An approach to declarative programming based on a rewriting logic. J. of Logic Programming 40(1), 47–87 (1999)
Hanus, M.: Multi-paradigm declarative languages. In: Dahl, V., Niemelä, I. (eds.) ICLP 2007. LNCS, vol. 4670, pp. 45–75. Springer, Heidelberg (2007)
Hanus, M., Lucas, S.: An evaluation semantics for narrowing-based functional logic languages. J. Funct. and Logic Prog. 2001(2) (2001)
Hussmann, H.: Non-Determinism in Algebraic Specifications and Algebraic Programs. Birkhäuser Verlag, Basel (1993)
López-Fraguas, F., Rodríguez-Hortalá, J., Sánchez-Hernández, J.: Bundles pack tighter than lists. In: Draft Proc. Trends in Funct. Prog, TFP 2007 (2007)
Martí-Oliet, N., Meseguer, J.: Rewriting logic: roadmap and bibliography. Theor.Comput. Sci. 285(2), 121–154 (2002)
Nyström, S.-O.: There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations. Inf. Process. Lett. 60(6), 289–293 (1996)
Ohlebusch, E.: Advanced topics in term rewriting. Springer, Heidelberg (2002)
Plotkin, G.D.: LCF considered as a programming language. Theor. Comput.Sci. 5(3), 225–255 (1977)
Reynolds, J.: Theories of Programing Languages. Cambridge University Press,Cambridge (1998)