Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.180, Iss.1, 1997-06, pp. : 371-375
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 Marriage Lemma
By Coquand T.
Theoretical Computer Science, Vol. 290, Iss. 1, 2003-01 ,pp. :
Access to resources
Recommend
Operational equivalence for interaction nets
Theoretical Computer Science, Vol. 297, Iss. 1, 2003-03 ,pp. :
A coinductive completeness proof for the equivalence of recursive types
By Cardone
Theoretical Computer Science, Vol. 275, Iss. 1, 2002-03 ,pp. :
Syntactical and semantical aspects of Faust
By Orlarey Y. Fober D. Letz S.
Soft Computing, Vol. 8, Iss. 9, 2004-09 ,pp. :