Strictness analysis and polymorphic invariance

Extended abstract
  • Samson Abramsky
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 217)


Operational Semantic Type Scheme Type Expression Abstract Domain Denotational Semantic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Bar]
    Barendregt, H. The Lambda Calculus: Syntax and Semantics 2nd. ed., North Holland, Amsterdam, 1984.Google Scholar
  2. [BHA]
    Burn, G. Hankin, C. and Abramsky, S. "Strictness Analysis For Higher Order Functions", to appear in Science Of Computer Programming, also Imperial College Department Of Computing Research Report DOC 85/6, 1985.Google Scholar
  3. [CPJ]
    Clack, C. and Peyton Jones, S. "Generating Parallelism from Strictness Analysis", to appear in Proc. IFIP International Conference On Functional Languages and Computer Architectures, Springer LNCS, 1985.Google Scholar
  4. [DM]
    Damas, L. and Milner, R. "Principal Type Schemes for Functional Programs", in Proc. 9th ACM Symposium On Principles Of Programming Languages, 1982.Google Scholar
  5. [HA]
    Hennessy, M. C. B. and Ashcroft, E. A. "A Mathematical Semantics For A Nondeterministic Typed λ-Calculus", Theoretical Computer Science 11 (1980) pp. 227–245, 1980.Google Scholar
  6. [Lan]
    Landin, P.J. "The Next 700 Programming Languages", in Communications of the ACM, 9, pp. 157–166, 1966.Google Scholar
  7. [ML]
    Martin-Löf, P. Intuitionistic Type Theory, Bibliopolis, Naples, 1984.Google Scholar
  8. [Mil]
    Milner, R. "A Theory Of Type Polymorphism In Programming", Journal Of Computer And Systems Sciences, 17,3 pp. 348–375, 1978.Google Scholar
  9. [Myc]
    Mycroft, A. Abstract Interpretation And Optimising Transformations For Applicative Programs, Ph.D. Thesis, Edinburgh University, 1981.Google Scholar
  10. [Plo]
    Plotkin, G. "LCF Considered As A Programming Language", Theoretical Computer Science 5, pp. 223–255, 1977.Google Scholar
  11. [Rob]
    Robinson, J. A. "A Machine-Oriented logic based on the resolution principle", Journal of the ACM 12,1 pp. 23–41, 1965.Google Scholar
  12. [Sto]
    Stoy, J. Denotational Semantics: The Scott-Strachey Approach To Programming Language Theory, MIT Press, Cambridge Mass. 1977.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Samson Abramsky
    • 1
  1. 1.Imperial College of Science and TechnologyLondon

Personalised recommendations