a recursion theorem for predicate transformers on inductive data types：关于归纳数据类型谓词的递归定理.pdfVIP

Information Processing Letters ELSEVIER Information Processing Letters 50 ( 1994) 329-336 A recursion theorem for predicate transformers on inductive data types David A. Naumann ’ Mathematics and Computer Science, Southwestern University, Georgetown, TX 78626, USA Communicated by D. Cries; received 4 October 1993; revised 13 December 1993 Keywords: Programming calculi, Refinement calculus; Inductive data type; Catamorphism; Predicate transformer; Higher types; Lax exponent 1. Introduction The calculus of predicate transformers has proved fruitful for the derivation of state-transformation programs in conventional languages with general recursion and demonic nondeterminacy [ 8, 10,111. Derivations involving direct manipulation of predicates can be unwieldy, so it is hoped that the algebraic, program-level style [5 ] that has proved so successful in the simpler calculus of functions can be extended to predicate transformers. In the calculus of functions, structural recursion on inductive data types - homomorphisms from initial algebras - is used to great effect. De Moor showed that inductive data types can be lifted from the category Fun of functions to