This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Mathematics Low‑priority This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics 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.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics Low This article has been rated as Low-priority on the project's priority scale. Computer science Low‑importance This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles 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.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science Low This article has been rated as Low-importance on the project's importance scale. Things you can help WikiProject Computer science with: Here are some tasks awaiting attention: Article requests : Requested articles/Applied arts and sciences/Computer science, computing, and Internet Cleanup : Computer science articles needing attention Computer science articles needing expert attention Copyedit : Computing Expand : Computer science Infobox : Computer science articles without infoboxes Maintain : Timeline of computing 2020–present Photo : Find pictures for the biographies of computer scientists (see List of computer scientists) Computing articles needing images Stubs : Computer science stubs Unreferenced : WikiProject Computer science/Unreferenced BLPs Project-related : Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

I propose merging this page with Recursive data type, which even says in its lead that recursive types are also known as inductive types. siddharthist (talk) 00:20, 18 January 2018 (UTC)[reply]

Weak oppose, on the grounds that Recursive data type focuses on computer science application, while Inductive type is approach from mathematics of Type theory. They certainly need to be better linked, perhaps using an about hatnote. Klbrain (talk) 05:14, 10 June 2019 (UTC)[reply]

In the example with natural numbers and lists encoded as W-types, the text suggests that f(1₂) = 0 is "representing the constructor for zero, which takes no arguments". The constructor for zero is ${\displaystyle {\mathsf {sup}}(1_{\mathbf {2} },{\mathsf {abort}})}$, where ${\displaystyle {\mathsf {abort}}}$ is any function ${\displaystyle \mathbf {0} \to A}$ (here assumed to be polymorphic). It is difficult to see how f(1₂) could represent this constructor.

Similarly, the successor function is encoded by ${\displaystyle \mathrm {succ} (a)={\mathsf {sup}}(2_{\mathbf {2} },{\mathsf {constantly}}(a))}$, where ${\displaystyle {\mathsf {constantly}}:A\to \mathbf {1} \to A}$ is defined by ${\displaystyle {\mathsf {constantly}}(a)(1_{\mathbf {1} })=a}$.

I propose moving the examples to after the introduction of ${\displaystyle {\mathsf {sup}}}$ and updating the examples accordingly.