Formalization of correctness of recursive definitions

DOI10.1007/BF00995809zbMath0435.03034OpenAlexW2032490842MaRDI QIDQ3874192

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

fixpoint approachcorrectness of recursive definitions

Mathematics Subject Classification ID

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

Related Items (3)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Formalization of equivalence of recursively defined functions
• Formalization of properties of recursively defined functions
• Formalization of Properties of Functional Programs

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