freenode/#clasp - IRC Chatlog
Search
8:44:29
frgo
I'd look into that error myself but we are now arriving at Hammerfest and we are making a sight seeing tour through that town...
9:09:06
beach
Oh, I have a better idea for the inlining-by-local-graph-rewriting technique. It will work for assignments and for references to free variables as well. And for loops.
9:40:26
Shinmera
beach: By the way, the assistant /finally/ said that he definitely won't supervise my thesis last week, so now I'm back to square one, trying to find someone.
9:57:20
beach
Shinmera: Your considering it made me work out an algorithm, so it had some good consequences after all. At least for me.
9:57:27
Shinmera
I don't understand how 100+ students are supposed to find a bachelor's thesis here. Almost nothing is posted, and most of the profs you talk to either don't really have much of an idea, no time, or don't like your ideas, or all of the above.
9:58:31
Shinmera
Anyway, I'm in talk with other people now, so hopefully I can find something sometime soon-ish. Sigh.
12:04:15
beach
New figures for new inlining technique: fig21.pdf - fig27.pdf on the metamodular site. I don't dare type the URL because I was considered a spammer by freenode when I did that.
12:06:57
Shinmera
Yeah, they recently made a change in policy. Posting lines too frequently gets you automatically banned.
12:09:17
beach
The new technique copies the entire lexical environment of the callee into the caller. It keeps a mapping between callee instructions and caller instructions to avoid copying an instruction multiple times.
12:10:41
beach
The CALL to be inlined, copies the entire copied callee environment to the callee so that execution can be resumed in the callee at any point, thus allowing partial inlining.
12:17:12
beach
The technique obviously doesn't work for recursive functions. Exercise for the reader: In what other situations does it not work?
12:58:06
Shinmera
beach: So of the three topics you suggested to me, which would I still be able to do my thesis on?
15:11:38
Shinmera
Path Replication Using Local Graph Rewriting in Intermediate Code, Control-Flow Analysis in the Presence of Nested Functions and Threads, Partial Inlining of Local Functions Using Local Graph Rewriting