]> --- Alessandro Baretta <alex@baretta.com> wrote: > I wonder if the compiler gurus at the INRIA know > what kinds > of constraints imposed on the language would allow > the > compiler to statically check array indexing. I'm not a compiler guru from INRIA but I can point out the languages SAC (Single Assignment C) and FiSH (ask Google; I'm feeling lazy) that do array shape inference. Basically the type system for arrays in augmented by their shape and shapes are inferred in a similar way to types. In addition to eliminating bounds checks the compiler can do funky reordering optimisations (because these are functional languages, so evaluation order is not important) and produce code faster than Fortran. Exciting stuff if you're into numerical code. Noel __________________________________________________ Do You Yahoo!? Yahoo! Autos - Get free new car price quotes http://autos.yahoo.com ------------------- To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ Beginner's list: http://groups.yahoo.com/group/ocaml_beginners