Towards a theory of bisimulation for local names

@article{Jeffrey1999TowardsAT,
  title={Towards a theory of bisimulation for local names},
  author={Alan Jeffrey and Julian Rathke},
  journal={Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)},
  year={1999},
  pages={56-66}
}
A.M. Pitts and I.D.B. Stark (1998) have proposed the v-calculus as a language for investigating the interaction of unique name generation and higher-order functions. They developed a sound model based on logical relations, but left completeness as an open problem. In this paper, we develop a complete model based on bisimulation for a labelled transition system semantics. We show that bisimulation is complete, but not sound, for the v-calculus. We also show that by adding assignment to the v… CONTINUE READING

Similar Papers

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 44 CITATIONS

A bisimulation for dynamic sealing

VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

A theory of bisimulation for a fragment of concurrent ML with local names

  • Theor. Comput. Sci.
  • 2004
VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

CONCUR 2000 — Concurrency Theory

Catuscia Palamidessi
  • Lecture Notes in Computer Science
  • 2000
VIEW 10 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Formalizing a Secure Foreign Function Interface

VIEW 5 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Algorithmic games for full ground references

  • Formal Methods in System Design
  • 2018
VIEW 1 EXCERPT
CITES BACKGROUND

Validating Brouwer's continuity principle for numbers using named exceptions

  • Mathematical Structures in Computer Science
  • 2017
VIEW 2 EXCERPTS
CITES BACKGROUND & METHODS

A nominal exploration of intuitionism

VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS

References

Publications referenced by this paper.
SHOWING 1-10 OF 21 REFERENCES

Names and higher-order functions

VIEW 15 EXCERPTS
HIGHLY INFLUENTIAL

Equality in lazy computation systems

  • [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science
  • 1989
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Bisimilarity as a Theory of Functional Programming

  • Theor. Comput. Sci.
  • 1999
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Operational semantics of a focusing debugger

  • Electr. Notes Theor. Comput. Sci.
  • 1995
VIEW 9 EXCERPTS
HIGHLY INFLUENTIAL

A calculus for cryptographic protocols: The spi calculus

A. Gordon, M. Abadi
  • Research Report 149, Digital Equipment Corporation Systems Research Center,
  • 1998
VIEW 1 EXCERPT

Mobile ambients

A. Gordon, L. Cardelli
  • In Proc. FoSSaCS ’98, LNCS. Springer-Verlag,
  • 1998
VIEW 1 EXCERPT