Previously a Lambda function taking natural number arguments A1 to
An would be compiled to a circuit with arguments x1 to x(n+1)
where argument xi in the circuit for i<(n+1) stands for argument
A(n-i) and x(n+1) stands as an unused variable.
Current change omits the final variable and reverses the rest, so
that the compiled circuit will have arguments xn to x1 in that
order.
Previously a Lambda function taking natural number arguments
A1
toAn
would be compiled to a circuit with argumentsx1
tox(n+1)
where argumentxi
in the circuit for i<(n+1) stands for argumentA(n-i)
andx(n+1)
stands as an unused variable.Current change omits the final variable and reverses the rest, so that the compiled circuit will have arguments
xn
tox1
in that order.Hence one gets results such as:
Note that this changes how to input coproduct type circuit variables.