Computing with recursive types
Proceedings of the Fourth Annual Symposium on Logic in computer science
Modular higher-order E-unification
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
Research topics in functional programming
Semantics with applications: a formal introduction
Semantics with applications: a formal introduction
The logic and expressibility of simply-typed call-by-value and lazy languages
The logic and expressibility of simply-typed call-by-value and lazy languages
| Hi-index | 0.00 |
We consider the following problem in proving observational congruences in functional languages: given a call-by-name language based on the simply-typed &lgr;-calculus with algebraic operations axiomatized by algebraic equations E, is the set of observational congruences between terms exactly those provable from (&bgr;), (&eegr;), and E? We find conditions for determining whether &bgr;&eegr;E-equational reasoning is complete for proving the observational congruences between such terms. We demonstrate the power and generality of the theorems by presenting a number of easy corollaries for particular algebras.