atlv is a generic binary data encoding that preserves the data’s leaf-spine structure while providing customizable tags and dictating minimal semantics.

so i’m playing with a virtual machine idea based on closures. basic idea is that each procedure takes a fixed number of inputs, and a call either adds insufficient inputs and so returns a new closure or adds enough inputs and so invokes the procedure (which returns whatever it returns).