Home » forums » LtU Forum

Data flow analysis on functional Language

Hi everyone,

I need to perform a data flow analysis on a lamda-calculus like functional language.

Ideally, this should be a type-based approach. Can anyone on this forum direct me a mean to do this.

What is particularly troublesome is that a data flow analysis naturally necessitates a fix-point analysis which is done recursively on the structure of the program whereas a type analysis is done in one pass over the program.

I would be grateful for any insight anyone might have to help me solve this problem.

R.K.

By kilrati at 2005-05-26 23:12 | LtU Forum | previous forum topic | next forum topic | other blogs | 6891 reads

Comment viewing options

Select your preferred way to display the comments and click "Save settings" to activate your changes.

see Shivers's dissertation &c

Olin Shivers
# Control-Flow Analysis of Higher-Order Languages
# Data-flow analysis and type recovery in Scheme
here

By e at Thu, 2005-05-26 23:50 | login or register to post comments

Take a look at Allyn Dimock's work...

here.

By neelk at Fri, 2005-05-27 00:47 | login or register to post comments

A good page for finding point

A good page for finding pointers about type based program analysis is Jens Palsbergs collection of references: here

The papers I can recommend for your purposes are Christian Mossin's papers. If you want to have polymorphism in you annotations I suggest you look at the paper "Constraint Abstractions" by myself and Jörgen Gustavsson and " Type-Based Flow Analysis: From Polymorphic Subtyping to CFL-Reachability" by Rehof and Fähndrich.

Good Luck

By Josef Svenningsson at Fri, 2005-05-27 10:20 | login or register to post comments