@Inproceedings{Gly-Son:ACSC99,
author = {Kevin Glynn and Harald S{\o}ndergaard},
title = {Immediate Fixpoints for Strictness Analysis},
editor = {J. Edwards},
booktitle= {Proc.\ Twenty-Second Australasian Computer Science Conf.},
series = {Australian Computer Science Communications},
volume = {21},
number = {1},
year = {1999},
pages = {336--347},
publisher= {Springer},
abstract = {This paper is concerned with the problem of finding fixpoints
without resorting to Kleene iteration.
In many cases, a simple syntactic test suffices to establish
that a closed form can be found without iteration.
For example, if the function $F$, whose fixpoint we want to
determine, is idempotent, then its least fixpoint is simply
the instantiation $F(0)$, where $0$ is the least element of
the lattice.
In many cases, idempotence can be gleaned easily from $F$'s
definition.
In other cases, simple symbolic manipulation of a recursive
definition may reveal shortcuts to a closed form.
We explore such cases and show how the faster fixpoint
calculation can have applications in strictness analysis.
}
}