Formalization of equivalence of recursively defined functions

DOI10.1016/0020-0255(78)90048-8MaRDI QIDQ1144373zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• 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?)
• Formalization of Properties of Functional Programs
• Formalization of properties of recursively defined functions

Cited in

(3)

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

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

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