Redundant code with PyJL indexing translation
When translating Python's 0-indexed arrays to Julia's 1-indexed arrays, PyJL produces redundant binary operations. As an example, consider the bubble-sort implementation below:

```
def bubble_sort(seq: List[int]) -> List[int]:
    L = len(seq)
    for _ in range(L):
        for n in range(1, L):
            if seq[n] < seq[n - 1]:
                seq[n - 1], seq[n] = seq[n], seq[n - 1]
    return seq
```
This gets translated to Julia as follows:
```
function bubble_sort(seq::Array{Int64})::Array{Int64}
    L = length(seq)
    for _ = 0:L-1
        for n = 1:L-1
            if seq[n+1] < seq[n-1+1]
                seq[n-1+1], seq[n+1] = (seq[n+1], seq[n-1+1])
            end
        end
    end
    return seq
end
```
Notice that there are redundant binary operations when incrementing the indexing values. This should be fixed in a future release