Research on "Formal Methods in Computing"

Non-standard type inference for functional programs

ABSTRACT. We propose a general framework for ``non-standard type inference based'' static analyses of typed functional programs and study inference systems (with and without conjunction) for strictness, totality, and dead-code analyses. A key feature of our framework is that it provides a foundation of the program analyses which is based directly on the operational semantics of the programming language considered. This results in a rather direct presentation which involves relatively little mathematical overhead. We develop a semantical investigation of the systems and discuss in some detail possible implementations of the presented analyses. In particular we give sound and complete inference algorithms for strictness and dead-code analyses without conjunction.

• dvi.gz , ps.gz

BIBTEX.

@phdthesis{Damiani:PHD-98,
   author    = {F. Damiani},
   title     = {Non-standard type inference for functional programs},
   year      = {1998},
   month     = {February},
   address   = {C.so Svizzera 185 - I 10149 Torino - Italy},
   school    = {Dipartimento di Informatica, Universit\`a di Torino}
}