Revision as of 02:35, 22 February 2023 edit Headbomb (talk \| contribs) Edit filter managers, Autopatrolled, Extended confirmed users, Page movers, File movers, New page reviewers, Pending changes reviewers, Rollbackers, Template editors 473,332 edits ce ← Previous edit		Revision as of 02:36, 22 February 2023 edit undo Citation bot (talk \| contribs) Bots 5,867,154 edits Alter: template type. Add: eprint, class. Removed parameters. Some additions/deletions were parameter name changes. \| Use this bot. Report bugs. \| Suggested by Headbomb \| #UCB_toolbar Next edit →
Line 147: ===Rank Polymorphism=== Rank polymorphism is one of the defining features of the [[Array_programming\|array programming languages]], like [[APL_(programming_language)\|APL]]. The essence of the rank-polymorphic programming model is implicitly treating all operations as aggregate operations, usable on arrays with arbitrarily many dimensions,<ref>{{cite ~~arxiv~~arXiv\|title=The semantics of rank polymorphism \|date=2019 \|last1=Slepak \|first1=Justin \|last2=Shivers \|first2=Olin \|last3=Manolios \|first3=Panagiotis\|~~arxiv~~class=cs.PL \|eprint=1907.00509 }}</ref> which is to say that rank polymorphism allows functions to be defined to operate on arrays of any shape and size. ==Implementation aspects==

Polymorphism (computer science): Difference between revisions