MathGroup Archive 1996

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

Search the Archive

pattern-matching and computer algebra sysytems

  • To: mathgroup at smc.vnet.net
  • Subject: [mg4863] pattern-matching and computer algebra sysytems
  • From: gaylord at ux1.cso.uiuc.edu (richard j. gaylord)
  • Date: Thu, 26 Sep 1996 22:42:19 -0400
  • Organization: university of illinois
  • Sender: owner-wri-mathgroup at wolfram.com

for ma review of macsyma in "computer is physics" [the new sept.-oct. 1996
issue]

Macsyma's pattern matching is not as powerful as Mathematica's but it is
significantly better than Maple's. Pattern matching can be a convenient
way to program, even if not the most efficient. When speed of execution is
not an issue, the user should have access to good pattern matching in
order to write code with the least effort"

-- 
"if you're not programming functionally, then you're programming dysfunctionally"

==== [MESSAGE SEPARATOR] ====


  • Prev by Date: list splitting
  • Next by Date: req. list sifting
  • Previous by thread: list splitting
  • Next by thread: req. list sifting