kevinsullivan / cs6501s23

Formal Mathematics for Software Design
6 stars 6 forks source link

4.2.2: "def plus : nat → nat → nat | nat.zero m := m | (nat.succ n') m := nat.succ (plus n' m) " --> Where do the n and m come from? I'm assuming that m is the second argument and n is the first argument, because that makes the most sense with the problem. The comment given is good but there's no specific pseudocode to illustrate what exactly is happening. #35

Closed nehakrishnakumar closed 1 year ago

nehakrishnakumar commented 1 year ago

Actually, it makes sense now, thank you!