0

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

glennsl
  • 28,186
  • 12
  • 57
  • 75
southpaw
  • 1
  • This question is more appropriate for for https://cs.stackexchange.com/ I think. SO is for practical programming problems. – glennsl Jan 10 '21 at 03:08
  • I’m voting to close this question because it's off-topic and belongs on https://cs.stackexchange.com/ – glennsl Jan 10 '21 at 03:10

0 Answers0