论文信息 - Deriving Structural Induction in LCF

Deriving Structural Induction in LCF

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.

Lawrence C. Paulson | Lawrence Charles Paulson

[1] Rod M. Burstall,et al. Proving Properties of Programs by Structural Induction , 1969, Comput. J..

[2] Joseph E. Stoy,et al. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory , 1981 .

[3] William H. Burge,et al. Recursive Programming Techniques , 1975 .

[4] R. J. Bird. Programs and machines : an introduction to the theory of computation , 1976 .

[5] Bengt Nordström,et al. Programming in Constructive Set Theory: Some examples , 1981, FPCA '81.

[6] Lawrence C. Paulson,et al. Verifying the Unification Algorithm in LCF , 1985, Sci. Comput. Program..

[7] Joseph A. Goguen,et al. ALGEBRAS, THEORIES AND FREENESS: AN INTRODUCTION FOR COMPUTER SCIENTISTS , 1982 .

[8] Robert Cartwright,et al. The semantics of lazy (and industrious) evaluation , 1982, LFP '82.

[9] Robin Milner,et al. On using Edinburgh LCF to prove the correctness of a parsing algorithm , 1982 .

[10] Lawrence C. Paulson,et al. The revised logic PPLAMBDA : A reference manual , 1983 .

[11] Shigeru Igarashi. Admissibility of fixed-point induction in first- order logic of typed theories , 1972, International Sympoisum on Theoretical Programming.