BibTeX
@MISC{Hancock99theamen,
author = {Peter Hancock},
title = {The AMEN architecture.},
year = {1999}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
There are many combinatorially complete sets of combinators, or `instruction sets' to which the -calculus can be compiled. The most famous are perhaps fS; K g and fB;C;K;W g. Several authors have observed that there is a set of `arithmetical' combinators fA; M;E;N g arising from the Church numerals, which is also combinatorially complete. However their sets of combinators are not absolutely perfect. The perfect set of combinators ( f(+); (); (^); 0g in section-notation) is defined herein. There is
