Head Normal Form Bisimulation for Pairs and the \lambda\mu-Calculus

@article{Lassen2006HeadNF,
  title={Head Normal Form Bisimulation for Pairs and the \lambda\mu-Calculus},
  author={S\oren B. Lassen},
  journal={21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)},
  year={2006},
  pages={297-306}
}
Bohm tree equivalence up to possibly infinite eta expansion for the pure lambda-calculus can be characterized as a bisimulation equivalence. We call this co-inductive syntactic theory extensional head normal form bisimilarity and in this paper we extend it to the lambdaFP-calculus (the lambda-calculus with functional and surjective pairing) and to two untyped variants of Parigot's lambdamu-calculus. We relate the extensional head normal form bisimulation theories for the different calculi via… CONTINUE READING

From This Paper

Topics from this paper.
3 Citations
22 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 22 references

The Lambda Calculus: Its Syntax and Semantics. Number 103 in Studies in Logic and the Foundations of Mathematics

  • H. P. Barendregt
  • 1984
Highly Influential
8 Excerpts

Alcune proprieta delle forme βη-normali nel λKcalculus

  • C. Böhm
  • Pubblicazioni 696, Instituto per le Applicazioni…
  • 1968
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…