, On Subtyping and Matching, European Conference for Object-Oriented Programming, pp.145-167, 1995.
DOI : 10.1007/3-540-49538-x_8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.5943
, A Theory of Objects, 1996.
DOI : 10.1007/978-1-4419-8598-9
, Properties of a first-order functional language with sharing, Theoretical Computer Science, vol.146, issue.1-2, pp.69-108, 1995.
DOI : 10.1016/0304-3975(94)00185-L
, A Call-By-Need Lambda Calculus, Proc. of POPL, pp.233-246, 1995.
, Cyclic lambda graph rewriting, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science, pp.416-425, 1994.
DOI : 10.1109/LICS.1994.316066
, Equational term graph rewriting'. Fundam, Inf, vol.26, pp.3-4207, 1996.
, A compiler for lazy ML, Proceedings of the 1984 ACM Symposium on LISP and functional programming , LFP '84, pp.218-227, 1984.
DOI : 10.1145/800055.802038
, Term Rewriting and All That, 1998.
, Term graph rewriting, Proc. of PARLE, pp.141-158, 1987.
DOI : 10.1007/3-540-17945-3_8
, Modeling Sharing and Recursion for Weak Reduction Strategies using Explicit Substitution, Proc. of PLILP, pp.393-407, 1996.
URL : https://hal.archives-ouvertes.fr/inria-00073599
, Term Graph Rewriting, Syntax and Semantics, 2001.
, Preservation of Strong Normalisation in Named Lambda Calculi with Explicit Substitution and Garbage Collection, Computer Science in the Netherlands, pp.62-72, 1995.
, Matching for the lambda calculus of objects, Theoretical Computer Science, vol.212, issue.1-2, pp.101-140, 1999.
DOI : 10.1016/S0304-3975(98)00137-6
, An Overview of ELAN, Proceedings of the 2nd International Workshop on Rewriting Logic and its Applications, 1998.
DOI : 10.1016/S1571-0661(05)82552-6
URL : https://hal.archives-ouvertes.fr/inria-00098518
, Subtyping is not a good ???match??? for object-oriented languages, European Conference for Object-Oriented Programming, pp.104-127, 1997.
DOI : 10.1007/BFb0053376
, The Maude 2.0 System, Rewriting Techniques and Applications (RTA 2003), no. 2706 in Lecture Notes in Computer Science, pp.76-87, 2003.
DOI : 10.1007/3-540-44881-0_7
, An abstract framework for environment machines, Theoretical Computer Science, vol.82, issue.2, pp.389-402, 1991.
DOI : 10.1016/0304-3975(91)90230-Y
, Handbook of Theoretical Computer Science, pp.244-320, 1990.
, Cafe Obj Report: The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification, of Amast Series in Computing . World Scientific, 1998.
, Abstract machines for programming language implementation, Future Generation Computer Systems, vol.16, issue.7, pp.739-751, 2000.
DOI : 10.1016/S0167-739X(99)00088-6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.234
, A Generic Object-Calculus Based on Addressed Term Rewriting Systems, 2002.
URL : https://hal.archives-ouvertes.fr/hal-01152576
, Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics, Electronic Notes in Theoretical Computer Science, vol.127, issue.5, pp.57-82, 2005.
DOI : 10.1016/j.entcs.2004.12.042
URL : https://hal.archives-ouvertes.fr/hal-01149607
, Handbook of Graph Grammars and Computing by Graph Transformation, World Scientific, vol.2, 1999.
, A syntactic theory of sequential state, Theoretical Computer Science, vol.69, issue.3, pp.243-287, 1989.
DOI : 10.1016/0304-3975(89)90069-8
, A Lambda Calculus of Objects and Method Specialization, Nordic Journal of Computing, vol.1, issue.1, pp.3-37, 1994.
, A delegation-based object calculus with subtyping, Fundamentals of Computation Theory (FCT'95, 1995.
DOI : 10.1007/3-540-60249-6_40
, A Lambda Calculus of Objects with Self-inflicted Extension, Proc. of OOPSLA, pp.166-178, 1998.
URL : https://hal.archives-ouvertes.fr/hal-01154180
, A Concurrent Object Calculus, Electronic Notes in Theoretical Computer Science, 2000.
DOI : 10.1016/S1571-0661(04)00145-8
, Featherweight Java: a minimal core calculus for Java and GJ, ACM Transactions on Programming Languages and Systems, vol.23, issue.3, pp.396-450, 2001.
DOI : 10.1145/503502.503505
, Term Rewriting Systems, Handbook of Logic in Computer Science, 1990.
, Logic for Problem SolvingThe Mechanical Evaluation of Expressions, Artificial Intelligence Series, North Holland. P. J. Landin Computer Journal, vol.6, 1964.
, A framework for defining Object-Calculi extended abstract, Proc. of FM, pp.963-982, 1999.
DOI : 10.1007/3-540-48118-4_2
URL : https://hal.archives-ouvertes.fr/hal-01153772
, The Objective Caml system release 3.09 Documentation and user's manual, 2004.
, Optimal Reductions in the Lambda-calculus', To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp.159-191, 1980.
, An extended Theory of Primitive Objects: First order system, ECOOP, pp.146-169, 1997.
DOI : 10.1007/BFb0053378
URL : https://hal.archives-ouvertes.fr/hal-01154568
, Optimal derivations in weak lambda-calculi and in orthogonal term rewriting systems, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '91, pp.255-268, 1992.
DOI : 10.1145/99583.99618
, The Definition of Standard ML, 1990.
, The Definition of Standard ML: Revised 1997, 1997.
, Implementing conditional term rewriting by graph rewriting, Theoretical Computer Science, vol.262, issue.1-2, pp.311-331, 2001.
DOI : 10.1016/S0304-3975(00)00209-7
URL : http://doi.org/10.1016/s0304-3975(00)00209-7
, Haskell 98 Language and Libraries: the Revised Report, 2003.
, Functional Programming and Parallel Graph Rewriting. International Computer Science Series, 1993.
, TERM GRAPH REWRITING, World Scientific. in (Ehrig, issue.1, pp.3-61, 1999.
DOI : 10.1142/9789812815149_0001
, Operational Reduction Models for Functional Programming Languages, 1996.
, Term Graph Rewriting, 1993.
, A new implementation technique for applicative languages, Software: Practice and Experience, vol.6, issue.1, pp.31-49, 1979.
DOI : 10.1002/spe.4380090105
, Semantics and Pragmatics of the Lambda Calculus, 1971.
, Acyclic Mutation-free ATRS In this section, we consider a particular sub-class of ATRS, namely the ATRS involving no cycles and no mutation. Having no cycle means that there is