[Haskell] Re: Eliminating Array Bound Checking through Non-dependent types

In article <200408060820.KAA13716@ripper.it.kth.se>, Bjorn Lisper <lisper@it.kth.se> wrote:

( A really interesting post on static elimination of array bounds checking by Oleg...)

Some questions and suggestions:

Am I right suspecting, that this method also solves the problem of assuring the right p in p-modular arithmetic (as complained by Sergei Mechveliani in his Basic Algebra proposal)? -- Dipl.-Math. Wilhelm Bernhard Kloke Institut fuer Arbeitsphysiologie an der Universitaet Dortmund Ardeystrasse 67, D-44139 Dortmund, Tel. 0231-1084-257