A technique for solving a class of quadratic FP equations

0Citations
Citations of this article
N/AReaders
Mendeley users who have this article in their library.

Abstract

Among all the available approaches for reasoning about recursive functional programs, Backus' expansion methodology can often provide more insight about the semantics of the original program. Expansions to the linear recursive programs and certain classes of nonlinear ones have been obtained earlier by different researchers. In this paper we obtain simple expansions to a class of quadratic FP equations defined as f{hook}=p→q;g°f{hook}2°h. The present expansion technique is different from those in the available literature, and it widens the domain of the applicability of the FP functional algebra. © 1992.

Cite

CITATION STYLE

APA

Banerjee, D. (1992). A technique for solving a class of quadratic FP equations. Science of Computer Programming, 19(1), 61–85. https://doi.org/10.1016/0167-6423(92)90004-U

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free