Analyzing the environment structure of higher-order languages using frame strings

DOI10.1016/J.TCS.2006.12.031zbMath1111.68019OpenAlexW2152540418MaRDI QIDQ879361

Olin Shivers, Matthew Might

Publication date: 11 May 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.12.031

zbMATH Keywords

program analysislambda calculuscontrol-flow analysisdata-flow analysisabstract interpretationcontinuation-passing styleCPSdelta-CFAframe stringshigher-order functional languagessuper-beta

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Related Items (1)

Exploiting reachability and cardinality in higher-order flow analysis

Cites Work

• Definitional interpreters revisited
• Definitional interpreters for higher-order programming languages
• Back to direct style
• A first-order one-pass CPS transformation
• Systematic design of program transformation frameworks by abstract interpretation

This page was built for publication: Analyzing the environment structure of higher-order languages using frame strings