Pure imperative programming

Courtesy Lambda the Ultimate - Programming Languages Weblog  Fri, 06/20/2008 - 03:56

Two intensively studied intermediate representations in compiler theory are Static Single Assignment form (SSA) and CPS translations, and Richard Kelsey's 1995 paper, A Correspondence Between Continuation Passing Style and Static Single Assignment Form (.ps.gz) , which shows a nearly-complete, exact equivalence between the two IRs.

The correspondence shows how the imperatively expressed SSA can be regarded as side-effect free, and Andrew Appel has pushed this idea to claim that SSA is functional programming .

This result is...

Tags:

 

More related items

Why Object-Oriented Languages Need Tail Calls
The Fortress blog has a recent post, Why Object-Oriented Languages Need Tail Calls, where Guy Steele argues for the necessity of proper tail call implementations without rehashing two of the...

Functional Pearl: Type-safe pattern combinators
Functional Pearl: Type-safe pattern combinators, by Morten Rhiger: Macros still have not made their way into typed higher-order programming languages such as Haskell and Standard ML....


 

Post new comment

The content of this field is kept private and will not be shown publicly.
computer-internet.marc8.com