Record Details

LAMBDA(BETA') - A LAMBDA-CALCULUS WITH A GENERALIZED BETA-REDUCTION RULE

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title LAMBDA(BETA') - A LAMBDA-CALCULUS WITH A GENERALIZED BETA-REDUCTION RULE
 
Creator OBEROI, S
 
Subject theory of computation
lambda calculus
beta reduction
currying
unordered currying
 
Description The classical notion of beta-reduction in the lambda-calculus has an arbitrary syntactically-imposed sequentiality. A new notion of reduction beta' is defined which is a generalization of beta-reduction. This notion of reduction is shown to satisfy the Church-Rosser property as well as some other fundamental properties, leading to the conclusion that this generalized notion of beta'-reduction can be used in place of beta-reduction without sacrificing any of the fundamental properties.
 
Publisher ELSEVIER SCIENCE BV
 
Date 2011-07-25T15:21:09Z
2011-12-26T12:51:15Z
2011-12-27T05:37:48Z
2011-07-25T15:21:09Z
2011-12-26T12:51:15Z
2011-12-27T05:37:48Z
1995
 
Type Article
 
Identifier INFORMATION PROCESSING LETTERS, 54(1), 45-53
0020-0190
http://dx.doi.org/10.1016/0020-0190(94)00225-N
http://dspace.library.iitb.ac.in/xmlui/handle/10054/6717
http://hdl.handle.net/10054/6717
 
Language en