Compose: Difference between revisions

From APL Wiki
Jump to navigation Jump to search
m (Text replacement - "{{APL built-ins}}" to "{{APL built-ins}}Category:Primitive operators")
m (Text replacement - "</source>" to "</syntaxhighlight>")
 
(3 intermediate revisions by 2 users not shown)
Line 1: Line 1:
{{Built-in|Compose|∘}} or '''Composition''' is the most common name for the [[primitive operator|primitive]] [[dyadic operator]] denoted with a [[Jot]] (<source lang=apl inline>∘</source>) introduced by [[NARS]] and included in the [[Dyalog APL]] family. On the APL Wiki, Compose is divided into its two cases, [[Beside]] when both [[operand]]s are [[function]]s, and [[Bind]] when one is a function and the other an [[array]].
{{Built-in|Compose|∘}} or '''Composition''' is the most common name for the [[primitive operator|primitive]] [[dyadic operator]] denoted with a [[Jot]] (<syntaxhighlight lang=apl inline>∘</syntaxhighlight>) introduced by [[NARS]] and included in the [[Dyalog APL]] family. On the APL Wiki, Compose is divided into its two cases, [[Beside]] when both [[operand]]s are [[function]]s, and [[Bind]] when one is a function and the other an [[array]].


{{quote|Composition assembles functions and arguments to form derived functions. This provides the glue with which to put together functions and arguments so that operator's arguments can be more complex than single functions.<ref>Carl M. Cheney. ''APL*PLUS Nested Arrays System'' ([[NARS]] reference manual). [[STSC]]. 1981.</ref>}}
{{quote|Composition assembles functions and arguments to form derived functions. This provides the glue with which to put together functions and arguments so that operator's arguments can be more complex than single functions.<ref>Carl M. Cheney. ''APL*PLUS Nested Arrays System'' ([[NARS]] reference manual). [[STSC]]. 1981.</ref>}}


In [[Ken Iverson]]'s designs [[Rationalized APL]], [[A Dictionary of APL]], and the [[J]] language, the composition (<source lang=apl inline>⍤</source>) or Compose (<source lang=j inline>&</source>) refers to a different kind of composition, the [[Over]] operator.
In [[Ken Iverson]]'s designs [[Rationalized APL]], [[A Dictionary of APL]], and the [[J]] language, the composition (<syntaxhighlight lang=apl inline>⍤</syntaxhighlight>) or Compose (<syntaxhighlight lang=j inline>&</syntaxhighlight>) refers to a different kind of composition, the [[Over]] operator.


More recently, the term "composition" is used in [[Dyalog APL]] to refer to any of a family of operators including [[Beside]] and [[Bind]] (<source lang=apl inline>∘</source>), [[Commute]] and [[Constant]] (<source lang=apl inline>⍨</source>), [[Atop]] (<source lang=apl inline>⍤</source>), and [[Over]] (<source lang=apl inline>⍥</source>).<ref>[[Marshall Lochbaum]]. [https://dyalog.tv/Dyalog19/?v=czWC4tjwzOQ Tacit Techniques with Dyalog version 18.0 Operators] ([https://www.dyalog.com/uploads/conference/dyalog19/presentations/D04_Tacit_Techniques.zip slides]) at [[Dyalog '19]].</ref> [[Extended Dyalog APL]] and [[dzaima/APL]] add to this list the operators [[Under]] (<source lang=apl inline>⍢</source>) and [[Reverse Compose]] (<source lang=apl inline>⍛</source>).
More recently, the term "[[function composition|composition]]" is used in [[Dyalog APL]] to refer to any of a family of operators including [[Beside]] and [[Bind]] (<syntaxhighlight lang=apl inline>∘</syntaxhighlight>), [[Commute]] and [[Constant]] (<syntaxhighlight lang=apl inline>⍨</syntaxhighlight>), [[Atop]] (<syntaxhighlight lang=apl inline>⍤</syntaxhighlight>), and [[Over]] (<syntaxhighlight lang=apl inline>⍥</syntaxhighlight>).<ref>[[Marshall Lochbaum]]. [https://dyalog.tv/Dyalog19/?v=czWC4tjwzOQ Tacit Techniques with Dyalog version 18.0 Operators] ([https://www.dyalog.com/uploads/conference/dyalog19/presentations/D04_Tacit_Techniques.zip slides]) at [[Dyalog '19]].</ref> [[Extended Dyalog APL]] and [[dzaima/APL]] add to this list the operators [[Under]] (<syntaxhighlight lang=apl inline>⍢</syntaxhighlight>) and [[Reverse Compose]] (<syntaxhighlight lang=apl inline>⍛</syntaxhighlight>).


== References ==
== References ==
<references />
<references />
{{APL built-ins}}[[Category:Primitive operators]]
{{APL built-ins}}[[Category:Primitive operators]][[Category:Composition operators]]

Latest revision as of 22:22, 10 September 2022

Compose () or Composition is the most common name for the primitive dyadic operator denoted with a Jot () introduced by NARS and included in the Dyalog APL family. On the APL Wiki, Compose is divided into its two cases, Beside when both operands are functions, and Bind when one is a function and the other an array.

Composition assembles functions and arguments to form derived functions. This provides the glue with which to put together functions and arguments so that operator's arguments can be more complex than single functions.[1]

In Ken Iverson's designs Rationalized APL, A Dictionary of APL, and the J language, the composition () or Compose (&) refers to a different kind of composition, the Over operator.

More recently, the term "composition" is used in Dyalog APL to refer to any of a family of operators including Beside and Bind (), Commute and Constant (), Atop (), and Over ().[2] Extended Dyalog APL and dzaima/APL add to this list the operators Under () and Reverse Compose ().

References

  1. Carl M. Cheney. APL*PLUS Nested Arrays System (NARS reference manual). STSC. 1981.
  2. Marshall Lochbaum. Tacit Techniques with Dyalog version 18.0 Operators (slides) at Dyalog '19.
APL built-ins [edit]
Primitives (Timeline) Functions
Scalar
Monadic ConjugateNegateSignumReciprocalMagnitudeExponentialNatural LogarithmFloorCeilingFactorialNotPi TimesRollTypeImaginarySquare RootRound
Dyadic AddSubtractTimesDivideResiduePowerLogarithmMinimumMaximumBinomialComparison functionsBoolean functions (And, Or, Nand, Nor) ∙ GCDLCMCircularComplexRoot
Non-Scalar
Structural ShapeReshapeTallyDepthRavelEnlistTableCatenateReverseRotateTransposeRazeMixSplitEncloseNestCut (K)PairLinkPartitioned EnclosePartition
Selection FirstPickTakeDropUniqueIdentityStopSelectReplicateExpandSet functions (IntersectionUnionWithout) ∙ Bracket indexingIndexCartesian ProductSort
Selector Index generatorGradeIndex OfInterval IndexIndicesDealPrefix and suffix vectors
Computational MatchNot MatchMembershipFindNub SieveEncodeDecodeMatrix InverseMatrix DivideFormatExecuteMaterialiseRange
Operators Monadic EachCommuteConstantReplicateExpandReduceWindowed ReduceScanOuter ProductKeyI-BeamSpawnFunction axisIdentity (Null, Ident)
Dyadic BindCompositions (Compose, Reverse Compose, Beside, Withe, Atop, Over) ∙ Inner ProductDeterminantPowerAtUnderRankDepthVariantStencilCutDirect definition (operator)Identity (Lev, Dex)
Quad names Index originComparison toleranceMigration levelAtomic vector