Content deleted Content added
No edit summary |
|||
Line 51:
and \'''f''':⟨'''x'''<sub>1</sub>,'''x'''<sub>2</sub>,...,'''x'''<sub>n</sub>⟩ = '''f''':⟨\'''f''':⟨'''x'''<sub>1</sub>,...,'''x'''<sub>n-1</sub>⟩,'''x'''<sub>n</sub>⟩
and \'''f''':⟨ ⟩ = '''unit f'''
==Equational functions==
In addition to being constructed from primitives by functionals, a function may be defined recursively by an equation, the simplest kind being:
'''f''' ≡ ''E'''''f'''
where ''E''''''f''' is an [[expression (programming)|expression]] built from primitives, other defined functions, and the function symbol '''f''' itself, using functionals.
An example of a primitive function is the '''selector''' function family, denoted by '''1''','''2''',... where:
'''1''':⟨'''x'''<sub>1</sub>,...,'''x'''<sub>n</sub>⟩ = '''x'''<sub>1</sub>
'''''i''''':⟨'''x'''<sub>1</sub>,...,'''x'''<sub>n</sub>⟩ = '''x'''<sub>i</sub> if 0 < '''''i''''' ≤ n
= ⊥ otherwise
[[es:FP (lenguaje de programación)]]
| |||