Optimizing ML Using a Hierarchy of Monadic Types

@inproceedings{Tolmach1998OptimizingMU,
  title={Optimizing ML Using a Hierarchy of Monadic Types},
  author={Andrew P. Tolmach},
  booktitle={Types in Compilation},
  year={1998}
}
We describe a type system and typed semantics that use a hierarchy of monads to describe and delimit a variety of e ects, including non-termination, exceptions, and state, in a call-by-value functional language. The type system and semantics can be used to organize and justify a variety of optimizing transformations in the presence of e ects. In addition, we describe a simple monad inferencing algorithm that computes the minimum e ect for each subexpression of a program, and provides more… CONTINUE READING
Highly Cited
This paper has 32 citations. REVIEW CITATIONS

References

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

Polymorphic type, region and e ect inference

  • J.-P. Talpin, P. Jouvelot
  • Journal of Functional Programming, 2:245{271,
  • 1992
Highly Influential
9 Excerpts

Towards algebras of encapsulated e ects

  • R. Kieburtz, J. Launchbury
  • (un published manuscript),
  • 1997

Design and Implementation of Code Optimizations for a Type-Directed Compiler for Standard ML

  • D. Tarditi
  • PhD thesis, Carnegie Mellon University, Dec.
  • 1996
1 Excerpt

Encapsulated e ects

  • R. Kieburtz, J. Launchbury
  • (unpublished manuscript), Oct.
  • 1995

Similar Papers

Loading similar papers…