Context lemma

A context lemma (also sometimes called an operational extensionality lemma) is...

Please expand.

References

Milner, Robin. ‘Fully Abstract Models of Typed λ-Calculi’. Theoretical Computer Science 4, no. 1 (1977): 1–22. https://doi.org/10.1016/0304-3975(77)90053-6.

@article{milner_1977,
	title = {Fully abstract models of typed λ-calculi},
	volume = {4},
	issn = {03043975},
	doi = {10.1016/0304-3975(77)90053-6},
	pages = {1--22},
	number = {1},
	journaltitle = {Theoretical Computer Science},
	author = {Milner, Robin},
	date = {1977},
}

Ong, C.-H. L. 1995. ‘Correspondence between Operational and Denotational Semantics: The Full Abstraction Problem for PCF’. In Handbook of Logic in Computer Science, edited by S. Abramsky, Dov M. Gabbay, and T. S. E. Maibaum. Vol. 4. Oxford University Press. pdf

@incollection{ong_correspondence_1995,
	title = {Correspondence between operational and denotational semantics: the full abstraction problem for {PCF}},
	volume = {4},
	booktitle = {Handbook of {Logic} in {Computer} {Science}},
	publisher = {Oxford University Press},
	author = {Ong, C.-H. L.},
	editor = {Abramsky, S. and Gabbay, Dov M. and Maibaum, T. S. E.},
	year = {1995}
}