This paper describes two new bisimulation equivalences for the pure untyped call-by-value /spl lambda/-calculus, called enf bisimilarity and enf ...

This paper describes two new bisimulation equivalences for the pure untyped call-by-value ?-calculus, called enf bisimilarity and enf bisimilarity up to ?

Head Normal Form Bisimulation for Pairs and the \lambda\mu-Calculus · Computer Science, Mathematics. Logic in Computer Science · 2006.

We demonstrate the normal form bisimulation proof principle by using it to establish a syntactic minimal invariance result and the uniqueness of the fixed point ...

This paper describes two new bisimulation equivalences for the pure untyped call-by-value ?-calculus, called enf bisimilarity and enf bisimilarity up to ?

This paper describes two new bisimulation equivalences for the pure untyped call-by-value λ-calculus, called enf bisimilarity and enf bisimilarity up to η.

This paper describes two new bisimulation equivalences for the pure untyped call-by-value λ-calculus, called enf bisimilarity and enf bisimilarity up to η.

Eager Normal Form Bisimulation. Soren B. Lassen. Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), IEEE Computer Society ...

When restricted to the plain calculus, the bisimilarity relates exactly those terms that are equivalent w.r.t. the contextual equivalence in the plain calculus.

Nov 29, 2019 · Abstract. Normal form bisimulation, also known as open bisimulation, is a coinductive technique for higher-order program equivalence in ...