Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec

  • Authors:
  • Manfred Schmidt-Schauí;David Sabel;Elena Machkasova

  • Affiliations:
  • Goethe University, Frankfurt, Germany;Goethe University, Frankfurt, Germany;University of Minnesota, Morris, MN, USA

  • Venue:
  • Information Processing Letters
  • Year:
  • 2011

Quantified Score

Hi-index 0.89

Visualization

Abstract

This note provides an example that demonstrates that in non-deterministic call-by-need lambda-calculi extended with cyclic let, extensionality as well as applicative bisimulation in general may not be used as criteria for contextual equivalence w.r.t. may- and two different forms of must-convergence. We also outline how the counterexample can be adapted to other calculi.