Formalization of correctness of recursive definitions

DOI10.1007/BF00995809MaRDI QIDQ3874192zbMATH OpenOpenAlexFDO

Authors Tsong Yueh Chen

Publication date 1980

Published in International Journal of Computer & Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00995809

zbMATH Keywords

correctness of recursive definitionsfixpoint approach

Mathematics Subject Classification ID

Classical first-order logic (03B10) Recursive functions and relations, subrecursive hierarchies (03D20) Theory of computing (68Q99)

Cites work

• Formalization of equivalence of recursively defined functions
• Formalization of Properties of Functional Programs
• Formalization of properties of recursively defined functions
• scientific article; zbMATH DE number 3550181 (Why is no real title available?)
• scientific article; zbMATH DE number 3351180 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)

Cited in

(3)

• On the fixpoints of nondeterministic recursive definitions
• Formalization of properties of nondeterministic recursive definitions
• Semantics of algorithmic languages

This page was built for publication: Formalization of correctness of recursive definitions

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