Review of Cheptre solution #31
Description
Apart from the probably low practical relevance, it is nice to extend the comparison of MTLs with really all kinds of programming languages, including logic programming languages. The solution shows that the way model transformations are expressed in ATL declarative rules is actually quite close to logic programming languages as it seems straight-forward to translate. The question that comes to mind is what do we gain from that relationship? I am not very knowledgable about Cheptr or Prolog, but if there was a generic incrementalization capability built for Cheptr, that could render something useful.
Interestingly, I have to say that I find the alternative style that was used in the apply2 stage a lot easier to understand, even though it is made of many more rules (though smaller ones). Why would you say that these are more likely a base for an incremental solution?
Therefore, I am excited to see an incremental version of it, if you manage to make it happen.