Combinatory Array Logic with Sums

Abstract

We prove an NP upper bound on a theory of integer-indexed integer-valued arrays that extends combinatory array logic with an ordering relation on the index set and the ability to express sums of elements. We compare our fragment with seven other fragments in the literature in terms of their expressiveness and computational complexity.

Some inaccuracies in the original report have been corrected. Accepted for presentation in PLS '14