From rewrite rules to bisimulation congruences

Author： Sewell P.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.274, Iss.1, 2002-03, pp. : 183-230

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

On intuitionistic proof nets with additional rewrite rules and their approximations

By Matsuoka S.  

Electronic Notes in Theoretical Computer Science, Vol. 50, Iss. 2, 2004-01 ,pp. : 1-15

Elsevier

Access to resources Recommend Favorite

Completion of Rewrite Systems with Membership Constraints Part I: Deduction Rules

By Comon H.  

Journal of Symbolic Computation, Vol. 25, Iss. 4, 1998-04 ,pp. : 397-419

Academic Press

Access to resources Recommend Favorite

From Bisimulation to Simulation: Coarsest Partition Problems

By Gentilini R.   Piazza C.   Policriti A.  

Journal of Automated Reasoning, Vol. 31, Iss. 1, 2003-09 ,pp. : 73-103

Springer Publishing Company

Access to resources Recommend Favorite

Bisimulation indexes and their applications

By Ying M.  

Theoretical Computer Science, Vol. 275, Iss. 1, 2002-03 ,pp. : 1-68

Elsevier

Access to resources Recommend Favorite

Transformations and confluence for rewrite systems

By Verma R.M.  

Theoretical Computer Science, Vol. 152, Iss. 2, 1995-12 ,pp. : 269-283

Elsevier

Access to resources Recommend Favorite