PERs Generalise Projections for Strictness Analysis (Extended Abstract)

  • Sebastian Hunt
Conference paper
Part of the Workshops in Computing book series (WORKSHOPS COMP.)

Abstract

We show how Wadler and Hughes’s use of Scott projections to describe properties of functions (“Projections for Strictness Analysis”, FPCA 1987) can be generalised by the use of partial equivalence relations. We describe an analysis (in the form of an abstract interpretation) for identifying such properties for functions defined in the simply typed λ-calculus. Our analysis has a very simple proof of correctness, based on the use of logical relations. We go on to consider how to derive ‘best’ correct interpretations for constants.

Keywords

Logical Relation High Type Abstract Interpretation Standard Interpretation Left Adjoint 
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.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Abr90]
    S. Abramsky. Abstract interpretation, logical relations and Kan extensions. Journal of Logic and Computation, 1 (1): 5–39, 1990.MathSciNetMATHCrossRefGoogle Scholar
  2. [AP90]
    M. Abadi and G. Plotkin. A per model of polymorphism and recursive types. In Logic in Computer Science. IEEE, 1990.Google Scholar
  3. Asp90] A. G. Asperti. Categorical Topics in Computer Science. PhD thesis, Università di Pisa, 199Œ.Google Scholar
  4. [BHA86]
    G.L. Burn, C.L. Hankin, and S. Abramsky. Strictness analysis of higher-order functions. Science of Computer Programming, 7: 249–278, November 1986.MathSciNetMATHGoogle Scholar
  5. [Bur87]
    G.L. Burn. Abstract Interpretation and the Parallel Evaluation of Functional Languages. PhD thesis, Department of Computing, Imperial College of Science and Technology, University of London, 1987.Google Scholar
  6. [Hug87]
    R. J. M. Hughes. Backwards analysis of functional programs. DoC Research Report CSC/87/R3, University of Glasgow, March 1987.Google Scholar
  7. [Lan71]
    Saunders Mac Lane. Categories for the Working Mathematician. Springer-Verlag, Berlin, 1971.MATHGoogle Scholar
  8. [Myc81]
    A. Mycroft. Abstract Interpretation and Optimising Transformations for Applicative Programs. PhD thesis, University of Edinburgh., 1981.Google Scholar
  9. [WH87]
    Philip Wadler and R.J.M. Hughes. Projections for strictness analysis. In LNCS 27g. Functional Programming Languages and Computer Architectures, Oregon, USA, 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Sebastian Hunt
    • 1
  1. 1.Department Of ComputingImperial CollegeLondonUK

Personalised recommendations