type systems - Generalised letrec semantics for mutual recursion

Question

I'm new to system types and I was wondering how mutual recursion is defined through generalized let rec x1=e1 ,....,xn=en in e .What has to be added in the "simple" letrec's semantics and evaluation rules and how is its syntactic sugar (using fix ) changed as well ?

question from:https://stackoverflow.com/questions/65649722/generalised-letrec-semantics-for-mutual-recursion

Answer 1

Waitting for answers