Author： Quaglia P.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.269, Iss.1, 2001-10, pp. : 83-134
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
A -calculus with explicit substitutions
By Ferrari G.-L. Montanari U. Quaglia P.
Theoretical Computer Science, Vol. 168, Iss. 1, 1996-11 ,pp. :
Access to resources
Recommend
Confluence of extensional and non-extensional -calculi with explicit substitutions
By Kesner D.
Theoretical Computer Science, Vol. 238, Iss. 1, 2000-05 ,pp. :
Proof-term synthesis on dependent-type systems via explicit substitutions
By Munoz
Theoretical Computer Science, Vol. 266, Iss. 1, 2001-09 ,pp. :
On syntactic congruences for -languages
Theoretical Computer Science, Vol. 183, Iss. 1, 1997-08 ,pp. :