Operational and semantic equivalence between recursive programs.

DOI10.1145/800133.804334MaRDI QIDQ5402543zbMATH OpenOpenAlexFDO

Authors Jean Claude Raoult, Jean E. Vuillemin

Publication date 14 March 2014

Published in Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/800133.804334

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 3947605
• scientific article; zbMATH DE number 3907742
• scientific article; zbMATH DE number 2090728
• From operational to denotational semantics
• Inference rules for proving the equivalence of recursive procedures

Cited in

(12)

• From operational to denotational semantics
• Equivalence of recursive specifications in process algebra
• Algorithms for equivalence and reduction to minimal form for a class of simple recursive equations
• scientific article; zbMATH DE number 4156407 (Why is no real title available?)
• scientific article; zbMATH DE number 3907742 (Why is no real title available?)
• Infinite trees in normal form and recursive equations having a unique solution
• scientific article; zbMATH DE number 2090728 (Why is no real title available?)
• A language-independent proof system for full program equivalence
• Howe's method for higher-order languages
• scientific article; zbMATH DE number 3947605 (Why is no real title available?)
• Program morphisms
• scientific article; zbMATH DE number 3771583 (Why is no real title available?)

This page was built for publication: Operational and semantic equivalence between recursive programs.

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