Showing papers by "Lawrence C. Paulson published in 1984"

Deriving structural induction in LCF.

Abstract: The fixed-point theory of computation allows a variety of recursive data structures. Constructor functions may be lazy or strict; types may be mutually recursive and satisfy equational constraints. Structural induction for these types follows from fixed-point induction; induction for lazy types is only sound for a subclass of formulas.