Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

SAS

2001

Springer

2001

Springer

Abstract. Logic languages based on the theory of rational, possibly inﬁnite, trees have much appeal in that rational trees allow for faster uniﬁcation (due to the omission of the occurs-check) and increased expressivity. Note that cyclic terms can provide a very eﬃcient representation of grammars and other useful objects. Unfortunately, the use of inﬁnite rational trees has problems. For instance, many of the built-in and library predicates are ill-deﬁned for such trees and need to be supplemented by run-time checks whose cost may be signiﬁcant. Moreover, some widelyused program analysis and manipulation techniques are only correct for those parts of programs working over ﬁnite trees. It is thus important to obtain, automatically, a knowledge of those program variables (the ﬁnite variables) that, at the program points of interest, will always be bound to ﬁnite terms. For these reasons, we propose here a new data-ﬂow analysis that captures such information. We presen...

Related Content

Added |
30 Jul 2010 |

Updated |
30 Jul 2010 |

Type |
Conference |

Year |
2001 |

Where |
SAS |

Authors |
Roberto Bagnara, Roberta Gori, Patricia M. Hill, Enea Zaffanella |

Comments (0)