Path: utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!uunet!mcsun!ukc!keele!nott-cs!ucl-cs!news
From: S.Courtenage@cs.ucl.ac.uk (Si Courtenage)
Newsgroups: comp.lang.functional
Subject: Re: Need reference on fixed-point computaion
Message-ID: <1426@ucl-cs.uucp>
Date: 7 Feb 91 13:54:34 GMT
Sender: news@cs.ucl.ac.uk
Lines: 42


>Fixed point computation is used frequently in solving data flow equations
>and abstract interpretations. I would appreciate if someone could give
>me any references on this subject, especially from mathematical viewpoints
>and implementations.

The references I`ve read on this usbject so far are:

    S.Peyton Jones and Chris Clack
      "Finding fixed points in abstract interpretation"
        in: Abstract Interpretation of Declarative Languages"
           ed. S.Abramsky and C.Hankin (pub. Ellis Horwood, 1987)

    - a good reference for practical ways of finding fixed-points

    J.Stoy
      "Denotational Semantics: the Scott-Strachey Approach to
       Programming Language Theory"
         pub. MIT Press, 1977
    - see pages 71-73 - may be difficult to get hold off and is a
      bit brief on the subject

     A.J.Field and P.G.Harrison
      "Functional Programming"
         pub.Addison Wesley, 1988
    - see Appendix B on Basic Domain Theory

    D.Scott
      "Lectures on a Mathematical Approach to Computation"
         pub. Oxford Programming Group (Ox. Univ) ???

    - thorough approach to domains and therefore fixed-points
      from a very mathematical point of view - BUT no idea how
      you might get hold of a copy - I borrowed mine from my
      supervisor.

Hope that this helps!!! I would be interested if anyone else
knows of any other references!

Si

"Man is born to trouble as the sparks fly upwards."