Abstract
Expansion theorems are obtained for classes of non-linear functions. From these, properties of some complex recursive functions are derived by finding equivalent non-recursive definitions, and a combinator-based formulation facilitates a simpler analysis than is typical of the applicative calculus approach.
Similar content being viewed by others
References
[Ba 78] Backus, J.W.: Can programming be liberate from the von Neumann style? A functional style and its algebra of programs. CACM 21(8), 613–641 (1978)
[Ba 81] Backus, J.W.: The algebra of functional programs: Function level reasoning, linear equations and extended definitions. (Lect. Notes Comput. Sci., vol 107, pp. 1–43) Berlin, Heidelberg, New York: Springer 1981
[BM 87] Bird, R.S., Meertens, L.G.L.T.: Two exercises found in a book on Algorithmics. In: Meertens L.G.L.T. (ed) Program specification and transformation, pp. 451–457. Amsterdam: North-Holland 1987
[Cu 86] Curien, P.-L.: Categorical combinators, sequential algorithms and functional programming: San Francisco: Pitman 1986
[FH 88] Field, A.J., Harrison, P.G.: Functional programming. Reading, MA: Addison-Wesley 1988
[Ha 88] Harrison, P.G.: Linearisation: an optimisation for non-linear functional programs. Sci. Comput. Programm. 10: 281–318 (1988)
Harrison, P.G., Khoshnevisan, H.: A new approach to recursion removal. Theoret. Comput. Sci. (to appear 1992)
STOP Summer School on Construcitve Algorithmics. Ameland, Holland, September, 1989
[Wa 80] Continuation-based program transformation strategies. JACM27, 1 (1980)
[Wi 82] Williams, J.H.: On the development of the algebra of functional programs. ACM Trans. Programm. Lang. Syst.4, 733–757 (1982)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Harrison, P.G. On the expansion of non-linear functions. Acta Informatica 28, 559–574 (1991). https://doi.org/10.1007/BF01463945
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01463945