Ideas for an advanced array procedure SRFI John Cowan (11 Jan 2020 23:57 UTC)
Re: Ideas for an advanced array procedure SRFI Arthur A. Gleckler (12 Jan 2020 01:07 UTC)
Re: Ideas for an advanced array procedure SRFI John Cowan (12 Jan 2020 01:36 UTC)
Re: Ideas for an advanced array procedure SRFI Arthur A. Gleckler (12 Jan 2020 02:38 UTC)
Re: Ideas for an advanced array procedure SRFI John Cowan (12 Jan 2020 02:48 UTC)
Re: Ideas for an advanced array procedure SRFI Arthur A. Gleckler (12 Jan 2020 05:02 UTC)
Re: Ideas for an advanced array procedure SRFI Lassi Kortela (12 Jan 2020 12:36 UTC)
Re: Ideas for an advanced array procedure SRFI John Cowan (12 Jan 2020 19:26 UTC)
Re: Ideas for an advanced array procedure SRFI Lassi Kortela (13 Jan 2020 19:17 UTC)
Re: Ideas for an advanced array procedure SRFI Arthur A. Gleckler (13 Jan 2020 21:57 UTC)
Re: Ideas for an advanced array procedure SRFI Bradley Lucier (12 Jan 2020 18:11 UTC)
Re: Ideas for an advanced array procedure SRFI Bradley Lucier (26 Jan 2020 19:37 UTC)
Re: Ideas for an advanced array procedure SRFI Bradley Lucier (17 Jan 2020 00:07 UTC)
Re: Ideas for an advanced array procedure SRFI John Cowan (17 Jan 2020 03:10 UTC)
Re: Ideas for an advanced array procedure SRFI Bradley Lucier (05 May 2022 15:36 UTC)

Re: Ideas for an advanced array procedure SRFI Bradley Lucier 17 Jan 2020 00:07 UTC

On 1/11/20 6:57 PM, John Cowan wrote:
> (array-inner-product sum product a1 a2) => constructs the inner product
> (dot product, matrix product) of a1 and a2, using the dyadic function
> *product* to multiply individual elements and the variadic function
> *sum* to total them.  It is an error if the bounds of the last dimension
> of a1 are not equal to the bounds of the first dimension of a2; the
> bounds of the result are all the remaining bounds of a1 followed by all
> the remaining bounds of a2.

Is sum a "reduction" (which needs no identity element) or a "fold"
(which does)?  Which APL operator is this?

Brad