BETA_CONV : conv
|- (\x.u)v = u[v/x]where u[v/x] denotes the result of substituting v for all free occurrences of x in u, after renaming sufficient bound variables to avoid variable capture. This conversion is one of the primitive inference rules of the HOL system.
- let val tm = Parse.Term `(\x.x+1)y` in BETA_CONV tm end; val it = |- (\x. x + 1)y = y + 1 :thm - let val tm = Parse.Term `(\x y. x+y)y` in BETA_CONV tm end; val it = |- (\x y. x + y)y = (\y'. y + y') : thm