Abstract
Hunt showed that the notion of PER-based strictness properties subsumed the incomparable notions of ideal- and projection-based properties on non-lifted value spaces. We extend Hunt's idea so it can encompass other comportment properties (such as totality) by separating the information and fixpoint orderings. We then define a class of uniform PERs (in the sense that they treat non-bottom ground elements, e.g. integers, identically) and then show how these can be hereditarily defined on function spaces. These (or subsets thereof) can be taken as a space of abstract values for abstract interpretation in the style of Nielson.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Nick Benton. Strictness Analysis of Functional Programs. PhD thesis, University of Cambridge, 1993. Available as Computer Laboratory Technical Report No. 309.
Geoffrey L. Burn, Chris Hankin and Samson Abramsky. Strictness analysis for higher-order functions. Science of Computer Programming, 7:249–278, 1986.
Patrick Cousot and Radhia Cousot. Galois connections based abstract interpretation for strictness analysis. In D. Bjørner, M. Broy and I. V. Pottosin, editors, Proceedings of the International Conference on Formal Methods in Programming and their Applications, LNCS 735, pages 98–127, 1993. [Currently available via http://www.ens.fr/"cousot/]
Patrick Cousot and Radhia Cousot. Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and PER analysis of functional languages), invited paper. In Proceedings of the 1994 International Conference on Computer Languages, ICCL'94, pages 95–112, IEEE Computer Society Press, 1994. [Currently available via http://www.ens.fr/-cousot/]
Christine Ernoult and Alan Mycroft. Uniform ideals and strictness analysis. In ICALP 91, LNCS 510, 1991. [Currently available via http: //www.cl. cam.ac.uk/users/am]
Sebastian Hunt. Abstract Interpretation of Functional Languages: From Theory to Practice. PhD thesis, Imperial College, London, 1991.
Thomas P. Jensen. Abstract Interpretation in Logical Form. PhD thesis, Imperial College, London, 1992.
Alan Mycroft. Abstract Interpretation and Optimising Transformation for Applicative programs. PhD thesis, University of Edinburgh, 1981.
Flemming Nielson. Two-level semantics and abstract interpretation. Theoretical Computer Science, 69:117–242, 1989.
Kirsten Lackner Solberg, Hanne Rüs Nielson and Flemming Nielson. Strictness and totality analysis. In Proceedings of Static Analysis Symposium, LNCS 864, 1994.
Kirsten Lackner Solberg. Annotated Type Systems for Program Analysis. PhD thesis, Odense University, to appear.
Philip Wadler and John Hughes. Projections for strictness analysis. In Proceedings of Functional Programming Languages and Computer Architectures '87, LNCS 274, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mycroft, A., Solberg, K.L. (1995). Uniform PERs and comportment analysis. In: Hermenegildo, M., Swierstra, S.D. (eds) Programming Languages: Implementations, Logics and Programs. PLILP 1995. Lecture Notes in Computer Science, vol 982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026820
Download citation
DOI: https://doi.org/10.1007/BFb0026820
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60359-7
Online ISBN: 978-3-540-45048-1
eBook Packages: Springer Book Archive