Constructing Fixed-Point Combinators Using Application Survival

Mayer Goldberg

June 1995


The theory of application survival was developed in our Ph.D. thesis as an approach for reasoning about application in general and self-application in particular. In this paper, we show how application survival provides a uniform framework not only for for reasoning about fixed-points, fixed-point combinators, but also for deriving and comparing known and new fixed-point combinators.

Available as PostScript, PDF, DVI.


Last modified: 2003-06-08 by webmaster.