Anindya Banerjee
A modular, polyvariant, and type-based closure
analysis
In Proc. 1997 Int'l Conf. Functional Programming, pages 1-10
ACM Press, 1997
We observe that the principal typing
property of a type system is the enabling
technology for modularity and
separate compilation
[96]. We use this technology
to formulate a modular and polyvariant closure
analysis, based on the rank 2 intersection types
annotated with control-flow information.
Modularity manifests itself in a syntax-directed,
annotated-type inference algorithm that can analyse
program fragments containing free
variables: a principal typing property is
used to formalise it. Polyvariance manifests itself
in the separation of different behaviours of the
same function at its different uses: this is
formalised via the rank 2 intersection types. As the
rank 2 intersection type discipline types at least
all (core) ML programs, our analysis can be used in
the separate compilation of such programs.
[ bib |
.ps.gz |
.pdf.gz |
.pdf |
.html ]
Back
This file has been generated by
bibtex2html 1.61
Copyright notice: The documents contained
in these pages are included by the contributing authors as a means to
ensure timely dissemination of scholarly and technical work on a
non-commercial basis. Copyright and all rights therein are maintained
by the authors or by other copyright holders, notwithstanding that
they have offered their works here electronically. It is understood that all persons copying this information will
adhere to the terms and constraints invoked by each author's
copyright. These works
may not be reposted without the explicit permission of the copyright
holder.
If you experience problems downloading any of the files above,
it is most likely because your browser does not handle compressed
files correctly.
In particular, Netscape might save the file in the compressed
gz-format with extension .ps or
.pdf (indicating postscript or PDF, resp.). You can work around this by saving the file,
renaming it to .ps.gz or .pdf.gz, and then
uncrompress it.
