Re:Mike Pall: Ramblings on languages and architectures
by toolslive on Wednesday April 17, 2013 @03:23AM
(#5563190)
I always considered CPS and SSA to be duals.
(Just like FST and Lambda-calculus are duals)
[ Parent
| on HN ]
Re:Mike Pall: Ramblings on languages and architectures
by abecedarius on Wednesday April 17, 2013 @10:52PM
(#5568681)
What do you mean by FST?
Re:Mike Pall: Ramblings on languages and architectures
by catwell on Thursday April 18, 2013 @09:25AM
(#5570425)
In that context it means Finite State Transducer.
Basically it is a FSM (Finite State Machine) that generates an output depending on its input.
I don't think you lose too much meaning of his sentence if you replace FST by Turing Machines (the more usual comparison to lambda-calculus).
Re:Mike Pall: Ramblings on languages and architectures
by abecedarius on Thursday April 18, 2013 @12:49PM
(#5571639)
Ah, thanks. I thought the comment had some precise dualities in mind, but I guess not? (There is such a correspondence for CPS and SSA, cf Appel's paper.)