A feature constraint system for logic programming with entailment, Theoretical Computer Science, vol.122, issue.1-2, p.263283, 1994. ,
DOI : 10.1016/0304-3975(94)90209-7
Lambda Calculus: its Syntax and Semantics, 1984. ,
ELAN from a rewriting logic point of view, Theoretical Computer Science, vol.285, issue.2, p.155185, 2002. ,
DOI : 10.1016/S0304-3975(01)00358-9
URL : https://hal.archives-ouvertes.fr/inria-00100974
Separability and translatability of sequential term rewrite systems into the lambda calculus, 2001. ,
The rewriting calculus - part II, Logic Journal of IGPL, vol.9, issue.3, p.427498, 2001. ,
DOI : 10.1093/jigpal/9.3.377
URL : https://hal.archives-ouvertes.fr/inria-00100532
Matching Power, Proceedings of RTA'2001, 2001. ,
DOI : 10.1007/3-540-45127-7_8
URL : https://hal.archives-ouvertes.fr/inria-00099308
Rewriting calculus with xpoints: Untyped and rst-order systems, 2003. ,
DOI : 10.1007/978-3-540-24849-1_10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.7213
An Overview of Cafe Project, Proc. of CafeOBJ Workshop, 1996. ,
Pattern matching in trees, Journal of the ACM, vol.29, issue.1, p.6895, 1982. ,
Resolution d'Equations dans les Languages d'Ordre 1, These de Doctorat D'Etat, 1976. ,
Fast Pattern Matching in Strings, SIAM Journal on Computing, vol.6, issue.2, p.323350, 1977. ,
DOI : 10.1137/0206024
Parallel reduction in lambda-calculus. Information and Computation, p.120127, 1995. ,
An Overview of ASF+SDF, Language Prototyping, p.131, 1996. ,
DOI : 10.1142/9789812830043_0001
Lambda Calculus with Patterns, 1990. ,
Typage et déduction dans le calcul de réécriture, Thèse de doctorat, 2005. ,