mrsc
mrsc copied to clipboard
Simple language: lambda calculus with recursion
It should be extremely interesting to transform functional program with recursion and pattern matching into lambda calculus, supercompile it and then translate it back.
See two papers:
- Efficient Interpretation by Transforming Data Types and Patterns to Functions
- Comprehensive Encoding of Data Types and Algorithms in the λ-Calculus