Results 1 
2 of
2
BetaReduction As Unification
, 1996
"... this report, we use a lean version of the usual system of intersection types, whichwe call . Hence, UP is also an appropriate unification problem to characterize typability of terms in . Quite apart from the new light it sheds on fireduction, such an analysis turns out to have several othe ..."
Abstract

Cited by 13 (9 self)
 Add to MetaCart
this report, we use a lean version of the usual system of intersection types, whichwe call . Hence, UP is also an appropriate unification problem to characterize typability of terms in . Quite apart from the new light it sheds on fireduction, such an analysis turns out to have several other benefits
A Linearization of the LambdaCalculus and Consequences
, 2000
"... We embed the standard #calculus, denoted #, into two larger #calculi, denoted # # and &# # . The standard notion of #reduction for # corresponds to two new notions of reduction, # # for # # and &# # for &# # . A distinctive feature of our new calculus # # (resp., &# # ) is that, in every function ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We embed the standard #calculus, denoted #, into two larger #calculi, denoted # # and &# # . The standard notion of #reduction for # corresponds to two new notions of reduction, # # for # # and &# # for &# # . A distinctive feature of our new calculus # # (resp., &# # ) is that, in every function application, an argument is used at most once (resp., exactly once) in the body of the function. We establish various connections between the three notions of reduction, #, # # and &# # . As a consequence, we provide an alternative framework to study the relationship between #weak normalization and #strong normalization, and give a new proof of the oftmentioned equivalence between #strong normalization of standard #terms and typability in a system of "intersection types".