Computes the length of a well-structured list. Signals an error if l is an acyclic improper list. Never returns if l is cyclic.[1]
| [1] | For overall consistency, it would probably be better if length simply returned the amount of the proper part of an acyclic list. That way, the Dylan definition for map would be known to iterate (min (length l) ...) times. |