  We study the two Girard's translations of intuitionistic implication into
linear logic by exploiting the bang calculus, a paradigmatic functional
language with an explicit box-operator that allows both call-by-name and
call-by-value lambda-calculi to be encoded in. We investigate how the bang
calculus subsumes both call-by-name and call-by-value lambda-calculi from a
syntactic and a semantic viewpoint.
