SSA is Functional Programming (1998) [pdf]

Re:SSA is Functional Programming (1998) [pdf] by chubot on Saturday January 12, 2019 @08:19PM (#18894391)

Yeah now I remember from reading this paper a few weeks ago: An important point is that SSA is not executable!!! The Phi nodes need to be removed I suppose.

I will have to read this paper about Appel to see how that comes into play.

SSA form cannot be directly interpreted in order to generate code. Therefore it must be destructed before compilation can continue. This involves using an algorithm that converts phi-functions into appropriately-placed copy instructions.

Intermediate representations in imperative compilers: A survey

https://scholar.google.com/scholar?cluster=15761365096026414...

[ Parent | on HN ]

Re:SSA is Functional Programming (1998) [pdf] by nickpsecurity on Saturday January 12, 2019 @11:52PM (#18895149)

Like with parallel DFS, I always look for anything people say is not possible. Here's my first hit on Google with a super-quick skim indicating it runs with phi instructions:

http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.74....

May or may not be what you're looking for. Probably interesting nonetheless.

[ Parent | on HN ]

Re:SSA is Functional Programming (1998) [pdf] by chubot on Sunday January 13, 2019 @01:38AM (#18895467)

Thanks, that does look interesting. The fact that interpreting SSA requires a paper means it's nontrivial, which lends credence to the original statement :) In the abstract it says they present a variant of SSA. I will take a look.

[ Parent | on HN ]