See this document in CiteSeerX!

Operational Equivalence for Interaction Nets  (Make Corrections)  
Maribel Fernández, Ian Mackie



  Home/Search   Context   Related

 
View or download:
di.ens.fr/~maribel/papers/TCS01.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  di.ens.fr/~maribel/papers (more)
(Enter author homepages)

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

Abstract: The notion of contextual (or operational) equivalence is fundamental in the theory of programming languages. By setting up a notion of bisimilarity, and showing that it coincides with contextual equivalence, one obtains a simple coinductive proof technique for showing that two programs are equivalent in all contexts. In this paper we apply these (now standard) techniques to interactions nets, a graphical programming language characterized by local reduction. This work generalizes previous... (Update)

Similar documents (at the sentence level):
34.6%:   A Theory of Operational Equivalence for Interaction Nets - Fernández, Mackie (1999)   (Correct)

Active bibliography (related documents):   More   All
1.1:   Combining Interaction Nets with Externally Defined Programs - Fernández, Mackie, ..   (Correct)
0.3:   Parallel Implementation Models for the lambda-calculus Using the.. - Pinto   (Correct)
0.3:   Parallel Evaluation of Interaction Nets with MPINE - Pinto   (Correct)

Similar documents based on text:   More   All
1.5:   Coinductive Techniques for Operational Equivalence of.. - Fernandez, Mackie (1998)   (Correct)
1.3:   A Calculus for Interaction Nets - Fernandez, Mackie (1999)   (Correct)
1.1:   Interaction Nets and Term Rewriting Systems - Fernández, Mackie (1998)   (Correct)

BibTeX entry:   (Update)

@misc{ ndez-operational,
  author = "Maribel Fern\'andez and Ian Mackie",
  title = "Operational Equivalence for Interaction Nets",
  url = "citeseer.ist.psu.edu/479919.html" }
Citations (may not include all citations):
982   Theoretical Computer Science (context) - Girard - 1987
109   Interaction nets (context) - Lafont - 1990
75   Proving congruence of bisimulation in functional programming.. - Howe - 1996
75   The geometry of optimal lambda reduction - Gonthier, Abadi et al. - 1992
48   Operationally-based theories of program equivalence - Pitts - 1997
19   Information and Computation (context) - Lafont - 1997
14   Bisimilarity for a rst-order calculus of objects with subtyp.. (context) - Gordon, Rees - 1996
11   YALE: Yet another lambda evaluator based on interaction nets (context) - Mackie - 1998
7   Imperial College of Science (context) - Mackie, of et al. - 1994
4   Coinductive techniques for operational equivalence of intera.. (context) - Fern, Mackie - 1998
4   Sequential and concurrent abstract machines for interaction .. (context) - Pinto - 2000
4   Partial evaluation of interaction nets (context) - Bechet - 1992
2   A calculus for interaction nets (context) - Fern, Mackie - 1999
1   A theory of operational equivalence for interaction nets - Fern, Mackie
1   Polymorphic types for interaction nets (context) - Khalil

Documents on the same site (http://www.di.ens.fr/~maribel/papers.html):
Combining Interaction Nets with Externally Defined Programs - Fernández, Mackie, ..   (Correct)
A Theory of Operational Equivalence for Interaction Nets - Fernandez, Mackie   (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