Conditions for the Completeness of
Functional and Algebraic Equational Reasoning
Jon G. Riecke and Ramesh Subrahmanyam. 1997.
Abstract: We consider the following question: in the simply-typed lambda-calculus with algebraic operations, is the set of equations valid in a particular model exactly those provable from (beta), (eta), and the set of algebraic equations, E, that are valid in the model? We find conditions for determining whether beta-eta-E-equational reasoning is complete. We demonstrate the utility of the results by presenting a number of simple corollaries for particular models.