beautiful lcm code

[davidk01]

listCompare :: [Int]->[Int]->Int
listCompare (a:as) (b:bs)
| a==b = a
| a>b = listCompare (a:as) (bs)
| b>a = listCompare (as) (b:bs)

leastCommonMult :: Int->Int->Int
leastCommonMult m n = listCompare (p:ps) (q:qs)
where
p:ps = [m,2*m..m*n]
q:qs = [n,2*n..m*n]

you have to admit. this code is just awesome and it is not because i wrote it. it only works on positive integers though.