Numeral Systems

• To: types@theory.LCS.MIT.EDU
• Subject: Numeral Systems
• From: David Wolfram <daw%computer-lab.cambridge.ac.uk@nss.cs.ucl.ac.uk>
• Date: Tue, 18 Apr 89 10:39:06 EDT
• Sender: meyer@theory.LCS.MIT.EDU

Date:    Mon, 17 Apr 89 16:14:42 BST

Is it possible to have a numeral system in pure simply typed lambda calculus
for which addition, multiplication, and subtraction or equality are lambda
definable?  This does not seem to be possible for simply typed Church numerals
by the Schwichtenberg - Statman result on extended polynomials.

David Wolfram.

• Prev: implicit recursion
• Next: MFPS special session
• Index(es):
  • Main
  • Thread