Author： Bertolissi Clara
Publisher： Springer Publishing Company
ISSN： 1388-3690
Source： LISP and Symbolic Computation, Vol.19, Iss.4, 2006-12, pp. : 345-376
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Combinatory weak reduction in lambda calculus
Theoretical Computer Science, Vol. 198, Iss. 1, 1998-05 ,pp. :
Access to resources
Recommend
The self-reduction in lambda calculus
Theoretical Computer Science, Vol. 235, Iss. 1, 2000-03 ,pp. :
Discrete Event Systems in Rewriting Logic
By Landauer C.
Electronic Notes in Theoretical Computer Science, Vol. 4, Iss. 1, 2004-01 ,pp. :
LARS: A learning algorithm for rewriting systems
By Eyraud Rémi
Machine Learning, Vol. 66, Iss. 1, 2007-01 ,pp. :
Interaction nets and term-rewriting systems
Theoretical Computer Science, Vol. 190, Iss. 1, 1998-01 ,pp. :