An Adequate Left-Associated Binary Numeral System in the lambda-Calculus
5 points by bediger4000
5 points by bediger4000
This is an interesting approach :) before I only knew of Scott numerals as a shorter way of writing numbers in the lambda calculus, nice to see that there are other approaches too.
There is a category of encodings! Church numerals are an example of an initial encoding, in contrast to Scott numerals which are an example of a final encoding. There are non-initial non-final encodings as well, like Parigot numerals.