Thu Sep 3 10:36:07 CEST 2009
It's starting to become more clear that what I am looking for with
Staapl and other metaprogramming based on functional programming
techniques is the concept of `implementability': is it possible to
eliminate high-level constructs that cannot be implemented at run time
due to the different semantics of the target language.
Given a generic representation of an algorithm and a staging compiler,
is it possible to map the representation on the targed given the
current set of constraints.
So, this would be something inbetween staging and partial evaluation.