On 12/31/12 12:25 PM, Carl Gundel wrote:
"If there are contradictions in the design, the program shouldn't
compile."
How can a compiler know how to make sense of domain specific
contradictions? I can only imagine the challenges we would face if
compilers operated in this way.
In the case of numerical method development, the math is represented in
Mathematica (Maple, Sage, Macsyma, etc.) and simulations are done using
the same or Matlab (Octave, Scipy, R, etc.). The foundational work is
already a program. One practical way to advance the state of the art
would be to ensure that the symbolic math packages had compilers that
created executables that performed as well as Fortran.
In general, I'm imagining more programmers adopting languages like Agda,
Coq, and ATS, and elaborating their compilers and runtimes to be
practical for programming in the large.
Marcus
_______________________________________________
fonc mailing list
[email protected]
http://vpri.org/mailman/listinfo/fonc