The Avail Programming Language


A tuple whose values are consecutive integers. Intervals are extremely efficient in both time and storage. No matter how large the interval, only a constant amount of time is required to compute it and only a constant amount of space is required to store it.

Example: availableRooms ::= 1 to last available room;