A side-effect-free call-by-value language has its ML-like syntax of expressions e extended to be able to model call-by-name and (LISP-like) call-by-text: e ::= . . . | suspend e | force e (call-by-name) e ::= . . . | quote e | eval e (call-by-text) Both suspend e and quote e yield an unevaluated representation of e as a value for later evaluation by force and eval respectively. Sketch two programs (differing only in whether they use suspend and force or quote and eval) that give different results.

Answer rating: 100% (QA)

The detailed answer for the above question is provided below ANSWER Here are two programs that diffe... View the full answer