skip to main content
10.1145/141471.141517acmconferencesArticle/Chapter ViewAbstractPublication PageslfpConference Proceedingsconference-collections
Article
Free Access

A syntactic approach to fixed point computation on finite domains

Published:01 January 1992Publication History

ABSTRACT

We propose a syntactic approach to performing fixed point computation on finite domains. Finding fixed points in finite domains for monotonic fuctions is an essential task when calculating abstract semantics of functional programs. Previous methods for fixed point finding have been mainly based on semantic approaches which may be very inefficient even for simple programs.

We outline the development of a syntactic approach, and show that the syntactic approach is sound and complete with respect to semantics. A few examples are provided to illustrate this syntactic approach.

References

  1. 1.Samson Abramsky. Domain theory in logical form. Annals of Pure and Applied Logic, 51(1-2):1-77, March 1991.Google ScholarGoogle ScholarCross RefCross Ref
  2. 2.Hendrik Pieter Barendregt. The Lambda Calculus: Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. North-Holland, revised edition, 1984.Google ScholarGoogle Scholar
  3. 3.Chris Clack and Simon L. Peyton Jones. Strictness analysis a practical approach. In Jean-Pierre Jouannaud, editor, Functional Programming Languages and Computer Architecture, pages 35-49. Nancy, France, September 1985. Lecture Notes in Computer Science, Volume 201, Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.Jean-Yves Girard, Paul Taylor, and Yves Lafont. Proofs and Types, volume 7 of Cambridge Tracts in Theorectical Computer Science. Cambridge University Press, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.Sebastian Hunt. Frontiers and open sets in abstract interpretation. In Functional Programming Languages and Computer Architecture, pages 1-11. Imperial CoL lege, London, U.K., September 1989. A.C.M./Addison- Wesley. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.Sebastian Hunt and Chris Hankin. Fixed points and frontiers: a new perspective. Journal of Functional Programming, 1(1):91-120, January 1991.Google ScholarGoogle ScholarCross RefCross Ref
  7. 7.Thomas P. Jensen. Abstract interpretation vs. type inference: A topological perspective. In Simon L. Peyton Jones, Graham Hntton, and Caresten Kehler Hoist, editors, Functional Programming, Glasgow 1990: Proceedings of the 1990 Glasgow Workshop, pages 141-145. U1- lapool, Scotland, U.K., August 1990. Springer-Verlag.Google ScholarGoogle Scholar
  8. 8.Thomas P. Jensen. Strictness analysis in logical form. In John Hughes, editor, Functional Programming Languages and Computer Architecture, pages 352-366. Cambridge, Massachusetts, U.S.A., August 1991. Lecture Notes in Computer Science, Volume 523, Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9.Chris Martin and Chris Hankin. Finding fixed points in finite lattices. In Gilles Kahn, editor, Functional Programming Languages and Computer Architecture, pages 426-445. Portland, Oregon, U.S.A., September 1987. Lecture Notes in Computer Science, Volume 274, Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10.Simon L. Peyton Jones and Chris Clack. Finding fixpoints in abstract interpretation. In Samson Abramsky and Chris Hankin, editors, Abstract Interpretation of Declarative Languages, chapter 11, pages 246-265. Ellis Horwood, 1987.Google ScholarGoogle Scholar
  11. 11.G. D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223-255, 1977.Google ScholarGoogle ScholarCross RefCross Ref
  12. 12.Jonathan Hood Young. The Theory and Practice of Semantic Program Analysis for Higher-Order Functional Programming Languages. PhD thesis, Dep~rtment of Computer Science, Yale University, May 1989.Google ScholarGoogle Scholar

Index Terms

  1. A syntactic approach to fixed point computation on finite domains

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in
            • Published in

              cover image ACM Conferences
              LFP '92: Proceedings of the 1992 ACM conference on LISP and functional programming
              January 1992
              365 pages
              ISBN:0897914813
              DOI:10.1145/141471

              Copyright © 1992 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 1 January 1992

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • Article

              Acceptance Rates

              Overall Acceptance Rate30of109submissions,28%

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader