Research topics in functional programming
Erratic fudgets: a semantic theory for an embedded coordination language
Science of Computer Programming - Special issue on coordination languages and architectures
The Expressive Power of Indeterminate Primitives in Asynchronous Computation
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Amb Breaks Well-Pointedness, Ground Amb Doesn't
Electronic Notes in Theoretical Computer Science (ENTCS)
Mathematical Structures in Computer Science
Safety of nöcker's strictness analysis
Journal of Functional Programming
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Congruence of Bisimulation in a Non-Deterministic Call-By-Need Lambda Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi
Information and Computation
On generic context lemmas for higher-order calculi with sharing
Theoretical Computer Science
Hi-index | 0.89 |
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.