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 di
Am Sonntag, 6. Januar 2008 20:04 schrieb Miguel Mitrofanov:
> > 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 f
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 progra
On 2008.01.06 15:54:00 +0100, Achim Schneider <[EMAIL PROTECTED]> scribbled
0.6K characters:
> Daniel Fischer <[EMAIL PROTECTED]> wrote:
>
> > Am Sonntag, 6. Januar 2008 15:18 schrieb Andrew Coppin:
> > > Daniel Fischer wrote:
> > > > Just because I don't know:
> > > > what bugs would be possible
On Sun, 2008-01-06 at 16:19 +0100, Daniel Fischer wrote:
> Am Sonntag, 6. Januar 2008 15:54 schrieb Achim Schneider:
> > Daniel Fischer <[EMAIL PROTECTED]> wrote:
> > > Am Sonntag, 6. Januar 2008 15:18 schrieb Andrew Coppin:
> > > > Daniel Fischer wrote:
> > > > > Just because I don't know:
> > > >
On Sun, 06 Jan 2008 17:19:31 +0200, Daniel Fischer
<[EMAIL PROTECTED]> wrote:
Am Sonntag, 6. Januar 2008 15:54 schrieb Achim Schneider:
Daniel Fischer <[EMAIL PROTECTED]> wrote:
> Am Sonntag, 6. Januar 2008 15:18 schrieb Andrew Coppin:
> > Daniel Fischer wrote:
> > > Just because I don't know
Am Sonntag, 6. Januar 2008 15:54 schrieb Achim Schneider:
> Daniel Fischer <[EMAIL PROTECTED]> wrote:
> > Am Sonntag, 6. Januar 2008 15:18 schrieb Andrew Coppin:
> > > Daniel Fischer wrote:
> > > > Just because I don't know:
> > > > what bugs would be possible in a language having only the
> > > >
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/
Daniel Fischer <[EMAIL PROTECTED]> wrote:
> Am Sonntag, 6. Januar 2008 15:18 schrieb Andrew Coppin:
> > Daniel Fischer wrote:
> > > Just because I don't know:
> > > what bugs would be possible in a language having only the
> > > instruction return ()
> >
> > Bug #1: You cannot write any nontrivial
Mads Lindstrøm wrote:
Andrew Coppin wrote:
Human kind has yet to design a programming language which eliminates all
possible bugs. ;-)
And we never will. See http://en.wikipedia.org/wiki/Halting_problem .
If you limit usage of general recursion (and rather favor structural
recursion) then yo
Daniel Fischer <[EMAIL PROTECTED]> wrote:
> Just because I don't know:
> what bugs would be possible in a language having only the instruction
> return ()
> (';' for imperative programmers)?
>
/me waves meaningful with his hand.
--
(c) this sig last receiving data processing entity. Inspect he
11 matches
Mail list logo
