Paper Info
Title
On Pseudo-C-Beta Normal-Form In Combinatory-Logic
Abstract
A cβ-reduction in combinatory logic analogous to λβ-reduction in λ-calculus was defined by the author in 1984. In this paper we define a notion of pseudo-cβnormal form and prove that for a CL-term X in pseudo-cβnormal form there exists a λ-term in λβ-normal form such that X ≡ M Hβ .
Year
DOI
Venue
1989
10.1016/0304-3975(89)90157-6
THEORETICAL COMPUTER SCIENCE
DocType
Volume
Issue
Journal
66
3
ISSN
Citations 
PageRank 
0304-3975
0
0.34
References 
Authors
0
1
Name
Order
Citations
PageRank
Mohamed Mezghiche12511.68