Equality in lazy computation systems
Proceedings of the Fourth Annual Symposium on Logic in computer science
Research topics in functional programming
Non-determinism in functional languages
The Computer Journal - Special issue on formal methods: part 1
Structured operational semantics and bisimulation as a congruence
Information and Computation
Lambda-calculi for (strict) parallel functions
Information and Computation
The lazy Lambda calculus in a concurrency scenario
Information and Computation
A call-by-need lambda calculus
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Functional programming and input/output
Functional programming and input/output
Nondeterministic extensions of untyped &lgr;-calculus
Information and Computation
Proving congruence of bisimulation in functional programming languages
Information and Computation
A non-deterministic call-by-need lambda calculus
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Improvement in a lazy context: an operational theory for call-by-need
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bisimilarity as a theory of functional programming
Theoretical Computer Science - Special issue on mathematical foundations of programming semantics
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Operational Theories of Improvement in Functional Languages (Extended Abstract)
Proceedings of the 1991 Glasgow Workshop on Functional Programming
Lambda calculi and linear speedups
The essence of computation
The call-by-need lambda calculus
Journal of Functional Programming
The call-by-need lambda calculus
Journal of Functional Programming
An algebraic definition of simulation between programs
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Mathematical Structures in Computer Science
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
Information Processing Letters
Correctness of program transformations as a termination problem
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
| Hi-index | 0.00 |
We present a call-by-need @l-calculus @l"N"D with an erratic non-deterministic operator pick and a non-recursive let. A definition of a bisimulation is given, which has to be based on a further calculus named @l"~, since the naive bisimulation definition is useless. The main result is that bisimulation in @l"~ is a congruence and coincides with the contextual equivalence. The proof is a non-trivial extension of Howe's method. This might be a step towards defining useful bisimulation relations and proving them to be congruences in calculi that extend the @l"N"D-calculus.