Call-by-Value {lambda}-calculus and LJQ

LJQ is a focused sequent calculus for intuitionistic logic,with a simple restriction on the first premiss of the usualleft introduction rule for implication. In a previous paperwe discussed its history (going back to about 1950, or beyond)and presented its basic theory and some applications; here wediscuss in detail its relation to call-by-value reduction inlambda calculus, establishing a connection between LJQ and theCBV calculus _C of Moggi. In particular, we present an equationalcorrespondence between these two calculi forming a bijectionbetween the two sets of normal terms, and allowing reductionsin each to be simulated by reductions in the other.