I have no clue. I'm sure there are languages that do partial evaluation, at least in a JIT way, but I don't know of anything that has JIT recipes, and yet there are some languages I don't understand well enough to say. XD

Particularly, if a language is meant for searching a formal system for a solution, like say a constraint programming system or a proof assistant which lets the user specify the problem and then specify tactics to use to solve it, the underlying implementation might have things in common with this recipe idea. I really don't know these languages, but there's probably a lot we could learn from them.

Another thing... I don't really understand Cristiansen grammars either (http://en.wikipedia.org/wiki/Adaptive_grammar#Christiansen_G...), but I feel like they probably have stuff in common with fexprs. A grammar is all about rewriting terms, which makes it like the rewriting language talked about in this partial evaluation article. In the case of a Cristiansen grammar, each term is bundled with its own set of grammar productions, which seems a lot like saying that each expression is bundled with the environment to evaluate it in.