Skip to main content
SpringerLink
Log in

Introduction

  • Conference paper
  • First Online:
Types in Compilation (TIC 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1473))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ole Agesen, Jens Palsberg, and Michael Schwartzback. Type inference of Self: analysis of objects with dynamic and multiple inheritance. In Proc. European Conference on Object-Oriented Programming — ECOOP’93, 1993.

    Google Scholar 

  2. Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers: principles, techniques, and tools. Addison-Wesley, 1986.

    Google Scholar 

  3. Alexander S. Aiken and Edward L. Wimmers. Type inclusion constraints and type inference. In Functional Programming Languages and Computer Architecture 1993, pages 31–41. ACM Press, 1993.

    Google Scholar 

  4. Andrew W. Appel. Run-time tags aren’t necessary. Lisp and Symbolic Computation, 2(2), 1989.

    Google Scholar 

  5. David Bacon and Peter Sweeney. Fast static analysis of C++ virtual function calls. In Object-Oriented Programming Systems, Languages and Applications ’96, pages 324–341. ACM Press, 1996.

    Google Scholar 

  6. Henry G. Baker. Unify and conquer (garbage, updating, aliasing,...) in functional languages. In Lisp and Functional Programming 1990. ACM Press, 1990.

    Google Scholar 

  7. Anindya Banerjee. A modular, polyvariant, and type-based closure analysis. In International Conference on Functional Programming 1997, pages 1–10. ACM Press, 1997.

    Google Scholar 

  8. Lars Birkedal, Mads Tofte, and Magnus Vejlstrup. From region inference to von Neumann machines via region representation inference. In 23rd symposium Principles of Programming Languages, pages 171–183. ACM Press, 1996.

    Google Scholar 

  9. Patrick Cousot. Types as abstract interpretations. In 24th symposium Principles of Programming Languages, pages 316–331. ACM Press, 1997.

    Google Scholar 

  10. Jeffrey Dean, David Grove, and Craig Chambers. Optimization of object-oriented programs using static class hierarchy analysis. In Proc. European Conference on Object-Oriented Programming — ECOOP’95, pages 77–101. Springer-Verlag, 1995.

    Google Scholar 

  11. Greg DeFouw, David Grove, and Craig Chambers. Fast interprocedural class analysis. In 25th symposium Principles of Programming Languages, pages 222–236. ACM Press, 1998.

    Google Scholar 

  12. Allyn Dimock, Robert Muller, Franklyn Turbak, and J. B. Wells. Strongly typed flow-directed representation transformations. In International Conference on Functional Programming 1997, pages 11–24. ACM Press, 1997.

    Google Scholar 

  13. Amer Diwan, Kathryn S. McKinley, and J. Eliot B. Moss. Type-based alias analysis. In Programming Language Design and Implementation 1998, pages 106–117. ACM Press, 1998.

    Google Scholar 

  14. Jonathan Eifrig, Scott Smith, and Valery Trifonov. Type inference for recursively constrained types and its application to OOP. In Mathematical Foundations of Programming Semantics, volume 1 of Electronic Notes in Theoretical Computer Science. Elsevier, 1995.

    Google Scholar 

  15. Mary F. Fernández. Simple and effective link-time optimization of Modula-3 programs. In Programming Language Design and Implementation 1995, pages 103–115. ACM Press, 1995.

    Google Scholar 

  16. Robert Harper and Greg Morriset. Compiling polymorphism using intensional type analysis. In 22nd symposium Principles of Programming Languages ACM Press, 1995.

    Google Scholar 

  17. Nevin Heintze. Set-based analysis of ML programs. In Lisp and Functional Programming ’94, pages 306–317. ACM Press, 1994.

    Google Scholar 

  18. Fritz Henglein. Global tagging optimization by type inference. In Lisp and Functional Programming 1992. ACM Press, 1992.

    Google Scholar 

  19. Suresh Jagannathan and Andrew Wright. Polymorphic splitting: An effective polyvariant flow analysis. ACM Transactions on Programming Languages and Systems, 20(1): 166–207, 1998.

    Article  Google Scholar 

  20. Pierre Jouvelot and David K. Gifford. Algebraic reconstruction of types and effects. In 18th symposium Principles of Programming Languages, pages 303–310. ACM Press, 1991.

    Google Scholar 

  21. Xavier Leroy. Unboxed objects and polymorphic typing. In 19th symposium Principles of Programming Languages, pages 177–188. ACM Press, 1992.

    Google Scholar 

  22. Xavier Leroy. The effectiveness of type-based unboxing. In Workshop Types in Compilation ’97. Technical report BCCS-97-03, Boston College, Computer Science Department, June 1997.

    Google Scholar 

  23. John M. Lucassen and David K. Gifford. Polymorphic effect systems. In 15th symposium Principles of Programming Languages, pages 47–57. ACM Press, 1988.

    Google Scholar 

  24. Yasuhiko Minamide, Greg Morrisett, and Robert Harper. Typed closure conversion. In 23rd symposium Principles of Programming Languages, pages 271–283. ACM Press, 1996.

    Google Scholar 

  25. John C. Mitchell. Coercion and type inference. In 11th symposium Principles of Programming Languages, pages 175–185. ACM Press, 1984.

    Google Scholar 

  26. George C. Necula. Proof-carrying code. In 24th symposium Principles of Programming Languages, pages 106–119. ACM Press, 1997.

    Google Scholar 

  27. Atsushi Ohori. A polymorphic record calculus. ACM Transactions on Programming Languages and Systems, 17(6): 844–895, 1995.

    Article  Google Scholar 

  28. Atsushi Ohori and Tomonobu Takamizawa. An unboxed operational semantics for ML polymorphism. Lisp and Symbolic Computation, 10(1): 61–91, 1997.

    Article  Google Scholar 

  29. Jens Palsberg and Patrick O’Keefe. A type system equivalent to flow analysis. In 22nd symposium Principles of Programming Languages, pages 367–378. ACM Press, 1995.

    Google Scholar 

  30. Simon L. Peyton-Jones. Compiling Haskell by program transformation: a report from the trenches. In European Symposium on Programming 1996, volume 1058 of Lecture Notes in Computer Science. Springer-Verlag, 1996.

    Google Scholar 

  31. Simon L. Peyton-Jones and John Launchbury. Unboxed values as first-class citizens in a non-strict functional language. In Functional Programming Languages and Computer Architecture 1991, volume 523 of Lecture Notes in Computer Science, pages 636–666, 1991.

    Google Scholar 

  32. John Plevyak and Andrew Chien. Precise concrete type inference for objectoriented languages. In Object-Oriented Programming Systems, Languages and Applications ’94, pages 324–340. ACM Press, 1994.

    Google Scholar 

  33. Zhong Shao. Flexible representation analysis. In International Conference on Functional Programming 1997, pages 85–98. ACM Press, 1997.

    Google Scholar 

  34. Zhong Shao and Andrew Appel. A type-based compiler for Standard ML. In Programming Language Design and Implementation 1995, pages 116–129. ACM Press, 1995.

    Google Scholar 

  35. Olin Shivers. Control-flow analysis in Scheme. In Programming Language Design and Implementation 1988, pages 164–174. ACM Press, 1988.

    Google Scholar 

  36. Olin Shivers. Control-Flow Analysis of Higher-Order Languages. PhD thesis, Carnegie Mellon University, May 1991.

    Google Scholar 

  37. Bjarne Steensgaard. Points-to analysis in almost linear time. In 23rd symposium Principles of Programming Languages, pages 32–41. ACM Press, 1996.

    Google Scholar 

  38. Jean-Pierre Talpin and Pierre Jouvelot. The type and effect discipline. Information and Computation, 111(2): 245–296, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  39. D. Tarditi, G. Morrisett, P. Cheng, C. Stone, R. Harper, and P. Lee. TIL: a type-directed optimizing compiler for ML. In Programming Language Design and Implementation 1996, pages 181–192. ACM Press, 1996.

    Google Scholar 

  40. Mads Tofte and Jean-Pierre Talpin. Region-based memory management. Information and Computation, 132(2): 109–176, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  41. Philip Wadler and Stephen Blott. How to make ad-hoc polymorphism less adhoc. In 16th symposium Principles of Programming Languages, pages 60–76. ACM Press, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Domaine de Voluceau, INRIA Rocquencourt, 78153, Le Chesnay, France

    Xavier Leroy

Authors
  1. Xavier Leroy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Xavier Leroy Atsushi Ohori

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Leroy, X. (1998). Introduction. In: Leroy, X., Ohori, A. (eds) Types in Compilation. TIC 1998. Lecture Notes in Computer Science, vol 1473. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055509

Download citation

  • DOI: https://doi.org/10.1007/BFb0055509

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64925-0

  • Online ISBN: 978-3-540-68308-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation