scientific article; zbMATH DE number 890353

MaRDI QIDQ4882541zbMATH OpenFDO

Authors Hendrik Doornbos

Publication date 18 June 1996

zbMATH Keywords

well-foundednessprogram constructionrelation calculusadmitting inductionimplementing relations

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01) Data structures (68P05)

Recommendations

• Reductivity
• scientific article; zbMATH DE number 2087344
• scientific article; zbMATH DE number 1086635
• Reductional programming of functions represented by recurrent relations of the first order
• scientific article; zbMATH DE number 1086633

Cited in

(11)

• Final Dialgebras: From Categories to Allegories
• Reasoning about TSO programs using reduction and abstraction
• A calculational approach to mathematical induction
• Characterizing determinacy in Kleene algebras
• Datatype-generic termination proofs
• Deriving relational programs for computing kernels by reconstructing a proof of Richardson's theorem
• Components and acyclicity of graphs. An exercise in combining precision with concision
• A theory of reduced and minimal procedural dependencies
• Reducing Behavioural to Structural Properties of Programs with Procedures
• A compiled implementation of strong reduction
• Reconstruction of linear index expressions for reducing programs to a linear class

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4882541)