In type theory, a function is (structurally) recursive if it pattern matches on the structure of one or more inductive types.
In type theory, a function is (structurally) recursive if it pattern matches on the structure of one or more inductive types.