Deriving structural induction in LCF
- Lawrence PaulsonAffiliated withComputer Laboratory, University of Cambridge
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” .
- Deriving structural induction in LCF
- Book Title
- Semantics of Data Types
- Book Subtitle
- International Symposium Sophia-Antipolis, France, June 27 – 29, 1984 Proceedings
- pp 197-214
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Additional Links
- Industry Sectors
To view the rest of this content please follow the download PDF link above.