See this document in CiteSeerX!

Completeness of Bisimilarity for Contextual Equivalence in Linear Theories (2001)  (Make Corrections)  
Roy L. Crole



  Home/Search   Context   Related

 
View or download:
www3.oup.co.uk/igpl/Volum...Crole.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  www3.oup.co.uk/igpl/Volum...#Marx (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: 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. (Update)

Active bibliography (related documents):   More   All
2.3:   Completeness of Bisimilarity for Contextual Equivalence in Linear.. - Crole   (Correct)
0.6:   Encoding FIX in Object Calculi - Crole (2002)   (Correct)
0.5:   Mechanized Operational Semantics via (Co)Induction - Simon J. Ambler, Roy L. Crole (1999)   (Correct)

Similar documents based on text:   More   All
0.3:   A Sound Metalogical Semantics for Input/Output Effects - Crole, Gordon (1994)   (Correct)
0.3:   Relating Operational and Denotational Semantics for.. - Crole, Gordon (1999)   (Correct)
0.3:   Error Estimates and Convergence Rates for Variational Hermite.. - Luo, Levesley (1997)   (Correct)

BibTeX entry:   (Update)

@misc{ crole-completeness,
  author = "Roy L. Crole",
  title = "Completeness of Bisimilarity for Contextual Equivalence in Linear Theories",
  url = "citeseer.ist.psu.edu/article/crole01completeness.html" }
Citations (may not include all citations):
982   Theoretical Computer Science (context) - Girard - 1986
906   A structural approach to operational semantics - Plotkin - 1981
447   Prentice-Hall International (context) - Milner, Concurrency - 1989
233   Computational interpretations of linear logic - Abramsky - 1993
233   Natural semantics (context) - Kahn - 1988
179   The lazy lambda calculus - Abramsky - 1990
133   Cambridge Tracts in Theoretical Computer Science (context) - Girard, Types - 1989
112   Bisimilarity as a theory of functional programming (context) - Gordon - 1995
94   Equality in lazy computation systems - Howe - 1989
60   A Term Calculus for Intuitionistic Linear Logic - Benton, Bierman et al. - 1993
48   Operationally Based Theories of Program Equivalence - Pitts - 1997
46   On Intuitionistic Linear Logic (context) - Bierman - 1993
42   volume 752 of Lecture Notes In Mathematics (context) - Barr, Categories - 1979
30   Distinguished dissertations in Computer Science (context) - Gordon, Input et al. - 1994
17   Some notes on inductive and coinductive techniques in the se.. (context) - Pitts - 1994
13   Research Institute for Mathematical Sciences (context) - Hashimoto, Ohori et al. - 1996
13   Operational theories of improvement in functional languages - Sands - 1991
7   Proving congruence of simulation orderings in functional lan.. (context) - Howe - 1993
6   Observations on a Linear PCF - Bierman - 1997
6   Relating Operational and Denotational Semantics for Input /O.. - Crole, Gordon - 1996
5   How Linear is Howe (context) - Crole - 1996
4   The Girard Translation Extended with Recursion - Bra - 1995
4   Department of Mathematics and Computer Science Lecture Notes (context) - Crole, Theory - 1995
4   Mechanised Operational Semantics via (context) - Ambler, Crole - 1999
3   Available as Technical Report (context) - Gordon, Input et al. - 1993
3   volume 7 of Monographs on Computer Science (context) - Nordstr, Petersson et al. - 1990
2   Electronic Notes in Theoretical Computer Science (context) - Pitts, Operational - 1998

Documents on the same site (http://www3.oup.co.uk/igpl/Volume_09/Issue_01/#Marx):   More
How to Avoid the Formal Verification of a Theorem Prover - Avellone, al. (2001)   (Correct)
Partiality and Games: Propositional Logic - Sandu, Pietarinen (2001)   (Correct)
Theorem Proving for Untyped Constructive λ-Calculus.. - Ramsay   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC