SRFI 231: Nonempty Intervals and Generalized Arrays (Updated^2)

[Arthur A. Gleckler]

Scheme Request for Implementation 231,
"Nonempty Intervals and Generalized Arrays (Updated^2),"
by Bradley J. Lucier,
is now available for discussion.

Its draft and an archive of the ongoing discussion are available at
<https://srfi.schemers.org/srfi-231/>.

You can join the discussion of the draft by filling out the subscription
form on that page.

You can contribute a message to the discussion by sending it to
<srfi...@srfi.schemers.org>.

Here's the abstract:

This SRFI specifies an array mechanism for Scheme. Arrays as defined
here are quite general; at their most basic, an array is simply a
mapping, or function, from multi-indices of exact integers
i₀, …, i_(d − 1) to Scheme values. The set of multi-indices
i₀, …, i_(d − 1) that are valid for a given array form the domain of
the array. In this SRFI, each array's domain consists of the cross
product of nonempty intervals of exact integers
[l₀, u₀) × [l₁, u₁) × ⋯ × [l_(d − 1), u_(d − 1)) of ℤ^(d), d-tuples of
integers. Thus, we introduce a data type called d-intervals, or more
briefly intervals, that encapsulates this notion. (We borrow this
terminology from, e.g., Elias Zakon's Basic Concepts of Mathematics.)
Specialized variants of arrays provide portable programs with
efficient representations for common use cases.

This is a revised version of SRFI 179.

Regards,


SRFI Editor