Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Simple language: lambda calculus with recursion #27

Open
ilya-klyuchnikov opened this issue Aug 26, 2011 · 0 comments
Open

Simple language: lambda calculus with recursion #27

ilya-klyuchnikov opened this issue Aug 26, 2011 · 0 comments
Labels

Comments

@ilya-klyuchnikov
Copy link
Owner

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
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
None yet
Development

No branches or pull requests

1 participant