Methodologies for transformations and memoing in applicative languages
Alberto Pettorossi · ERA · 1984
We study some methodologies for applicative language programming and we address the problem of Improving efficiency in recursive equation programs by establishing suitable communications between subcomputations.We first use the program transformation approach and we show that.1. iii 2. 6. 4 Implementation Syntax for memoL 2. 6. 5 Dynamic Semantics for memoL 2.6.6 Pragmatics for memoL 2. 6. 7 On the number of different reduction sequences 2. 7 Annotations denoting communications and communicating agents 2. 7. 1 Annotations denoting communications 2. 7. 2 Communicating Agents 2. 8 Conclusions Appendix A. THE STATIC SEMANTICS FOR RECURSIVE