(CBV) An evaluation strategy where arguments are evaluated before the function or procedure is entered. Only the values of the arguments are passed and changes to the arguments within the called procedure have no effect on the actual arguments as seen by the caller. See {applicative order reduction}, {call-by-value-result}, {strict evaluation}, call-by-name, lazy evaluation.

In addition suitable contents:
[ = ] [ actual argument ] [ al ] [ am ] [ an ] [ app ] [ applicative order reduction ] [ ar ] [ arc ] [ arg ] [ argument ] [ as ] [ at ] [ av ] [ az ] [ B ] [ b ] [ be ] [ by ] [ C ] [ ca ] [ call-by-name ] [ call-by-value-result ] [ cat ] [ CBV ] [ ch ] [ de ] [ du ] [ ec ] [ ed ] [ edu ] [ ee ] [ eg ] [ er ] [ es ] [ evaluation ] [ evaluation strategy ] [ fi ] [ file ] [ fo ] [ for ] [ function ] [ ge ] [ gu ] [ gy ] [ h ] [ hang ] [ hr ] [ id ] [ il ] [ in ] [ io ] [ is ] [ it ] [ la ] [ lazy evaluation ] [ Lex ] [ li ] [ lt ] [ lu ] [ ly ] [ mo ] [ mod ] [ module ] [ na ] [ nc ] [ ng ] [ nl ] [ no ] [ O ] [ pa ] [ ph ] [ pl ] [ pr ] [ procedure ] [ query ] [ rc ] [ re ] [ reduction ] [ ro ] [ S ] [ se ] [ st ] [ strict ] [ strict evaluation ] [ su ] [ th ] [ to ] [ tr ] [ ua ] [ um ] [ V ] [ va ] [ value ] [ ve ]