>On Mon, 2007-04-02 at 00:33 +0200, Julian Rohrhuber wrote:
>> would you deduce rewrite rules from the code changes? I often use
>> rewrite rules for composition, but I've never used it for analysis of
>> code changes. Maybe in a little language subset it would work.
>
>Yes, I have the bol processor in mind.
>
>> for me it can be pretty simple. I just want to avoid keeping multiple
>> copies of the full code, and just have the changes.
>
>Aha right, why not use an existing revision control system like svn?
maybe a lightweight version of one. But it would have to be pretty
speed optimised, so I'm not sure if it is overkill.
> > >I'm just reading about Q, which has similar syntax to haskell but with
>> >dynamic typing and some interesting features.
>> I've seen that there are sound features.
>> what do you find interesting?
>
>Well I haven't used it, but that you can call functions with unbound
>variables is pretty weird, for example where square X = X*X
>
>==> square (A+B)
>(A+B)*(A+B)
>
>where A and B haven't been assigned yet... The interpreter keeps
>applying rewrite rules until it can't any more, and then stops. I'm not
>sure what happens then...
do you know what it does with recursion? When you write square(A+X)
what does it do?
--
.
Received on Sun Apr 01 2007 - 23:50:17 BST