Henning Makholm and J. B. Wells
Type
inference for PolyA
Technical Report HW-MACS-TR-0013, Heriot-Watt Univ., School of Math. & Comput. Sci., January 2004
We present an automatic type inference algorithm for
PolyA, a type system for Mobile Ambients presented
in earlier work by us together with Torben
Amtoft. We present not only a basic inference
algorithm, but also several optimizations to it
aimed at reducing the size of the inferred
types. The final algorithm has been implemented and
verified to work on small examples. We discuss some
small problems that still exist and methods for
solving them.
[ bib |
.pdf ]
Back
This file has been generated by
bibtex2html 1.43