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.

Sign up for GitHub

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

Jump to bottom

[idea] graph-based implementation of lambda calculus #1

Open

xieyuheng opened this issue Oct 19, 2022 · 0 comments

Member

xieyuheng commented Oct 19, 2022

Normal forms of Parigot numerals are exponential in size,
but a reasonable term-graph implementation
should be able to keep them linear via sharing.

Implement lamping reduction by inet.

After this, we can use lambda encoding for real.

After using lambda encoding for real,
maybe we can get better understanding of inductive datatype

For example, parameters v.s. indexes.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment