
6 Jan
2008
6 Jan
'08
10:04 a.m.
Achim Schneider wrote:
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.
Have a look about dependently typed languages like Epigram: http://www.e-pig.org/ Regards, apfelmus