Pierre Weis <Pierre.Weis@inria.fr> writes:
> concisely express a solution to a difficult problem. Although
> we base most of our command and control software in Java, ML
> is still the choice for modeling and graph theory.
Speaking of graph theory, does anyone know of a collection of
*caml code to deal with least path, clustering, etc?
-- Stefan Kahrs in [Kah96] discusses the notion of completeness--programs which never go wrong can be type-checked--which complements Milner's notion of soundness--type-checked programs never go wrong [Mil78].
This archive was generated by hypermail 2b29 : Sat Apr 15 2000 - 22:44:40 MET DST