Formalization of equivalence of recursively defined functions

DOI10.1016/0020-0255(78)90048-8zbMath0443.68023OpenAlexW2047941947MaRDI QIDQ1144373

Tsong Yueh Chen

Publication date: 1978

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(78)90048-8

zbMATH Keywords

equivalence of recursive programsfixpoint approach

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Recursive functions and relations, subrecursive hierarchies (03D20) General topics in the theory of software (68N01)

Related Items (3)

Formalization of properties of nondeterministic recursive definitions ⋮ Formalization of correctness of recursive definitions ⋮ On the fixpoints of nondeterministic recursive definitions

Cites Work

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

This page was built for publication: Formalization of equivalence of recursively defined functions