Results 1 
3 of
3
Fixed Points and Extensionality in Typed Functional Programming Languages
, 1992
"... ..."
(Show Context)
The Lambda Calculus is Algebraic
 Journal of Functional Programming
, 1996
"... this paper, we point out that the failure of the rule, and the subsequent need for a nonequational class of models, is not due to the lambda calculus itself, but to the way free variables are usually interpreted in these models. An equation M = N between open terms is usually said to be satisfied ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
(Show Context)
this paper, we point out that the failure of the rule, and the subsequent need for a nonequational class of models, is not due to the lambda calculus itself, but to the way free variables are usually interpreted in these models. An equation M = N between open terms is usually said to be satisfied in a lambda algebra A if it holds for all substitutions of elements of A for the free variables. We call this the local interpretation, and define M = N to hold