I am learning semantics of Haskell and there I came across this question:
I have tried it but still unable to conclude the answer. It will be great if someone explains me how to prove this one. Thank you.
I am learning semantics of Haskell and there I came across this question:
I have tried it but still unable to conclude the answer. It will be great if someone explains me how to prove this one. Thank you.
Copyright © 2021 Jogjafile Inc.
Just a sketch -> Since pn(s) for fixed n is morphism Ninf -> N , that is set of Integers into Integer, this proof can be simplified using this relation into proof of transitivity over integers
[1,0,0 .. ] -> [2,0,0 ..] -> [3,0,0 ..] -> ...
I am sure you can find even more interesting one