Bidirectional data flow analysis for type inferencing.

DOI10.1016/S1477-8424(03)00012-5zbMATH Open1056.68054OpenAlexW2005172143WikidataQ59505648 ScholiaQ59505648MaRDI QIDQ1399007FDOQ1399007

Authors: Uday P. Khedker, Alan Mycroft, Dhananjay M. Dhamdhere 

Publication date: 7 August 2003

Published in: Computer Languages, Systems \& Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1477-8424(03)00012-5

Recommendations

• Using locality of flow in dataflow analyses.
• Type systems equivalent to data-flow analyses for imperative languages
• Exact flow analysis
• scientific article; zbMATH DE number 1222409
• scientific article; zbMATH DE number 1130261

zbMATH Keywords

Bidirectional data flow analysisType inferencing

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Cites Work

• A theory of type polymorphism in programming
• Title not available (Why is that?)
• The Principal Type-Scheme of an Object in Combinatory Logic
• Title not available (Why is that?)
• Monotone data flow analysis frameworks
• Properties of data flow frameworks: A unified model
• Title not available (Why is that?)
• Dynamic typing in polymorphic languages
• A solution to a problem with Morel and Renvoise's “Global optimization by suppression of partial redundancies”
• Global optimization by suppression of partial redundancies
• Monoids for Rapid Data Flow Analysis

Cited In (3)

• Let arguments go first
• Type systems equivalent to data-flow analyses for imperative languages
• Title not available (Why is that?)

This page was built for publication: Bidirectional data flow analysis for type inferencing.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1399007)