[Haskell-cafe] Re: US Homeland Security program language security risks

Seth Gordon sethg at ropine.com
Wed Jan 9 13:59:35 EST 2008

Daniel Fischer wrote:
> Am Sonntag, 6. Januar 2008 15:54 schrieb Achim Schneider:
>> That's an interesting task: Design a non-touring complete,
>> restricted language in which every expression is decidable, without
>> making the language unusable for usual programming problems.
> I'm not a logician, but didn't Gödel prove that you couldn't express the 
> (full) arithmetic of natural numbers in such a language?

What if you restricted yourself to the arithmetic of natural numbers 
modulo 2^64?

More information about the Haskell-Cafe mailing list