Skip to main content
Article thumbnail
Location of Repository

Completeness of Bisimilarity for Contextual Equivalence in Linear Theories.

By R. L. Crole


In this paper, we develop new variations of methods from operational semantics, and show how to apply these to a linear type theory which has a lazy operational semantics. In particular, we consider how one can establish contextual equivalences in a linear theory with function types and tensor types by instead establishing bisimulations. Thus bisimilarity is sound for contextual equivalence. Further, we show that bisimilarity is complete for contextual equivalence.\ud \ud We shall show that the notion of a program context in the linear setting is non-trivial. In particular, we give a definition of linear context which is amenable to mechanization in a theorem prover, and explain why a more naive approach to dealing with linear contexts would not be so tractable.\ud \ud The central contributions of the paper are: the formulation, in a linear setting, of a good notion of program context and the associated contextual equivalence; an adaptation of Howe's method; the notion of a linear precongruence; and a proof that bisimilarity is sound and complete for contextual equivalence

Year: 2001
DOI identifier: 10.1093/jigpal
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • http://jigpal.oxfordjournals.o... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.