The LLAMA represents data structures exactly like the WAM. This allows
LL functions to access and manipulate data that has been created by
REL programs without having the need of copying.
In the WAM (and thus in the LLAMA), Stack and Heap have a
tagged architecture:
an entry consists of a tuple . The following sections
describe the representation of constants, lists, and structures
on Stack and Heap.