Advertisement

Inverse image analysis

  • Peter Dybjer
Inductive Inference, Logic And Functional Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 267)

Abstract

A method for analysing the inverse of a first-order functional program is proposed. This method is based on denotational semantics: we analyse the inverse image of a Scott open set under the continuous function which the program denotes. Inverse image analysis is one possible way of extending strictness analysis to languages with lazy data structures and could perhaps be used to optimise code in implementations of such languages.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    S. Abramsky. Domain theory in logical form. In Proceedings of the 1987 Logic in Computer Science Conference, June 1987. To appear.Google Scholar
  2. [2]
    S. Abramsky. Strictness analysis and polymorphic invariance. In N. Jones, editor, Programs as Data Objects, pages 1–23, Springer-Verlag, LNCS 217, October 1985.Google Scholar
  3. [3]
    G. L. Burn, C. L. Hankin, and S. Abramsky. The theory of strictness analysis for higher-order functions. In N. Jones, editor, Programs as Data Objects, pages 42–62, Springer-Verlag, LNCS 217, October 1985.Google Scholar
  4. [4]
    C. Clack and S. Peyton Jones. Generating parallelism from strictness analysis. In L. Augustsson, J. Hughes, T. Johnsson, and K. Karlsson, editors, Proceedings of the Workshop on Implementation of Functional Languages, pages 132–150, Report 17, Programming Methodology Group, Chalmers University of Technology and University of Göteborg, February 1985.Google Scholar
  5. [5]
    J. Fairbairn. Removing redundant laziness from super-combinators. In Augustsson, Hughes, Johnsson, and Karlsson, editors, Proceedings of the Workshop on Implementation of Functional Languages, Report 17, Programming Methodology Group, Chalmers University of Technology and University of Göteborg, February 1985.Google Scholar
  6. [6]
    P. Harrison and H. Khoshnevisan. On the synthesis of function inverses. October 1986. Draft paper, Department of Computing, Imperial College, London.Google Scholar
  7. [7]
    J. Hughes. Analysing strictness by abstract interpretation of continuations. In S. Abramsky and C. Hankin, editors, Abstract Interpretation of Declarative Languages, Ellis Horwood, 1987.Google Scholar
  8. [8]
    J. Hughes. Strictness detection in non-flat domains. In N. Jones, editor, Programs as Data Objects, pages 112–135, Springer-Verlag, LNCS 217, October 1985.Google Scholar
  9. [9]
    K. Karlsson. Access and demand analysis of functional programs. Notes from a talk given at the Workshop on Abstract Interpretation, Canterbury, August, 1985.Google Scholar
  10. [10]
    P. Martin-Löf. The domain interpretation of type theory, lecture notes. In K. Karlsson and K. Petersson, editors, Workshop on Semantics of Programming Languages, Abstracts and Notes, Programming Methodology Group, Chalmers University of Technology and University of Göteborg, August 1983.Google Scholar
  11. [11]
    A. Mycroft. Abstract Interpretation and Optimising Transformations for Applicative Programs. PhD thesis, University of Edinburgh, 1981.Google Scholar
  12. [12]
    G. Plotkin. Dijkstra's predicate transformers and Smyth's powerdomains. In D. Bjørner, editor, Abstract Software Specifications, Springer-Verlag, LNCS 86, 1980.Google Scholar
  13. [13]
    D. Scott. Domains for denotational semantics. In Automata, Languages and Programming, 9th Colloquium, pages 577–613, Springer-Verlag, LNCS 140, July 1982.Google Scholar
  14. [14]
    D. Scott. Lectures on a Mathematical Theory of Computation. Technical Report PRG-19, Oxford University Programming Research Group, May 1981.Google Scholar
  15. [15]
    M. B. Smyth. Power domains and predicate transformers: a topological view. In J.Diaz, editor, Automata, Languages and Programming, 10th Colloquium, pages 662–675, Springer-Verlag, LNCS 154, July 1983.Google Scholar
  16. [16]
    P. Wadler and J. Hughes. Contexts made simple. February 1987. Draft paper.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Peter Dybjer
    • 1
  1. 1.Programming Methodology Group, Department of Computer SciencesChalmers University of Technology and University of GöteborgGöteborgSweden

Personalised recommendations