Author： Coquand T.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.290, Iss.1, 2003-01, pp. : 1107-1113
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 syntactical proof of the operational equivalence of two -terms
Theoretical Computer Science, Vol. 180, Iss. 1, 1997-06 ,pp. :
Access to resources
Recommend
Syntactical and semantical aspects of Faust
By Orlarey Y. Fober D. Letz S.
Soft Computing, Vol. 8, Iss. 9, 2004-09 ,pp. :
Syntactical Methods for Braids of Three Strands
By Burckel S.
Journal of Symbolic Computation, Vol. 31, Iss. 5, 2001-05 ,pp. :
A shrinking lemma for indexed languages
By Gilman R.H.
Theoretical Computer Science, Vol. 163, Iss. 1, 1996-08 ,pp. :