{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T14:07:39Z","timestamp":1751983659785},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1990,11,1]],"date-time":"1990-11-01T00:00:00Z","timestamp":657417600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1990,11]]},"DOI":"10.1007\/bf02983374","type":"journal-article","created":{"date-parts":[[2008,11,5]],"date-time":"2008-11-05T18:35:20Z","timestamp":1225910120000},"page":"43-81","source":"Crossref","is-referenced-by-count":13,"title":["Efficient memo-table management strategies"],"prefix":"10.1007","volume":"28","author":[{"given":"Hessam","family":"Khoshnevisan","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02983374_CR1","volume-title":"Abstract interpretation of declarative languages","author":"S. Abramsky","year":"1987","unstructured":"[AbHa87] Abramsky, S., Hankin, C.L.: Abstract interpretation of declarative languages. Chichester: Ellis Horwood 1987"},{"key":"BF02983374_CR2","volume-title":"The design and analysis of computer algorithms","author":"A.V. Aho","year":"1974","unstructured":"[AhHoUl174] Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms. Reading, Mass.: Addison-Wesley 1974"},{"issue":"8","key":"BF02983374_CR3","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1145\/359576.359579","volume":"21","author":"J.W. Backus","year":"1978","unstructured":"[Ba78] Backus, J.W.: Can programming be liberated from the von Neumann Style? A functional style and its algebra of programs. CACM21(8), 613\u2013641 (1978)","journal-title":"CACM"},{"key":"BF02983374_CR4","series-title":"Lect. Notes Comput. Sci.","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-10699-5_91","volume-title":"The algebra of functional programs: function level reasoning, linear equations and extended definitions","author":"J.W. Backus","year":"1981","unstructured":"[Ba81] Backus, J.W.: The algebra of functional programs: function level reasoning, linear equations and extended definitions. (Lect. Notes Comput. Sci., vol. 107, pp. 1\u201343) Berlin Heidelberg New York: Springer 1981"},{"key":"BF02983374_CR5","series-title":"Research Report","volume-title":"Efficient implementation of functional programs","author":"R. Bailey","year":"1986","unstructured":"[BaFiKh86] Bailey, R., Field, A.J., Khoshnevisan, H.: Efficient implementation of functional programs. Research Report, Department of Computing, Imperial College, London 1986"},{"key":"BF02983374_CR6","volume-title":"Dynamic programming","author":"R.E. Bellman","year":"1975","unstructured":"[Be 75] Bellman, R.E.: Dynamic programming. Princeton, NJ: Princeton University Press 1975"},{"issue":"11","key":"BF02983374_CR7","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1145\/359863.359889","volume":"20","author":"R.S. Bird","year":"1977","unstructured":"[Bi77] Bird, R.S.: Improving programs by the introduction of recursion. Commun. ACM20(11), 856\u2013863 (1977)","journal-title":"Commun. ACM"},{"issue":"4","key":"BF02983374_CR8","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1145\/356827.356831","volume":"12","author":"R.S. Bird","year":"1980","unstructured":"[Bi80] Bird, R.S.: Tabulation techniques for recursive programs. ACM Comput. Surveys12(4), 403\u2013417 (1980)","journal-title":"ACM Comput. Surveys"},{"key":"BF02983374_CR9","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0167-6423(86)90023-7","volume":"6","author":"R.S. Bird","year":"1986","unstructured":"[Bi86] Bird, R.S.: Transformational programming and the paragraph problem. Sci. Comput. Program.6, 159\u2013189 (1986)","journal-title":"Sci. Comput. Program."},{"key":"BF02983374_CR10","doi-asserted-by":"crossref","unstructured":"[BuDa77] Burstall, R.M., Darlington, J.: A transformation system for developing recursive programs. JACM24, No. 1 (1977)","DOI":"10.1145\/321992.321996"},{"key":"BF02983374_CR11","doi-asserted-by":"crossref","unstructured":"[BuMcSa80] Burstall, R.M., McQueen, D.B., Sannella, D.T.: HOPE: An experimental applicative language. Proceedings 1st International LISP conference, Stanford, pp. 136\u2013143 (1980)","DOI":"10.1145\/800087.802799"},{"key":"BF02983374_CR12","doi-asserted-by":"crossref","unstructured":"[Co79] Cohen, N.H.: Characterisation and elimination of redundancy in recursive programs. 6th Annual ACM Symposium on Principles of Programming Languages. Antonio, Texas, pp. 143\u2013157 (1979)","DOI":"10.1145\/567752.567766"},{"key":"BF02983374_CR13","volume-title":"Source-to-Source improvement of recursive programs","author":"N.H. Cohen","year":"1980","unstructured":"[Co80] Cohen, N.H.: Source-to-Source improvement of recursive programs. Ph.D. thesis, Division of Applied Sciences, Harvard Univ, Cambridge, Mass. (1980)"},{"key":"BF02983374_CR14","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1145\/2166.2167","volume":"5","author":"N.H. Cohen","year":"1983","unstructured":"[Co83] Cohen, N.H.: Eliminating redundant recursive calls. ACM Trans. Program. Languages Systems5, 265\u2013299 (1983)","journal-title":"ACM Trans. Program. Languages Systems"},{"key":"BF02983374_CR15","first-page":"1","volume":"11","author":"J. Darlington","year":"1979","unstructured":"[Da79] Darlington, J., A synthesis of several sorting algorithms. Acta Inf.11, 1 (1979)","journal-title":"Acta Inf."},{"key":"BF02983374_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00263742","volume":"6","author":"J. Darlington","year":"1976","unstructured":"[DaBu76] Darlington, J., Burstall, R.M.: A system which automatically improves programs. Acta Inf.6, 1 (1976)","journal-title":"Acta Inf."},{"key":"BF02983374_CR17","doi-asserted-by":"crossref","unstructured":"[GiKi84] Givler, J.S., Kieburtz, R.G.: Schema recognition for program transformation. ACM Symposium on LISP and Functional Programming, pp. 74\u201385 (1984)","DOI":"10.1145\/800055.802023"},{"key":"BF02983374_CR18","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0167-6423(88)90052-4","volume":"10","author":"P.G. Harrison","year":"1988","unstructured":"[Ha88] Harrison, P.G.: Linearisation: An optimisation for non-linear functional programs. Sci. Comput. Program.10, 281\u2013318 (1988)","journal-title":"Sci. Comput. Program."},{"issue":"1","key":"BF02983374_CR19","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/BF01940778","volume":"16","author":"J. Hilden","year":"1976","unstructured":"[Hi76] Hilden, J.: Elimination of recursive calls using a small table of \u201crandomly\u201d selected function values. BIT16(1), 60\u201373 (1976)","journal-title":"BIT"},{"key":"BF02983374_CR20","series-title":"Lect. Notes Comput. Sci.","volume-title":"Functional programming languages and computer architectures","author":"J. Hughes","year":"1985","unstructured":"[Hu85] Hughes, J.: Lazy memo-functions. In: Jouannand, J.P. (ed.) Functional programming languages and computer architectures. (Lect. Notes Comput. Sci., vol. 201) Berlin Heidelberg New York: Springer 1985"},{"key":"BF02983374_CR21","unstructured":"[Kh87] Khoshnevisan, H.: Automatic transformation systems based on function-level reasoning. Ph.D. thesis, Department of Computing, Imperial College, University of London (1987)"},{"key":"BF02983374_CR22","doi-asserted-by":"crossref","unstructured":"[KeS181] Keller, R.M., Sleep, M.R.: APPLICATIVE CACHING: Programmer control of object sharing and lifetime in distributed implementations of applicative languages. ACM Conference on functional languages and computer architecture, Portsmouth, pp. 131\u2013140 (1981)","DOI":"10.1145\/800223.806772"},{"key":"BF02983374_CR23","series-title":"Stanford Artificial Intelligence Memo","volume-title":"Predicate calculus with undefined as a truth value","author":"J. McCarthy","year":"1963","unstructured":"[Mc63] McCarthy, J.: Predicate calculus with undefined as a truth value. Stanford Artificial Intelligence Memo 1, Computer Science Dept., Stanford Univ., Stanford, Calif. (1963)"},{"key":"BF02983374_CR24","unstructured":"[Mc] McCarthy, J.: On efficient ways of evaluating certain recursive functions. Project MAC A.I. Memo 32, M.I.T., Cambridge, Mass. (undated)"},{"key":"BF02983374_CR25","unstructured":"[PaHe70] Paterson, M.S., Hewitt, C.E.: Comparative schematology. Record of project MAC Conference on concurrent systems and parallel computation, Woods Hole, Mass., pp. 119\u2013127 (June 1970)"},{"issue":"6","key":"BF02983374_CR26","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/0020-0190(76)90015-6","volume":"5","author":"H. Partsch","year":"1976","unstructured":"[PaPe76] Partsch, H., Pepper, P.: A family of rules for recursion removal related to the towers of Hanoi problem. Inf. Process. Lett.5(6), 174\u2013177 (1976)","journal-title":"Inf. Process. Lett."},{"key":"BF02983374_CR27","volume-title":"Combinatorial algorithms: Theory and practice","author":"E.M. Reingold","year":"1977","unstructured":"[ReNiDe77] Reingold, E.M., Nievergelt, J., Deo, N.: Combinatorial algorithms: Theory and practice. Englewood Cliffs, N.J., Prentice-Hall 1977"},{"key":"BF02983374_CR28","volume-title":"Algorithms","author":"R. Sedgewick","year":"1983","unstructured":"[Se83] Sedgewick, R.: Algorithms. Reading, MA: Addison-Wesley 1983"},{"issue":"12","key":"BF02983374_CR29","doi-asserted-by":"crossref","first-page":"1064","DOI":"10.1145\/359657.359667","volume":"21","author":"J.M. Spitzen","year":"1978","unstructured":"[SpLe78] Spitzen, J.M., Levitt, K.N.: An example of hierarchical design and proof. Commun. ACM21(12), 1064\u20131075 (1978)","journal-title":"ACM"},{"key":"BF02983374_CR30","volume-title":"The Fibonacci numbers","author":"N.N. Voroboyov","year":"1966","unstructured":"[Vo66] Voroboyov, N.N.: The Fibonacci numbers. Boston, Mass.: D.C. Heath 1966"},{"key":"BF02983374_CR31","volume-title":"Elements of combinatorial computing","author":"M.B. Wells","year":"1971","unstructured":"[We71] Wells, M.B.: Elements of combinatorial computing. London New York: Pergamon Press 1971"},{"issue":"4","key":"BF02983374_CR32","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/69622.357193","volume":"4","author":"J.H. Williams","year":"1982","unstructured":"[Wi82] Williams, J.H.: On the development of the algebra of functional programs. ACM Trans. Program. Languages Systems4(4), 733\u2013757 (1982)","journal-title":"ACM Trans. Program. Languages Systems"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02983374.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02983374\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02983374","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T23:48:26Z","timestamp":1558568906000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02983374"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,11]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,11]]}},"alternative-id":["BF02983374"],"URL":"https:\/\/doi.org\/10.1007\/bf02983374","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,11]]}}}