A note on “On the conversion of indirect to direct recursion”

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A note on “On the conversion of indirect to direct recursion”

Full text

Pdf (93 KB)

Source

ACM Transactions on Programming Languages and Systems (TOPLAS) archive
Volume 19 , Issue 6 (November 1997) table of contents

Pages: 1085 - 1087

Year of Publication: 1997

ISSN:0164-0925

Authors

Ting Yu	Peking University, Beijing, China
Owen Kaser	Univ. of New Brunswick, Saint John

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 30, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/267959.269973 What is a DOI?

ABSTRACT

In the article “On the Conversion of Indirect to Direct Recursion”(ACM Lett. Program. Lang. 2, 1-4. pp. 151-164), a method was introduced to convert indirect to direct recursion. It was claimed that for any call graph, there is a mutual-recursion elimination sequence if and only if no strongly connected component contains two node-disjoint circuits. We first give a counterexample and then provide a correction.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.