A coinductive completeness proof for the equivalence of recursive types

Author： Cardone  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.275, Iss.1, 2002-03, pp. : 575-587

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Completeness Results for Recursive Data Bases

By Hirst T.   Harel D.  

Journal of Computer and System Sciences, Vol. 52, Iss. 3, 1996-06 ,pp. : 522-536

Academic Press

Access to resources Recommend Favorite

On the Equivalence of Recursive and Nonrecursive Datalog Programs

By Chaudhuri S.   Vardi M.Y.  

Journal of Computer and System Sciences, Vol. 54, Iss. 1, 1997-02 ,pp. : 61-78

Academic Press

Access to resources Recommend Favorite

Alternative Proof of Standard Completeness Theorem for MTL

By Horčík Rostislav  

Soft Computing, Vol. 11, Iss. 2, 2007-01 ,pp. : 123-129

Springer Publishing Company

Access to resources Recommend Favorite

Automatic Synthesis of Recursive Programs: The Proof-Planning Paradigm

By Armando A.  

Automated Software Engineering, Vol. 6, Iss. 4, 1999-10 ,pp. : 329-356

Springer Publishing Company

Access to resources Recommend Favorite

A syntactical proof of the operational equivalence of two -terms

By David R.   Nour K.  

Theoretical Computer Science, Vol. 180, Iss. 1, 1997-06 ,pp. : 371-375

Elsevier

Access to resources Recommend Favorite