Projections for strictness analysis

Philip Wadler, R.J.M. Hughes

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

Abstract / Description of output

Contexts have been proposed as a means of performing strictness analysis on non-flat domains. Roughly speaking, a context describes how much a sub-expression will be evaluated by the surrounding program. This paper shows how contexts can be represented using the notion of projection from domain theory. This is clearer than the previous explanation of contexts in terms of continuations. In addition, this paper describes finite domains of contexts over the non-flat list domain. This means that recursive context equations can be solved using standard fixpoint techniques, instead of the algebraic manipulation previously used.
Original languageEnglish
Title of host publicationFunctional Programming Languages and Computer Architecture
Subtitle of host publicationPortland, Oregon, USA, September 14–16, 1987 Proceedings
EditorsGilles Kahn
PublisherSpringer-Verlag GmbH
Pages385-407
Number of pages23
ISBN (Electronic)978-3-540-47879-9
ISBN (Print)978-3-540-18317-4
DOIs
Publication statusPublished - 1987

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin / Heidelberg
Volume274
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'Projections for strictness analysis'. Together they form a unique fingerprint.

Cite this