Backwards Strictness Analysis: Proved and Improved

Kei Davis, Philip Wadler

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Given a syntax tree representing an expression, and some information regarding that expression, a backwards analysis will involve propagating the information (with appropriate transformation) towards the leaves of the tree, to yield information about the subexpressions. Here, the information at the root will describe the required definedness of the value of the expression, with the results of the analysis describing the definedness of the values lower in the tree sufficient or necessary to meet the condition at the root. In Projections for Strictness Analysis [1], such an analysis is described in which the information at each node is encoded by a special kind of function called a projection, with the results of the analysis revealing strictness information about the expression. This paper describes a more general and powerful technique, and provides proofs that both techniques meet a corresponding generalisation of the safety condition described in [1].
Original languageEnglish
Title of host publicationFunctional Programming
Subtitle of host publicationProceedings of the 1989 Glasgow Workshop 21–23 August 1989, Fraserburgh, Scotland
PublisherSpringer-Verlag GmbH
Pages12-30
Number of pages19
ISBN (Electronic)978-1-4471-3166-3
ISBN (Print)978-3-540-19609-9
DOIs
Publication statusPublished - 1989

Publication series

NameWorkshops in Computing
PublisherSpringer London
ISSN (Print)1431-1682

Cite this