Optimal Type Lifting

@inproceedings{Saha1998OptimalTL,
  title={Optimal Type Lifting},
  author={Bratin Saha and Zhong Shao},
  booktitle={Types in Compilation},
  year={1998}
}
Modern compilers for ML-like polymorphic languages have used explicit run-time type passing to support advanced optimizations such as intensional type analysis, representation analysis and tagless garbage collection. Unfortunately, maintaining type information at run time can incur a large overhead to the time and space usage of a program. In this paper, we present an optimal type-lifting algorithm that lifts all type applications in a program to the top level. Our algorithm eliminates all run… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 33 references

A theory of quali ed types

M. P. Jones
In The 4th European Symposium on Programming, • 1992
View 14 Excerpts
Highly Influenced

Report on the programming language Haskell, a non-strict, purely functional language version 1.2

P. Hudak, S. P. Jones, W P.
1992
View 5 Excerpts
Highly Influenced

The De nition of Standard ML (Revised)

R. Milner, M. Tofte, R. Harper, D. MacQueen
1997
View 8 Excerpts
Highly Influenced

Tag-Free Garbage Collection Using Explicit Type Parameters

LISP and Functional Programming • 1994
View 7 Excerpts
Highly Influenced

Definition of standard ML

View 8 Excerpts
Highly Influenced

A Modular Fully-lazy Lambda Lifter in HASKELL

Softw., Pract. Exper. • 1991
View 7 Excerpts
Highly Influenced

Typed Cross-Module Compilation

ICFP • 1998
View 2 Excerpts

An overview of the FLINT/ML compiler

Z. Shao
In Proc. 1997 ACM SIGPLAN Workshop on Types in Compilation, • 1997
View 3 Excerpts

Similar Papers

Loading similar papers…