From Undecidability.L Require Import L Seval LM_heap_def LM_heap_correct.
(* * L to TM *)
-Definition HaltLclosed (s : {s : term | closed s}) := exists t, eval (proj1_sig s) t. (* Halting problem for call-by-value lambda-calculus *)
Definition eva_LM_lin sigma := exists tau, evaluates step sigma tau.

Lemma red_haltL_to_LM_Lin s:
closed s -> HaltL s <-> eva_LM_lin (init s).