1

I haven't been able to find any information on this, but I think that if someone knows it, it's someone here. I need it for some theoretical knowledge about lambda calculus and compiler optimizations.

EDIT: Moved to http://math.stackexchange.com/questions/29697/how-are-fractional-numbers-most-effectively-encoded-in-lambda-calculus

flag
1 
 Unless lambda calculus contains some nice natural way of doing this, I would think the simplest way would be the same way you'd program rational numbers in any other system, i.e. as ordered pairs. Of course first you'll need to do integers (ordered pairs of whole numbers). – Harry Altman Mar 28 2011 at 23:20
That would be one solution, but I don't think I can accept it when it's written in a comment. Could you post it as an answer, so I can accept it if there isn't a better way? – Anonymous Mar 28 2011 at 23:28
I'm afraid your question is outside the scope of this site. Please see the FAQ for more details about the purpose of MathOverflow, and for a list of other sites where you can ask your question. – S. Carnahan♦ Mar 29 2011 at 4:49
Sorry, I was redirected were by stackoverflow.com – Anonymous Mar 29 2011 at 9:45

closed as too localized by Dmitri Pavlov, S. Carnahan♦ Mar 29 2011 at 4:48

1 Answer

0

You should look at

http://www.inf.fu-berlin.de/lehre/WS03/alpi/lambda.pdf

link|flag
I'm sorry, but that wasn't what I asked for. – Anonymous Mar 29 2011 at 9:50
1 
 It is essentially the same solution as @Harry Altman's. Have a nice day! – Igor Rivin Mar 29 2011 at 13:48

Not the answer you're looking for? Browse other questions tagged or ask your own question.