Mathematica 9 is now available
Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
1992
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 1992

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

Search the Archive

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.





  • Prev by Date: article on Mathematica programming language in Dr. Dobbs Journal
  • Next by Date: Re: combination problem solved with Mathematica
  • Previous by thread: article on Mathematica programming language in Dr. Dobbs Journal
  • Next by thread: Re: combination problem solved with Mathematica