Talk:Inductive type

Merge

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)

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)

Misleading examples

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 ${\mathsf {sup}}(1_{\mathbf {2} },{\mathsf {abort}})$, where ${\mathsf {abort}}$ is any function $\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 $\mathrm {succ} (a)={\mathsf {sup}}(2_{\mathbf {2} },{\mathsf {constantly}}(a))$, where ${\mathsf {constantly}}:A\to \mathbf {1} \to A$ is defined by ${\mathsf {constantly}}(a)(1_{\mathbf {1} })=a$.

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