1. A bound variable or formal argumeNT in a function definition is replaced by the actual argumeNT when the function is applied. In the lambda abstraction x . M x is the bound variable. However, x is a free variable of the term M when M is considered on its own. M is the scope of the binding of x. 2. In logic a bound variable is a quaNTified variable. See quaNTifier.

In addition suitable coNTeNTs:
[ 2 ] [ = ] [ abstraction ] [ actual argumeNT ] [ al ] [ am ] [ an ] [ app ] [ ar ] [ arc ] [ arg ] [ argumeNT ] [ b ] [ bd ] [ bi ] [ bo ] [ bs ] [ by ] [ ch ] [ co ] [ con ] [ cons ] [ de ] [ ding ] [ du ] [ ed ] [ ee ] [ er ] [ fi ] [ file ] [ fo ] [ for ] [ formal argumeNT ] [ fr ] [ free ] [ free variable ] [ function ] [ gi ] [ gu ] [ h ] [ hr ] [ id ] [ ie ] [ il ] [ in ] [ io ] [ is ] [ it ] [ la ] [ lambda abstraction ] [ Lex ] [ li ] [ M ] [ ma ] [ mo ] [ mod ] [ module ] [ na ] [ nc ] [ ng ] [ ni ] [ ns ] [ op ] [ pe ] [ ph ] [ pl ] [ quaNTifier ] [ query ] [ rc ] [ re ] [ S ] [ sc ] [ scope ] [ se ] [ si ] [ st ] [ th ] [ tr ] [ ua ] [ um ] [ va ] [ var ] [ variable ] [ ve ]