4,494
edits
Monadic function: Difference between revisions
Jump to navigation
Jump to search
m
Text replacement - "<source" to "<syntaxhighlight"
Miraheze>Adám Brudzewsky No edit summary |
m (Text replacement - "<source" to "<syntaxhighlight") |
||
| (7 intermediate revisions by 6 users not shown) | |||
| Line 1: | Line 1: | ||
:''For [[operator]]s with one operand, see [[Monadic operator]].'' | :''For [[operator]]s with one operand, see [[Monadic operator]].'' | ||
A '''monadic function''' is a [[function]] with a single [[argument]], written to its right. It is one of three possible function [[ | A '''monadic function''' is a [[function]] with a single [[argument]], written to its right. It is one of three possible function [[valence]]s; the other two are [[dyadic]] and [[niladic]]. The term '''prefix function''' is used outside of APL to describe APL's monadic function syntax. | ||
In APL, a single function can be both monadic and dyadic; such a function is called [[ambivalent]] or sometimes variadic. Function pages on the APL Wiki usually only describe one valence of an ambivalent function because the connection between the two may not be consistent across languages. In this case the function is described as monadic even though it may only be half of an ambivalent function. | In APL, a single function can be both monadic and dyadic; such a function is called [[ambivalent]] or sometimes variadic. Function pages on the APL Wiki usually only describe one valence of an ambivalent function because the connection between the two may not be consistent across languages. In this case the function is described as monadic even though it may only be half of an ambivalent function. | ||
A sequence of monadic functions is evaluated from right to left, a convention [[Comparison with traditional mathematics|drawn from mathematics]]. Such a sequence can be seen in the following expression: | A sequence of monadic functions is evaluated from right to left, a convention [[Comparison with traditional mathematics|drawn from mathematics]]. Such a sequence can be seen in the following expression: | ||
< | <syntaxhighlight lang=apl> | ||
f ← {⍵,⌽⍵} | f ← {⍵,⌽⍵} | ||
f ×⍨ ⍳ 5 | f ×⍨ ⍳ 5 | ||
1 4 9 16 25 25 16 9 4 1 | 1 4 9 16 25 25 16 9 4 1 | ||
</ | </syntaxhighlight> | ||
The functions < | The functions <syntaxhighlight lang=apl inline>f</syntaxhighlight>, <syntaxhighlight lang=apl inline>×⍨</syntaxhighlight> ([[Times]] [[Commute]]), and <syntaxhighlight lang=apl inline>⍳</syntaxhighlight> ([[Iota]]) are each monadic functions: a named [[dfn]], a [[derived function]], and a [[primitive function|primitive]], respectively. Evaluating them first produces the [[Index|indices]] up to 5, then multiplies each index by itself to square it, then [[catenate]]s the resulting list to its [[reverse]]. | ||
{{APL | |||
== External links == | |||
* [http://wiki.nars2000.org/index.php/Monadic NARS2000] | |||
{{APL syntax}}[[Category:Kinds of functions]] | |||