|
==Sources==
*{{ Journalcite referencejournal
| Authorauthor = Abramsky, S., Jagadeesan, R., and Malacaria, P.
| Titletitle = Full Abstraction for PCF
| Journaljournal = Information and Computation
| Datedate= 2000
| Pagespages = 409-470
| Volumevolume = 163
| Numberissue = 2
| IDid = {{doi|10.1006/inco.2000.2930}}
}}
*{{ Journalcite referencejournal
| Authorauthor = Hyland, J. M. E. and Ong, C.-H. L.
| Titletitle = On Full Abstraction for PCF
| Journaljournal = Information and Computation
| Datedate= 2000
| Pagespages = 285-408
| Volumevolume = 163
| Numberissue = 2
| IDid = {{doi|10.1006/inco.2000.2917}}
}}
*{{ Journalcite referencejournal
| Authorauthor = O'Hearn, P. W. and Riecke, J. G
| Titletitle = Kripke Logical Relations and PCF
| Journaljournal = Information and Computation
| Datedate = 1995
| Pagespages = 107-116
| Volumevolume = 120
| Numberissue = 1
| IDid = {{doi|10.1006/inco.1995.1103}}
}}
*{{Book reference
| URL = http://users.comlab.ox.ac.uk/luke.ong/publications/index.html
}}
*{{ Journalcite referencejournal
| Authorauthor = Plotkin, G. D.
| Titletitle = LCF considered as a programming language
| Journaljournal = Theoretical Computer Science
| Datedate= 1977
| Pagespages = 223-255
| Volumevolume = 5
| IDid = {{doi|10.1016/0304-3975(77)90044-5}}
}}
| 