The idea would be that Terms would not have context but operations on terms
would? Okay, I think I agree. That is something similar to what javac does.
The idea would be that the only information stored in the Term itself would
be information which is directly computable from the term in question. Does
that make sense?
On Apr 24, 2014 1:43 PM, "Radu Mereuta" <notifications@github.com> wrote:

> In src/javasources/KTool/src/org/kframework/kil/Production.java:
>
> > @@ -87,9 +87,16 @@ public Lexical getLexical() {
> >      }
> >
> >      public boolean isConstant() {
> > +        // TODO(Radu): properly determine if a production is a constant or not, just like below
>
> There is the corner case where Rewrite is actually a computed sort.
> Plus, working on modularity would be easier, since I would have to
> transform only one object, the Context.
>
> —
> Reply to this email directly or view it on GitHub<https://github.com/kframework/k/pull/397/files#r11964850>
> .
>