BAL paper available

[Stefan Karrmann]

On Tue, May 15, 2001 at 09:14:02PM +0300, Dylan Thurston wrote:
> On Tue, May 15, 2001 at 06:33:41PM +0200, Jerzy Karczmarczuk wrote:
> > Serge Mechveliani :
> > > ...
> > > The matter was always in parametric domains ...
> > > Whoever tried to program real CA in Haskell, would agree that such a
> > > problem exists.
> 
> Can you be more precise what the problem is?  One problem I see is
> that referred to in Section 3 of the paper: you really need types that
> depend on parameters (in particular, integer parameters).  This is,
> indeed, a problem--currently, you have to do runtime checks.
> 
> Full-fledged dependent types à la Cayenne are undecidable, but there
> are weaker variants that are likely to be good enough.

What are the weaker variants? Do you know some references?
Are they still decidable? That surprises me. If you allow integer
arithmetic you can do already all computations (Church).

-- 
Stefan Karrmann