Creates let-bindings to compose two lambda functions (producer → consumer).

When composing two operations where the outputs of one lambda (producer) flow into the inputs of another lambda (consumer), this function generates the necessary let-bindings that connect matching outputs to inputs.

The function looks for outputs from the producer that correspond to inputs expected by the consumer, and creates bindings like: let consumer_param = producer_result

This allows the two lambdas to be composed into a operation.

Returns: Statements containing let-bindings for each matched producer output → consumer input pair. Preserves certificates from the producer results.

Example: If out_p[i] == inp_c[j], then producer's result[i] is bound to consumer's parameter[j]. Unmatched outputs (producer results not consumed) are omitted.

Is this the type of an irregular result of a FlatMap lambda - one that is concatenated with the results of the other iterations, rather than merely collected? These are exactly the results whose outermost size is the existential size returned by the lambda.

The element types of the irregular (concatenated) arrays produced by a FlatMap lambda, with the existential outer dimension stripped. The remaining dimensions are never existential.

Split a list with one element per result of a FlatMap into its metadata results - the size, the shape array, the flag array, and the offset array - and its value results.

Split a list with one element per value result of a FlatMap lambda into the irregular and the regular parts.

The types of the regular results of a FlatMap lambda - the ones that are collected rather than concatenated. These never have existential sizes.

A mapper that simply returns the SOAC verbatim.

Does this Screma correspond to a simple map, without any reduction or scan results?

Does this Screma correspond to a reduce-map composition?

Does this Screma correspond to a pure reduce?

Does this Screma correspond to pure scan?

Does this Screma correspond to a scan-map composition?

Construct a Screma corresponding to a map.

Map a monadic action across the immediate children of a SOAC. The mapping does not descend recursively into subexpressions and is done left-to-right.

Construct a Screma with possibly multiple scans, the given map function, and a given post lambda.

Construct a lambda that takes parameters of the given types and simply returns them unchanged.

A lambda with no parameters that returns no values.

Prettyprint the given histogram operation.

Prettyprint the given Screma.

Prettyprint the given Stream.

How many reduction results are produced by these Reduces?

Construct a Screma with possibly multiple reductions, and the given map function.

Construct a Screma with possibly multiple reductions, and identity map function.

How many reduction results are produced by these Scans?

Construct a Screma with possibly multiple scans, and identity map function.

Construct a Screma with possibly multiple scans, and the given map function.

The types produced by a single Screma, given the size of the input array.

Combine multiple reduction operators to a single operator.

Combine multiple scan operators to a single operator.

The type of a SOAC.

A helper for defining TraverseOpStms.

Type-check a SOAC.

How to compute a single reduction result.

A second-order array combinator (SOAC).

Like Mapper, but just for SOACs.

How to compute a single scan result.

The essential parts of a Screma factored out (everything except the input arrays).