Programming Computable Functions (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Programming Computable Functions" in English language version.

Last modified: 07:07:12, 3 August 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

86doi.org

2^nd place

32ed.ac.uk

1,867^th place

1,129^th place

32ox.ac.uk

541^st place

356^th place

11stanford.edu

194^th place

182^nd place

11hdl.handle.net

66^th place

34^th place

11web.archive.org

1^st place

11qmul.ac.uk

2,246^th place

3,626^th place

11arxiv.org

49^th place

31^st place

11syr.edu

1,643^rd place

794^th place

arxiv.org (Global: 49^th place; English: 31^st place)

Abramsky, S.; Jagadeesan, R.; Malacaria, P. (15 December 2000). "Full Abstraction for PCF". Information and Computation. 163 (2): 409–470. arXiv:1311.6125. doi:10.1006/inco.2000.2930.

doi.org (Global: 2^nd place; English: 2^nd place)

Plotkin, Gordon D. (December 1977). "LCF considered as a programming language" (PDF). Theoretical Computer Science. 5 (3): 223–255. doi:10.1016/0304-3975(77)90044-5.
Milner, Robin (February 1977). "Fully abstract models of typed λ-calculi" (PDF). Theoretical Computer Science. 4 (1): 1–22. doi:10.1016/0304-3975(77)90053-6. hdl:20.500.11820/731c88c6-cdb1-4ea0-945e-f39d85de11f1.
Hyland, J. M. E.; Ong, C.-H. L. (15 December 2000). "On Full Abstraction for PCF". Information and Computation. 163 (2): 285–408. doi:10.1006/inco.2000.2917.
Abramsky, S.; Jagadeesan, R.; Malacaria, P. (15 December 2000). "Full Abstraction for PCF". Information and Computation. 163 (2): 409–470. arXiv:1311.6125. doi:10.1006/inco.2000.2930.
O'Hearn, P. W.; Riecke, J. G. (1995). "Kripke Logical Relations and PCF". Information and Computation. 120 (1): 107–116. doi:10.1006/inco.1995.1103.
Loader, R. (2001). "Finitary PCF is not decidable". Theoretical Computer Science. 266 (1–2): 341–364. doi:10.1016/S0304-3975(00)00194-8.

ed.ac.uk (Global: 1,867^th place; English: 1,129^th place)

homepages.inf.ed.ac.uk

Plotkin, Gordon D. (December 1977). "LCF considered as a programming language" (PDF). Theoretical Computer Science. 5 (3): 223–255. doi:10.1016/0304-3975(77)90044-5.

pure.ed.ac.uk

Milner, Robin (February 1977). "Fully abstract models of typed λ-calculi" (PDF). Theoretical Computer Science. 4 (1): 1–22. doi:10.1016/0304-3975(77)90053-6. hdl:20.500.11820/731c88c6-cdb1-4ea0-945e-f39d85de11f1.

hdl.handle.net (Global: 66^th place; English: 34^th place)

Milner, Robin (February 1977). "Fully abstract models of typed λ-calculi" (PDF). Theoretical Computer Science. 4 (1): 1–22. doi:10.1016/0304-3975(77)90053-6. hdl:20.500.11820/731c88c6-cdb1-4ea0-945e-f39d85de11f1.

ox.ac.uk (Global: 541^st place; English: 356^th place)

users.comlab.ox.ac.uk

Ong, C.-H. L. (1995). "Correspondence between Operational and Denotational Semantics: The Full Abstraction Problem for PCF". In Abramsky, S.; Gabbay, D.; Maibau, T. S. E. (eds.). Handbook of Logic in Computer Science. Oxford University Press. pp. 269–356. Archived from the original on 2006-01-07. Retrieved 2006-01-19.

ora.ox.ac.uk

Hyland, J. M. E.; Ong, C.-H. L. (15 December 2000). "On Full Abstraction for PCF". Information and Computation. 163 (2): 285–408. doi:10.1006/inco.2000.2917.

qmul.ac.uk (Global: 2,246^th place; English: 3,626^th place)

qmro.qmul.ac.uk

Abramsky, S.; Jagadeesan, R.; Malacaria, P. (15 December 2000). "Full Abstraction for PCF". Information and Computation. 163 (2): 409–470. arXiv:1311.6125. doi:10.1006/inco.2000.2930.

stanford.edu (Global: 194^th place; English: 182^nd place)

theory.stanford.edu

"PCF is a programming language for computable functions, based on LCF, Scott’s logic of computable functions."^[1] Programming Computable Functions is used by (Mitchell 1996). Mitchell, John C. (1996). "The Language PCF". Foundations for Programming Languages. MIT Press. ISBN 9780262133210.

syr.edu (Global: 1,643^rd place; English: 794^th place)

surface.syr.edu

O'Hearn, P. W.; Riecke, J. G. (1995). "Kripke Logical Relations and PCF". Information and Computation. 120 (1): 107–116. doi:10.1006/inco.1995.1103.

web.archive.org (Global: 1^st place; English: 1^st place)

Ong, C.-H. L. (1995). "Correspondence between Operational and Denotational Semantics: The Full Abstraction Problem for PCF". In Abramsky, S.; Gabbay, D.; Maibau, T. S. E. (eds.). Handbook of Logic in Computer Science. Oxford University Press. pp. 269–356. Archived from the original on 2006-01-07. Retrieved 2006-01-19.

Programming Computable Functions (English Wikipedia)

arxiv.org (Global: 49th place; English: 31st place)

doi.org (Global: 2nd place; English: 2nd place)

ed.ac.uk (Global: 1,867th place; English: 1,129th place)