[Haskell-cafe] Clarification on proof section of HS: The Craft of FP

Stefan Holdermans sholderm at students.cs.uu.nl
Mon May 2 11:07:26 EDT 2005


Interestingly, we can also use induction to reason about infinite list. 
To this end, we use _|_ (`bottom' or `undefined') as a base case.

To prove something for both finite and infinite lists, one uses two 
base cases (_|_, and []) and takes the inductive step.



More information about the Haskell-Cafe mailing list