Mon May 20 22:04:58 EDT 2013

Tension between compile time and run time aggregate datastructures

I need an abstraction that can both represent indexed data structures
(arrays) and lists of discrete nodes (registers).  Maybe this is
some memory from the FeldSpar paper poking through?

The idea is that a list is both a "real list" and an "indexing function".