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.
- 1.Samson Abramsky. Domain theory in logical form. Annals of Pure and Applied Logic, 51(1-2):1-77, March 1991.Google ScholarCross Ref
- 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 Scholar
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 6.Sebastian Hunt and Chris Hankin. Fixed points and frontiers: a new perspective. Journal of Functional Programming, 1(1):91-120, January 1991.Google ScholarCross Ref
- 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 Scholar
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 Scholar
- 11.G. D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223-255, 1977.Google ScholarCross Ref
- 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 Scholar
Index Terms
A syntactic approach to fixed point computation on finite domains
Recommendations
A syntactic approach to fixed point computation on finite domains
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 ...
Mizoguchi-Takahashi's type fixed point theorem
Recently, Eldred [A.A. Eldred, J. Anuradha, P. Veeramani, On equivalence of generalized multi-valued contactions and Nadler's fixed point theorem, J. Math. Anal. Appl. (2007) doi:10.1016/j.jmaa.2007.01.087] claimed that Nadler's [S.B. Nadler Jr., ...
A fixed-point approach to stable matchings and some applications
We describe a fixed-point based approach to the theory of bipartite stable matchings. By this, we provide a common framework that links together seemingly distant results, like the stable marriage theorem of Gale and Shapley, the Mendelsohn-Dulmage ...
Comments