Try starting with
(m * n) / m = n -- given m /= 0
Then do case analysis on n.
I found this process quite enlightening, thanks for posting.
-- ryan
2009/2/24 Peter Hilal :
> I'm working my way through Bird's _Introduction to Functional Programming
> Using Haskell_. I'd appreciate any help
On Tue, Feb 24, 2009 at 10:25:56AM -0500, Peter Hilal wrote:
Where do I go from here? Thank you so much.
A hint: I don't think you can do it by recursion on (/). You'll need
an auxiliary function. Then prove that your function satisfies the
constraint.
Phil (Unless there's some clever way to
I'm working my way through Bird's _Introduction to Functional
Programming Using Haskell_. I'd appreciate any help with problem
3.3.3, which is:
"Division of natural numbers can be specified by the condition (n *
m) / n = m for all positive n and all m. Construct a program for
division an
