A syntactic approach to fixed point computation on finite domains

Authors:
Tyng-Ruey Chuang;Benjamin Goldberg
Affiliations:
-;-
Venue:
LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Year:
1992

Citing 5
Cited 2

Strictness analysis—a practical approach

Proc. of a conference on Functional programming languages and computer architecture
Finding fixed points in finite lattices

Proc. of a conference on Functional programming languages and computer architecture
Proofs and types

Proofs and types
Frontiers and open sets in abstract interpretation

FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Strictness analysis in logical form

Proceedings of the 5th ACM conference on Functional programming languages and computer architecture

Deriving algorithms from type inference systems: application to strictness analysis

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Set constraints for destructive array update optimization

Journal of Functional Programming

Quantified Score

Hi-index	0.00

Visualization

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.