A recursion theorem for predicate transformers on inductive data types

DOI10.1016/0020-0190(94)00049-2zbMath0823.68063OpenAlexW2038072729MaRDI QIDQ1330667

David A. Naumann

Publication date: 29 October 1995

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

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00049-2

zbMATH Keywords

refinement calculusprogramming calculicatamorphisminductive data types

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Related Items (2)

Data refinement, call by value and higher order programs ⋮ Predicate transformers and higher-order programs

Cites Work

• Predicate transformers and higher-order programs
• Inductive data types for predicate transformers
• Pre-adjunctions in order enriched categories
• Programming as a Discipline of Mathematical Nature
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A recursion theorem for predicate transformers on inductive data types