Uniqueness and Completeness Analysis of Array Comprehensions Uniqueness and Completeness Analysis of Array Comprehensions 1

Abstract

In this paper we introduce the uniqueness and completeness problems of array comprehensions. An array comprehension has the uniqueness property if it deenes each array element at most once. Uniqueness is a necessary condition for correctness in single assignment languages such as Haskell, Id, and Sisal. The uniqueness problem can be stated as a data… (More)

Topics

  • Presentations referencing similar topics