The operational semantics visualized here would not reflect well concepts from nondeterminism, and also some features for lambda calculus.
Refactor all code into small step operational semantics given as Inductive Proposition. For details, see programming language foundation in software foundation series.
Also, my goal is to prove that denotational semantics given coincide with operational semantics. Therefore, it may be helpful to have category theory implementation in Coq as library.
The operational semantics visualized here would not reflect well concepts from nondeterminism, and also some features for lambda calculus.
Refactor all code into small step operational semantics given as Inductive Proposition. For details, see programming language foundation in software foundation series.
Also, my goal is to prove that denotational semantics given coincide with operational semantics. Therefore, it may be helpful to have category theory implementation in Coq as library.