Conditions for the completeness of functional and algebraic equational reasoning

We consider the following question: in the simply-typed λ-calculus with algebraic operations, is the set of equations valid in a particular model exactly those provable from (β), (η) and the set of algebraic equations, E, that are valid in the model? We find conditions for determining whether βηE-equational reasoning is complete. We demonstrate the utility of the results by presenting a number of simple corollaries for particular models.

[1]  John C. Mitchell,et al.  Foundations for programming languages , 1996, Foundation of computing series.

[2]  J. Girard.  Une Extension De ĽInterpretation De Gödel a ĽAnalyse, Et Son Application a ĽElimination Des Coupures Dans ĽAnalyse Et La Theorie Des Types , 1971 .

[3]  P. J. Landin,et al.  Correspondence between ALGOL 60 and Church's Lambda-notation , 1965, Commun. ACM.

[4]  V. Yu. Sazonov.  Expressibility of functions in D. Scott's LCF language , 1976 .

[5]  Jon G. Riecke.  Statman's 1-Section Theorem , 1995, Inf. Comput..

[6]  G.D. Plotkin,et al.  LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[7]  Leon Henkin,et al.  The Logic of Equality , 1977 .

[8]  R. Statman.  Equality between Functionals Revisited , 1985 .

[9]  Richard Statman,et al.  Completeness, invariance and λ-definability , 1982, Journal of Symbolic Logic.

[10]  Albert R. Meyer,et al.  What is a Model of the Lambda Calculus? , 1982, Inf. Control..

[11]  K. Sieber.  Applications of Categories in Computer Science: Reasoning about sequential functions via logical relations , 1992 .

[12]  Stavros S. Cosmadakis,et al.  Computing with recursive types , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[13]  Daniel J. Dougherty,et al.  Equality between Functionals in the Presence of Coproducts , 2000, Inf. Comput..

[14]  H. Friedman.  Equality between functionals , 1975 .

[15]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[16]  Limsoon Wong,et al.  Relational expressive power of constraint query languages , 1996, PODS.

[17]  John C. Reynolds,et al.  On the Relation between Direct and Continuation Semantics , 1974, ICALP.

[18]  V. Breazu-Tannen,et al.  Combining algebra and higher-order types , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[19]  Eugenio Moggi,et al.  Notions of Computation and Monads , 1991, Inf. Comput..

[20]  Jon G. Riecke,et al.  The logic and expressibility of simply-typed call-by-value and lazy languages , 1992 .

[21]  Val Tannen,et al.  Computable values can be classical , 1987, POPL '87.

[22]  Richard Statman,et al.  Logical Relations and the Typed lambda-Calculus , 1985, Inf. Control..

[23]  John C. Reynolds,et al.  Towards a theory of type structure , 1974, Symposium on Programming.

[24]  Alex K. Simpson.  Categorical completeness results for the simply-typed lambda-calculus , 1995, TLCA.