explicit form for currying
In lambda calculus, we may express Currying functions and their inverses
explicitly using lambda expressions. Suppose that is a function
of two arguments. Then, if is the currying function which maps
of two arguments to higher order functions, we have, by definition,
We then have
hence
Likewise, from the original equation, we see that
Their inverses look as follows:
Title | explicit form for currying |
---|---|
Canonical name | ExplicitFormForCurrying |
Date of creation | 2013-03-22 17:03:57 |
Last modified on | 2013-03-22 17:03:57 |
Owner | rspuzio (6075) |
Last modified by | rspuzio (6075) |
Numerical id | 5 |
Author | rspuzio (6075) |
Entry type | Derivation |
Classification | msc 68Q01 |