Skip to search formSkip to main contentSkip to account menu

Parametric polymorphism

Known as: Impredicative polymorphism, Rank, First-class polymorphism 
In programming languages and type theory, parametric polymorphism is a way to make a language more expressive, while still maintaining full static… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
We present a mechanised semantics and soundness proof for the HOL Light kernel including its definitional principles, extending… 
Highly Cited
2007
Highly Cited
2007
Culex pipiens Linnaeus, Culex pipiens f. molestus Forskal and the closely related species Culex torrentium Martini are difficult… 
2006
2006
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2006. 
Review
2005
Review
2005
Missing data are often a problem in social science data. Imputation methods fill in the missing responses and lead, under certain… 
2003
2003
The standard way of solving a mathematical program, is to feed the program into some numerical solver, which usually is custom… 
2002
2002
Due to the extreme quantiles involved, standard control charts are very sensitive to the effects of parameter estimation and… 
1997
1997
The concepts of value- and control-flow graphs are important for program analysis of imperative programs. An imperative value… 
Highly Cited
1995
Highly Cited
1995
The concept of Open GIS depends on precise definitions of data, operations and interfaces. This paper argues for the use of… 
1993
1993
It is shown, that deterministic noise (chaos) appearing via destruction of the quasiperiodic motion may be easily suppressed by… 
Highly Cited
1952
Highly Cited
1952
IT has been shown in earlier papers (Cain and Sheppard, 1950; Sheppard, 1951) that, contrary to the opinion of other workers…