Term rewriting systems with priorities, LNCS, vol.256, pp.83-94, 1987. ,
DOI : 10.1007/3-540-17220-3_8
URL : http://dspace.library.uu.nl:8080/handle/1874/12932
Term-rewriting systems with rule priorities, Theoretical Computer Science, vol.67, issue.2-3, pp.283-301, 1989. ,
DOI : 10.1016/0304-3975(89)90006-6
Term Rewriting for Sale, Electronic Notes in Theoretical Computer Science, vol.15, pp.139-161, 1998. ,
DOI : 10.1016/S1571-0661(05)80014-3
Towards a Strategy Language for Maude, Electronic Notes in Theoretical Computer Science, vol.117, pp.417-441, 2004. ,
DOI : 10.1016/j.entcs.2004.06.020
Functional Programming and Parallel Graph Rewriting, 1993. ,
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
Réécriture et Modularité pour les Politiques de Sécurité, 2008. ,
Weaving rewrite-based access control policies, Proceedings of the 2007 ACM workshop on Formal methods in security engineering , FMSE '07, pp.71-80, 2007. ,
DOI : 10.1145/1314436.1314446
URL : https://hal.archives-ouvertes.fr/inria-00185710
Priority rewriting: Semantics, confluence, and conditionals, LNCS, vol.355, pp.278-291, 1989. ,
DOI : 10.1007/3-540-51081-8_114
Operational semantics of rewriting with priorities, Theoretical Computer Science, vol.200, issue.1-2, pp.289-312, 1998. ,
DOI : 10.1016/S0304-3975(97)00283-1
Semantics and strong sequentiality of priority term rewriting systems, Theoretical Computer Science, vol.208, issue.1-2, pp.1-2, 1998. ,
DOI : 10.1016/S0304-3975(98)00080-2
Generalized Innermost Rewriting, RTA 2005, pp.2-16, 2005. ,
DOI : 10.1007/978-3-540-32033-3_2
A Pattern Matching Compiler for Multiple Target Languages, LNCS, vol.2622, pp.61-76, 2003. ,
URL : https://hal.archives-ouvertes.fr/inria-00099427
Termination of rewriting under strategies, ACM Transactions on Computational Logic, vol.10, issue.2, 2009. ,
DOI : 10.1145/1462179.1462182
URL : https://hal.archives-ouvertes.fr/inria-00182432
Term rewriting and all that, 1998. ,
Termination of Priority Rewriting -Extended Version. HAL-INRIA Open Archive Number inria, p.349031, 2008. ,
URL : https://hal.archives-ouvertes.fr/inria-00349031
Well-quasi ordering, the tree theorem and Vazsonyi's conjecture, Trans. Amer. Math. Soc, pp.95-210, 1960. ,
Proving innermost normalisation automatically, LNCS, vol.1232, pp.157-171, 1997. ,
DOI : 10.1007/3-540-62950-5_68
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.722
Specifying and Reasoning About Dynamic Access-Control Policies, LNCS, vol.4130, pp.632-646, 2006. ,
DOI : 10.1007/11814771_51
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.79.8098
Let us consider (µ?) B , which can be divided as follows: (µ?) B = (µ?) B?Dom(?) ? (µ?) B?Dom(?) ,
we have Var (?x) ? Ran(?), and then (µ?)x = µ(?x) = µ Ran(?) (?x) = (µ Ran(?) ?)x, Therefore (µ?) B?Dom(?) = (µ Ran(?) ?) B?Dom(?) ,
we have ?x = x, and then (µ?)x = µ(?x) = µx. Therefore we have (µ?) B?Dom(?) = µ B?Dom(?), Henceforth we get (µ?) B = (µ Ran(?) ?) B?Dom(?) ?µ B?Dom(?) ,