Recent content by lpjhjdh

Looking over what I've said I'm not sure I really addressed your question very well so I'll be a bit more specific. All you know about the term "xs" is that it's a list of a's. We could perform case analysis and then have the two cases x:[] and x:x':xs', however we're stuck in the same...

You might consider taking a look at the Haskell community or other language theoretic sites like lambda the ultimate as this is really more of a computer science/type theory question. The following might help, you already have some of these steps but just to be explicit: 1) Write out exactly...