Abstract | ||
---|---|---|
In this paper we describe a cp-machine which implements in a simple way the c beta-reduction. This reduction is a combinatory reduction which is equivalent to the lambda beta-reduction and is defined in Mezghiche (1984, 1989). Some definitions and properties of c beta-reduction are recalled before giving the definition of the c beta-machine. |
Year | DOI | Venue |
---|---|---|
1997 | 10.1016/S0304-3975(97)00040-6 | THEORETICAL COMPUTER SCIENCE |
Keywords | DocType | Volume |
combinatory reduction,lambda beta-reduction,c beta-reduction,functional programming languages | Journal | 189 |
Issue | ISSN | Citations |
1-2 | 0304-3975 | 0 |
PageRank | References | Authors |
0.34 | 0 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Mohamed Mezghiche | 1 | 25 | 11.68 |