//do i = 1, n // a[i] = a[i] + c // x[i+1] = x[i]*7 + x[i+1] + a[i] //end do //NOTE: in Alphabets, the left-hand side array expression must be identity affine fission {N | N>1} given int c; int ain {i|1<=i<=N}; int xin {i|1<=i<=N+1}; returns int a {i|1<=i<=N}; int x {i|2<=i<=N}; through a[i] = ain[i] + c; x[i] = case {| i==2} : xin[i]; {| i> 2} : x[i-1]*7 + xin[i] + a[i-1]; esac; . affine stencil1D {N,T|T>0 && N>=3} given int X {i|0<=i 0 && i==0 } : X[i]; {|s > 0 && i==N-1 } : X[i]; {|s > 0 && 1<=i4 && width>=2} //given // int ImgIn {i,j|0<=i