Author： Kesner D.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.238, Iss.1, 2000-05, pp. : 183-220
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
Combining algebraic rewriting, extensional lambda calculi, and fixpoints
Theoretical Computer Science, Vol. 169, Iss. 2, 1996-12 ,pp. :
Access to resources
Recommend
Hybrid Extensional Prototype Compositionality
By Jylkkä Jussi
Minds and Machines, Vol. 21, Iss. 1, 2011-02 ,pp. :
Asymptotic Enumeration of Extensional Acyclic Digraphs
Algorithmica, Vol. 66, Iss. 4, 2013-08 ,pp. :
A -calculus with explicit substitutions
By Ferrari G.-L. Montanari U. Quaglia P.
Theoretical Computer Science, Vol. 168, Iss. 1, 1996-11 ,pp. :
Explicit substitutions for pi-congruences
By Quaglia P.
Theoretical Computer Science, Vol. 269, Iss. 1, 2001-10 ,pp. :