Higher-level programming, such as any and all, could be implemented in a language without being so slow. For example, there are Linear Constraint Programming frameworks that work well. Trilogy blew away Prolog for such things.

Also, such a simple use might be akin to using a while loop to sort. Would a bubble sort be a good example of how to use these high-level "structured" flow mechanims 35 years ago when they were new?

Such a general implementation is n-squared because it knows nothing about the CODE block. If it knew that the function was transitive, it could be O(n).

Hey, that's a good use for "properties". Tag a function with such things as transitive and purity (the same input always generates the same output w/no side effects), and the caller can optomize.

—John