[Date Index] [Thread Index] [Author Index]

Re: combination problem solved with Mathematica

• To: mathgroup at yoda.physics.unc.edu
• Subject: Re: combination problem solved with Mathematica
• From: ark at research.att.com
• Date: Mon, 30 Mar 92 13:10:49 EST

> i once  read a quote on the net from a person who said that a professor
> teaching ML at cmu told the class "if you submit to the discipline, you'll
> learn to like it" (which i suppose makes ML a B&D language). 

Sounds like someone who was teaching ML unwillingly and wanted to
turn people off in revenge.

> typechecking is a  special type of pattern matching (Cameron Smith called
> it  "pattern matching at the top-level only") This is available in the
> Mathematica programming language and in addition you can use all sorts of
> other pattern matching constraints.

Explain, please.

> as the user-defined library of Mathematica grows, there will be the
> definite danger that the language could degenerate from the proliferation
> of poorly written user-defined expressions.

This appears to be a universal problem.