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 and therefore undecidable and requires the use of a semi-algorithm or programmer-supplied type annotations.
- Bot
- enmedic
- Comment
- enIn 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 and therefore undecidable and requires the use of a semi-algorithm or programmer-supplied type annotations.
- Date
- enJuly 2022
- Has abstract
- enIn 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 and therefore undecidable and requires the use of a semi-algorithm or programmer-supplied type annotations.
- Is primary topic of
- Polymorphic recursion
- Label
- enPolymorphic recursion
- Link from a Wikipage to an external page
- www.brics.dk/LS/95/3/BRICS-LS-95-3.ps.gz
- www.kestrel.edu/home/people/meertens/publications/papers/Incremental_polymorphic_type_checking_in_B.pdf
- www.dcc.ufmg.br/~camarao/ml0-impl.ps
- www.cis.uni-muenchen.de/~leiss/polyrec/polyrec.cisbericht.96-101.ps.gz
- www.cis.uni-muenchen.de/~leiss/polyrec.html
- citeseerx.ist.psu.edu/viewdoc/summary%3Fdoi=10.1.1.31.3551
- www.academia.edu/download/34646914/Vasconcellos_C.pdf
- Link from a Wikipage to another Wikipage
- 5,6%5D,%5B7%5D,%5B8,9
- ACM Transactions on Programming Languages and Systems
- Alan Mycroft
- Binding-time analysis
- Category:Object-oriented programming
- Category:Polymorphism (computer science)
- Category:Recursion
- Class (computer programming)
- Computer science
- Electronic Notes in Theoretical Computer Science
- Function (computer science)
- Functional programming
- Haskell (programming language)
- Higher-ranked polymorphism
- Java (programming language)
- Lambert Meertens
- Nested datatype
- Parametric polymorphism
- Recursion (computer science)
- Region-based memory management
- Richard Bird (computer scientist)
- Robin Milner
- Semi-algorithm
- Semi-unification
- Tower of Hanoi
- Type annotation
- Type-based program analysis
- Type inference
- Type signature
- Undecidable problem
- University of Munich
- SameAs
- 4tRtg
- m.080hrcx
- Q7226600
- SeeAlso
- Higher-ranked type
- Subject
- Category:Object-oriented programming
- Category:Polymorphism (computer science)
- Category:Recursion
- WasDerivedFrom
- Polymorphic recursion?oldid=1121133086&ns=0
- WikiPageLength
- 7830
- Wikipage page ID
- 24826482
- Wikipage revision ID
- 1121133086
- WikiPageUsesTemplate
- Template:Cbignore
- Template:Cite book
- Template:Cite journal
- Template:Dead link
- Template:Expand section
- Template:Infobox programming language
- Template:Infobox software
- Template:Reflist
- Template:See also
- Template:Sfn