System F (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "System F" in English language version.

refsWebsite

Global rank English rank

2^nd place

2^nd place

1,871^st place

1,234^th place

1,564^th place

1,028^th place

low place

7,981^st place

low place

low place

1web.archive.org

1^st place

1^st place

1church-project.org

low place

low place

low place

7,198^th place

low place

low place

4,903^rd place

3,679^th place

chalmers.se

cse.chalmers.se

Geuvers H, Nordström B, Dowek G. "Proofs of Programs and Formalisation of Mathematics" (PDF). p. 51.

church-project.org

Wells, J.B. (1999). "Typability and type checking in System F are equivalent and undecidable". Ann. Pure Appl. Logic. 98 (1–3): 111–156. doi:10.1016/S0168-0072(98)00047-5."The Church Project: Typability and type checking in {S}ystem {F} are equivalent and undecidable". 29 September 2007. Archived from the original on 29 September 2007.

cmu.edu

cs.cmu.edu

Harper R. "Practical Foundations for Programming Languages, Second Edition" (PDF). pp. 142–3.

doi.org

Girard, Jean-Yves (1986). "The system F of variable types, fifteen years later". Theoretical Computer Science. 45: 160. doi:10.1016/0304-3975(86)90044-7. However, in [3] it was shown that the obvious rules of conversion for this system, called F by chance, were converging.
Wells, J.B. (1999). "Typability and type checking in System F are equivalent and undecidable". Ann. Pure Appl. Logic. 98 (1–3): 111–156. doi:10.1016/S0168-0072(98)00047-5."The Church Project: Typability and type checking in {S}ystem {F} are equivalent and undecidable". 29 September 2007. Archived from the original on 29 September 2007.
Cardelli, Luca; Martini, Simone; Mitchell, John C.; Scedrov, Andre (1994). "An extension of system F with subtyping". Information and Computation, vol. 9. North Holland, Amsterdam. pp. 4–56. doi:10.1006/inco.1994.1013.

ed.ac.uk

homepages.inf.ed.ac.uk

Philip Wadler (2005) The Girard-Reynolds Isomorphism (second edition) University of Edinburgh, Programming Languages and Foundations at Edinburgh

wcms.inf.ed.ac.uk

Philip Wadler (2005) The Girard-Reynolds Isomorphism (second edition) University of Edinburgh, Programming Languages and Foundations at Edinburgh

haskell.org

gitlab.haskell.org

"System FC: equality constraints and coercions". gitlab.haskell.org. Retrieved 2019-07-08.

hw.ac.uk

macs.hw.ac.uk

Wells, J.B. (2005-01-20). "Joe Wells's Research Interests". Heriot-Watt University.

inria.fr

caml.inria.fr

"OCaml 4.09 reference manual". 2012-09-11. Retrieved 2019-09-23.

ocaml.org

"OCaml 4.00.1 release notes". ocaml.org. 2012-10-05. Retrieved 2019-09-23.

web.archive.org

Wells, J.B. (1999). "Typability and type checking in System F are equivalent and undecidable". Ann. Pure Appl. Logic. 98 (1–3): 111–156. doi:10.1016/S0168-0072(98)00047-5."The Church Project: Typability and type checking in {S}ystem {F} are equivalent and undecidable". 29 September 2007. Archived from the original on 29 September 2007.