A usage analysis with bounded usage polymorphism and subtyping

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2011, Issue , 2001, Pages 140-157

  Gustavsson, Jörgen ^a   Svenningsson, Josef ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES;

CONSTRAINT SET; KEY FEATURE; LARGE PROGRAMS; SCALE-UP; SUBTYPINGS; TYPE SYSTEMS; TYPE-BASED ANALYSIS; USAGE ANALYSIS;

POLYMORPHISM;

EID: 84944062489     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45361-x_9     Document Type: Conference Paper

References (27)

1. U. Boquist and T. Johnsson. The grin project: A highly optimising back end for lazy functional languages. In Proc. of IFL’96, Bad Godesberg, Germany. Springer Verlag LNCS 1268, 1996.
2. E. Barendsen and S. Smetsers. Uniqueness Typing for Functional Languages with Graph Rewriting Semantics. Mathematical Structures in Computer Science, 6:579–612, 1996.
3. D. Dussart, F. Henglein, and C. Mossin. Polymorphic recursion and subtype qualifications: Polymorphic binding-time analysis in polynomial time. In proceedings of 2nd Static Analysis Symposium, September 1995.
4. Karl-Filip Faxèn. Optimizing lazy functional programs using flow inference. In Proc. of SAS’95, pages 136–153. Springer-Verlag, LNCS 983, September 1995.
5. Karl-Filip Faxèn. Analysing, Transforming and Compiling Lazy Functional Programs. PhD thesis, Royal Institute of Technology, Sweden, June 1997.
6. J. Fairbairn and S. Wray. TIM: A Simple, Lazy Abstract Machine to Execute Supercombinators. In Proc. of FPCA’87, pages 34–45. Springer Verlag LNCS 274, September 1987. Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1–102, 1987.
7. J. Gustavsson and D. Sands. A foundation for space-safe transformations of call-by-need programs. In Proc. of HOOTS’99, volume 26 of ENTCS. Elsevier, 1999.
8. J. Gustavsson and J. Svenningsson. Constraint abstractions. In Proc. of Second Symposium on Programs as Data Objects, LNCS. Springer Verlag, 2001. To Appear
9. J. Gustavsson. A Type Based Sharing Analysis for Update Avoidance and Optimisation. In Proc. of ICFP’98, pages 39–50, Baltimore, Maryland, September 1998.
10. J. Gustavsson. A Type Based Sharing Analysis for Update Avoidance and Optimisation. Licentiate thesis, May 1999.
11. J. Launchbury. A Natural Semantics for Lazy Evaluation. In Proc. of POPL’93, Charleston, N. Carolina, 1993.
12. J. Launchbury, A. Gill, J. Hughes, S. Marlow, S. L. Peyton Jones, and P. Wadler. Avoiding Unnecessary Updates. In J. Launchbury and P. M. Sansom, editors, Functional Programming, Workshops in Computing, Glasgow, 1992.
13. S. Marlow. Update Avoidance Analysis by Abstract Interpretation. In Proc. 1993 Glasgow Workshop on Functional Programming, Workshops in Computing. Springer–Verlag, 1993.
14. T. Mogensen. Types for 0, 1 or many uses. In Proc. of IFL’97, pages 112–122. Springer-Verlag, LNCS 1467, September 1997.
15. C. Mossin. Flow Analysis of Typed Higher-Order Programs (Revised Version). PhD thesis, University of Copenhagen, Denmark, August 1997.
16. Simon L, Peyton Jones. Implementing lazy functional languages on stock hardware: the spineless tagless g-machine. Journal of Functional Programming, 2(2):127–202, July 1992.
17. S. Peyton Jones, W. Partain, and A. Santos. Let-floating: moving bindings to give faster programs. In Proc. of ICFP’96, pages 1–12. ACM, May 1996.
18. R. Pena and C. Segura. Non-determinism analysis in a parallel-functional language. In Proceedings of the 12th International Workshop of Functional Languages, LNCS, September 2000. Also in this volume.
19. Jakob Rehof and Manuel Fändrich.: Type-Based Flow Analysis: From Polymorphic Subtyping to CFL-Reachability. In Proceedings of 2001 Symposium on Principles of Programming Languages, 2001. To appear.
20. P. Sestoft. Analysis and Efficient Implementation of Functional Programs. PhD thesis, DIKU, University of Copenhagen, Denmark, October 1991.
21. P. Sestoft. Deriving a lazy abstract machine. Journal of Functional Programming, 7(3):231–264, May 1997.
22. Josef Svenningsson. An efficient algorithm for a sharing analysis with polymorphism and subtyping. Masters thesis, June 2000.
23. J.-P. Talpin and P. Jouvelot. The type and effect discipline. Information and Computation, 111(2), 1994.
24. D. N. Turner, P. Wadler, and C. Mossin. Once upon a type. In Proc. of FPCA, La Jolla, 1995.
25. Keith Wansbrough and Simon Peyton Jones.: Once Upon a Polymorphic Type. Technical Report TR-1998-19, Department of Computing Science, University of Glasgow, December 1998.
26. Keith Wansbrough and Simon Peyton Jones. Once Upon a Polymorphic Type. In Proc. of POPL’99, January 1999.
27. Keith Wansbrough and Simon Peyton Jones. Simple Usage Polymorphism. In ACM SIGPLAN Workshop on Types in Compilation, September 2000.