Syntactic approach to fixed point computation on finite domains

Tyng Ruey Chuang, Benjamin Goldberg

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We propose a syntactic approach to performing fixed point computation on finite domains. Finding fixed points in finite domains for monotonic functions 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.

Original languageEnglish (US)
Title of host publicationProc 92 ACM Conf Lisp Funct Program
PublisherPubl by ACM
Pages109-118
Number of pages10
ISBN (Print)0897914813
StatePublished - 1992
EventProceedings of the 1992 ACM Conference on Lisp and Functional Programming - San Francisco, CA, USA
Duration: Jun 22 1992Jun 24 1992

Publication series

NameProc 92 ACM Conf Lisp Funct Program

Other

OtherProceedings of the 1992 ACM Conference on Lisp and Functional Programming
CitySan Francisco, CA, USA
Period6/22/926/24/92

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Syntactic approach to fixed point computation on finite domains'. Together they form a unique fingerprint.

Cite this