Computable compositions and universal program logics

MaRDI QIDQ800721zbMATH OpenFDO

Authors N. S. Nikitchenko

Publication date 1983

Published in Programming and Computer Software (Search for Journal in Brave)

zbMATH Keywords

Church's thesiscomposition programmingcomputable compositionpartial recursive functionuniversal imperative program logics

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Review text

Inspired by so-called composition programming developed by V. N. Red'ko, this paper formalizes the notion of computable composition and its corresponding thesis, which may be regarded as a relativized version of celebrated Church's thesis. The author uses this new formalism to define universal imperative program logics.

Recommendations

• scientific article; zbMATH DE number 3848602
• Theoretical aspects of structured-modular composition programming: Computability of the operations of the algebra of morphisms
• scientific article; zbMATH DE number 4049008
• Program Development in Computational Logic
• scientific article; zbMATH DE number 41849

Cited in

(6)

• Foundations of programmology
• Theoretical aspects of structured-modular composition programming: Computability of the operations of the algebra of morphisms
• Completeness problems in classes of computable named functions
• scientific article; zbMATH DE number 5856093 (Why is no real title available?)
• Composition aspects of programmology. I
• Mutual derivability of operations in program algebras. I

This page was built for publication: Computable compositions and universal program logics

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