Deriving structural induction in LCF

  • Lawrence Paulson
Conference paper

DOI: 10.1007/3-540-13346-1_10

Volume 173 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Paulson L. (1984) Deriving structural induction in LCF. In: Kahn G., MacQueen D.B., Plotkin G. (eds) Semantics of Data Types. Lecture Notes in Computer Science, vol 173. Springer, Berlin, Heidelberg

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.

Structural induction is derived and discussed for several types, including lazy lists, finite lists, syntax trees for expressions, and finite sets. Experience with the LCF theorem prover is described.

The paper is a condensation of “Structural Induction in LCF” [12].

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1984

Authors and Affiliations

  • Lawrence Paulson
    • 1
  1. 1.Computer LaboratoryUniversity of CambridgeCambridgeEngland