Talk:Functor (functional programming)

This is the talk page for discussing improvements to the Functor (functional programming) article.
This is not a forum for general discussion of the article's subject.

Put new text under old text. Click here to start a new topic.
New to Wikipedia? Welcome! Learn to edit; get help.

Article policies

Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL

This article has not yet been rated on Wikipedia's content assessment scale.
It is of interest to the following WikiProjects:

Please add the quality rating to the {{WikiProject banner shell}} template instead of this project banner. See WP:PIQA for details.

Computing Start‑class Low‑importance

	This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing articles
Start	This article has been rated as Start-class on Wikipedia's content assessment scale.
Low	This article has been rated as Low-importance on the project's importance scale.

Haskell-specific and not general to functional programming

This page is about a specific Haskell feature implementing a mappable abstraction. All the examples and links are about Haskell only. In fact the name Functor means something different in other functional languages such as Ocaml and standard ML. Therefore this page title is incorrect and misleading. It is forgivable that the page creator knew only Haskell and was ignorant about other functional languages and made a bad generalization, but the title should now be changed from the incorrect (functional programming) to clarify this is a Haskell feature. Alternatively the content could be rewritten to include the different meanings in various functional languages, expanding what is mentioned in the disambiguation page.

Assumes Understanding

This page seems to be written in a form where it adds value if one already understands what a functor does. Some possible solutions would be to show some examples using plausible values instead of 'A', 'B', and 'C'. It might mention what computer science problem is solved with this construct, e.g., "Allows creating an undo/redo chain of actions without knowledge of the individual actions". I cannot state what should be written without grokking the article; I can only state I fail to grok the article. Charles Merriam (talk) 22:15, 18 September 2022 (UTC)[reply]