Bidirectional data flow analysis for type inferencing.
From MaRDI portal
Publication:1399007
DOI10.1016/S1477-8424(03)00012-5zbMath1056.68054OpenAlexW2005172143WikidataQ59505648 ScholiaQ59505648MaRDI QIDQ1399007
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Properties of data flow frameworks: A unified model
- Monotone data flow analysis frameworks
- A theory of type polymorphism in programming
- A solution to a problem with Morel and Renvoise's “Global optimization by suppression of partial redundancies”
- Monoids for Rapid Data Flow Analysis
- Global optimization by suppression of partial redundancies
- Dynamic typing in polymorphic languages
- The Principal Type-Scheme of an Object in Combinatory Logic
This page was built for publication: Bidirectional data flow analysis for type inferencing.