alushpranav/PeanoLang ? reverse-engineered prompt

Build me a small interpreter for a teaching language where everything is based on Peano numbers, pattern matching, recursion, and a few simple built in values like booleans, lists, pairs, and named literals.

I want to be able to write tiny programs in plain text, run them from the command line, and call functions like maxoftwo.120.130 or sort.[5,4,3,2,1]. The interpreter should type check calls before running them, support reusable helper functions from a shared folder, and print results in a friendly way, like numbers as normal integers, lists in brackets, pairs in parentheses, and booleans as Yes or No.

Please include the basic parser, evaluator, type checker, and command line options for raw output, dumping the parsed program, skipping reusable functions, and raising the recursion limit. If you need to look up anything current online, go ahead.