Operational and semantic equivalence between recursive programs.

Authors:
Jean-Claude Raoult;Jean Vuillemin
Affiliations:
-;-
Venue:
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Year:
1978

Citing 5
Cited 0

A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
A Transformation System for Developing Recursive Programs

Journal of the ACM (JACM)
Minimal and Optimal Computations of Recursive Programs

Journal of the ACM (JACM)
Recursive functions of symbolic expressions and their computation by machine, Part I

Communications of the ACM
Models of LCF.

Models of LCF.

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we show that two widely different notions of program equivalence coincide for the language of recursive definitions with simplification rules. The first one is the now classical equivalence for fixed-point semantics. The other one is purely operational in nature and is much closer to a programmer's intuition of program equivalence.