Generalised letrec semantics for mutual recursion

88 views Asked by At

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 ?

semantics rules

syntactic sugar

0

There are 0 answers