go-v.orgcodex
Menu
Page tools

codex · Philosophy

Polymorphic recursion

In computer science, polymorphic recursion (also referred to as Milner–Mycroft typability or the Milner–Mycroft calculus) refers to a recursive parametrically polymorphic function where the type parameter changes with each recursive invocation made, instead of staying constant. Type inference for polymorphic recursion is equivalent to semi-unification and therefore undecidable and requires the use of a semi-algorithm or programmer-supplied type annotations.

Wikipedia contributors, "Polymorphic recursion", Wikipedia, revision 1377115289, retrieved 20 November 2026, source, CC BY-SA 4.0.

More Philosophy · Search the codex