Inductive data types for predicate transformers

DOI10.1016/0020-0190(92)90001-CzbMath0764.68095WikidataQ127436296 ScholiaQ127436296MaRDI QIDQ1199549

Oege de Moor

Publication date: 16 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

refinement calculuspredicate transformersprogramming calculidata typescatamorphisms

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01) Functor categories, comma categories (18A25)

Related Items (3)

A recursion theorem for predicate transformers on inductive data types ⋮ Data refinement, call by value and higher order programs ⋮ Predicate transformers and higher-order programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Data structures and program transformation
• The weakest prespecification
• A calculus of refinements for program derivations
• A fixpoint theorem for complete categories

This page was built for publication: Inductive data types for predicate transformers