Timeline for Free and Bound in Lambda Calculus
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 31, 2016 at 12:33 | comment | added | Jay | I think Slonneger didn't use a good example there, because $\lambda x.y$ may be easily misread as $\lambda xy$, which is usually short for $\lambda x.\lambda y$. I would give a different example: in $(\lambda x.\lambda y. xyx)x$, the last occurrence of $x$ is free, and the others are bound. | |
| Mar 3, 2013 at 1:31 | history | tweeted | twitter.com/#!/StackCompSci/status/308026889644163072 | ||
| Mar 2, 2013 at 21:17 | answer | added | user7081 | timeline score: 11 | |
| Mar 2, 2013 at 21:12 | history | migrated | from cstheory.stackexchange.com (revisions) | ||
| Mar 2, 2013 at 4:47 | history | asked | user2054900 | CC BY-SA 3.0 |