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

Other

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

Fingerprint

Syntactics
Semantics
Acoustic waves

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Chuang, T. R., & Goldberg, B. (1992). Syntactic approach to fixed point computation on finite domains. In Proc 92 ACM Conf Lisp Funct Program (pp. 109-118). Publ by ACM.

Syntactic approach to fixed point computation on finite domains. / Chuang, Tyng Ruey; Goldberg, Benjamin.

Proc 92 ACM Conf Lisp Funct Program. Publ by ACM, 1992. p. 109-118.

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

Chuang, TR & Goldberg, B 1992, Syntactic approach to fixed point computation on finite domains. in Proc 92 ACM Conf Lisp Funct Program. Publ by ACM, pp. 109-118, Proceedings of the 1992 ACM Conference on Lisp and Functional Programming, San Francisco, CA, USA, 6/22/92.
Chuang TR, Goldberg B. Syntactic approach to fixed point computation on finite domains. In Proc 92 ACM Conf Lisp Funct Program. Publ by ACM. 1992. p. 109-118
Chuang, Tyng Ruey ; Goldberg, Benjamin. / Syntactic approach to fixed point computation on finite domains. Proc 92 ACM Conf Lisp Funct Program. Publ by ACM, 1992. pp. 109-118
@inproceedings{1cab8bb1c7c84a64b56e71440354ac8d,
title = "Syntactic approach to fixed point computation on finite domains",
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.",
author = "Chuang, {Tyng Ruey} and Benjamin Goldberg",
year = "1992",
language = "English (US)",
isbn = "0897914813",
pages = "109--118",
booktitle = "Proc 92 ACM Conf Lisp Funct Program",
publisher = "Publ by ACM",

}

TY - GEN

T1 - Syntactic approach to fixed point computation on finite domains

AU - Chuang, Tyng Ruey

AU - Goldberg, Benjamin

PY - 1992

Y1 - 1992

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0027003712&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027003712&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0027003712

SN - 0897914813

SP - 109

EP - 118

BT - Proc 92 ACM Conf Lisp Funct Program

PB - Publ by ACM

ER -