Skip to content

Implement memoization as a a language level feature #13

Description

@adamhaney

It would be cool if function results were stored in a cache so that recursive computations could be implemented without recomputing values.

Ideally IMHO this a cache object should be configurable as an argument to the interpreter so that decisions about cache expiration and storage can be handled by the object (think storing memoized results stored in a large memcached cluster, or an approach that uses caching techniques smarter than LRU based on function "expense").

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions