[Haskell-cafe] Re: US Homeland Security program language security
miguelimo38 at yandex.ru
Sun Jan 6 14:04:01 EST 2008
> 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.
Well, I did something like that a few years ago - it was a sort of
assembler language, allowing the programmer to, say, sort an array,
but not to calculate Akkerman function.
More information about the Haskell-Cafe