Dynamic Programming Domain-Specific Language
Evaluate an entire dynprog recursion.
Extract the table name from a pattern.
Connects a recursion with sequences it should recurse over.
Translate condition expressions into calls that test them.
Translate a pattern into a predicate that checks the pattern.
Make pattern tests for all patterns.
Construct a test for a case in the recursion
String together the case if-statements of a recursion.
Parser for the ranges part of a specification.
Parser for the recursion part of a specification.
A domain-specific language for specifying translating recursions into dynamic-programming algorithms. See <https://en.wikipedia.org/wiki/Dynamic_programming> for a description of dynamic programming.