Memoization

In computing, memoization or memoisation is an optimization technique used primarily to speed up computer programs by storing the results of expensive function calls to pure functions and returning the cached result when the same inputs occur again. Memoization has also been used in other contexts (and for purposes other than speed gains), such as in simple mutually recursive descent parsing.^[1] It is a type of caching, distinct from other forms of caching such as buffering and page replacement. In the context of some logic programming languages, memoization is also known as tabling.^[2]

^ Norvig, Peter (1991). "Techniques for Automatic Memoization with Applications to Context-Free Parsing". Computational Linguistics. 17 (1): 91–98.
^ Warren, David S. (1992-03-01). "Memoing for logic programs". Communications of the ACM. 35 (3): 93–111. doi:10.1145/131295.131299. ISSN 0001-0782.

[Norvig1991-1] Norvig, Peter (1991). "Techniques for Automatic Memoization with Applications to Context-Free Parsing". Computational Linguistics. 17 (1): 91–98.

[2] Warren, David S. (1992-03-01). "Memoing for logic programs". Communications of the ACM. 35 (3): 93–111. doi:10.1145/131295.131299. ISSN 0001-0782.

[1]

[2]