Polymorphic Recursion
Polymorphic Recursion is a form of recursion in type systems where a function’s recursive invocation occurs at a different type instance than its own, enabling type refinement across recursive calls and requiring the function to be polymorphically typed in its own definition.
50
Publications
3.7K
Citations
69
Authors
38
Institutions
Publications per year
2017–2026
0
Parents
50
Ralf Lämmel, Simon Peyton Jones · 2003 · 350 citations
Design and implementation of generics for the .NET Common language runtime
Andrew Kennedy, Don Syme · 2001 · 199 citations
1–5 of 50
69
3
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 69
38
Microsoft (United States)
Redmond, United States
6 h-index
9 publications
1.2K citations
Carnegie Mellon University
Pittsburgh, United States
4 h-index
9 publications
320 citations
University of Copenhagen
Copenhagen, Denmark
3 h-index
3 publications
691 citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
3 h-index
5 publications
489 citations
University of Bonn
Bonn, Germany
3 h-index
3 publications
247 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
2 publications
168 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
2 h-index
2 publications
138 citations

Vrije Universiteit Amsterdam
Amsterdam, The Netherlands
2 h-index
2 publications
450 citations
1–8 of 38
6 publications · 567 citations
6
h-index
4 publications · 151 citations
4
h-index
3 publications · 148 citations
3
h-index
3 publications · 90 citations
3
h-index
Repository · 1 publications · 21 citations
1
h-index
1–5