Skip to main content
Article thumbnail
Location of Repository

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

By Manfred Schmidt-Schauß, Elena Machkasova and David Sabel


This note shows that in non-deterministic extended lambda calculi with letrec, the tool of applicative (bi)simulation is in general not usable for contextual equivalence, by giving a counterexample adapted from data flow analysis. It also shown that there is a flaw in a lemma and a theorem concerning finite simulation in a conference paper by the first two authors

Topics: Formale Semantik, Lambda-Kalkül, Nichtdeterminismus, ddc:004
Year: 2009
OAI identifier:

Suggested articles


  1. Amb breaks well-pointedness, ground amb doesn’t.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.