This changes implements a LazyList and
LazyListWithEqAndPersistentHashing data structure. These data
structures lazily unpickle their contents.

This change also renames LazilyUnpicklingDictionary to LazyDict.

Fix recognition of striding constraints in counting when other, unused divs are present

See merge request !132

Check no_sync_with attribute in check_insn_attributes()

Closes #55

See merge request !131

Closes #55

Make a way to spell literal local barriers

See merge request !130

Remove numpy dtypes from ArgExtFunction and SegmentedFunction

Closes #80

See merge request !124

Fix a 'threw StopIteration' warning in get_priority_tiers

See merge request !129

Preprocess the kernel before building the cache key

See merge request !127

Preschedule fixes

See merge request !128

preschedule may be interleaved with items not in the preschedule.

inside a subkernel. I'm not sure this heuristic is correct, because
it means that newly scheduled inames will always be scheduled inside
a subkernel.