A type based sharing analysis for update avoidance and optimisation

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 34, Issue 1, 1999, Pages 39-50

  Gustavsson, Jörgen ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17244377165     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/291251.289427     Document Type: Article

References (19)

1. Z. Ariola, M. Felleisen, J. Maraist, M. Odersky, and P. Wadler. A Call-By-Need Lambda Calculus. In Proceedings 1995 Symposium on Principles of Programming Languages, San Francisco, California, 1995.
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. S. A. Courtenage and C. D. Clack. Analysing resource use in the λ-calculus by type inference. In ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, 1994.
4. Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1-102, 1987.
5. ∼gustavss.
6. S.L. Peyton Jones, C.V. Hall, K. Hammond, W.D. Partain, and P.L. Wadler. The Glasgow Haskell compiler: a technical overview. In Joint Framework for Information Technology (JFIT), Technical Conference Digest, 1993.
7. J. Launchbury. A Natural Semantics for Lazy Evaluation. In Proceedings 1993 Symposium on Principles of Programming Languages, Charleston, N. Carolina, 1993.
8. 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.
9. S. Marlow. Update Avoidance Analysis by Abstract Interpretation. In Proc. 1993 Glasgow Workshop on Functional Programming, Workshops in Computing. Springer-Verlag, 1993.
10. Robin Milner. A Theory of Type Polymorphism in Programming. Journal of Computer and Systems Sciences, 17:348-375, 1978.
11. T. Mogensen. Types for 0, 1 or many uses. In Proceedings of IFL '97: 9th International Workshop on Implementation of Functional Languages, pages 112-122, St. Andrews, Scotland. Springer-Verlag, LNCS 1467.
12. 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.
13. ∼clean/.
14. P. Sestoft. Analysis and Efficient Implementation of Functional Programs. PhD thesis, DIKU, University of Copenhagen, Denmark, October 1991.
15. P. Sestoft. Deriving a lazy abstract machine. Journal of Functional Programming, 7(3):231-264, May 1997.
16. D. N. Turner, P. Wadler, and C. Mossin. Once upon a type. In ACM Conf. on Functional Programming Languages and Computer Architecture, La Jolla, 1995.
17. Philip Wadler. Linear types can change the world! In M. Broy and C. Jones, editors, Programming Concepts and Methods, Sea of Galilee, Israel, April 1990. North Holland.
18. Philip Wadler. Is there a use for linear logic? In ACM Conference on Partial Evaluation and Semantics-Based Program Manipulation, New Haven, Connecticut, June 1991.
19. D. A. Wrigth and C. A. Baker-Finch. Usage analysis with natural reduction types. In Workshop on Semantic Analysis, 1993.