Services & Resources / Wolfram Forums / MathGroup Archive
-----

MathGroup Archive 2010

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

Search the Archive

Re: Re: Re: More /.{I->-1} craziness

  • To: mathgroup at smc.vnet.net
  • Subject: [mg106230] Re: [mg106172] Re: [mg106159] Re: More /.{I->-1} craziness
  • From: "E. Martin-Serrano" <eMartinSerrano at telefonica.net>
  • Date: Tue, 5 Jan 2010 01:49:16 -0500 (EST)
  • References: <201001041057.FAA21128@smc.vnet.net>

Hi,

It is well known that there are many books about syntax (and semantics) and
programming languages available in English. (of course, most of you know
that). But, for others interested in the subject, the following are good
sources to find any reference.

Lambda Calculus: http://en.wikipedia.org/wiki/Lambda_calculus (Close to the
Mathematica underlaying form.)

BNF grammars : http://en.wikipedia.org/wiki/Backus%E2%80%93Naur_Form (The
simplest form; only context-free syntax)

Affix-grammars: http://en.wikipedia.org/wiki/Affix_grammar (Augmented BNF to
include context sensitive syntax and semantics)

Two-Level grammars: http://en.wikipedia.org/wiki/Two-level_grammar
(Meta-grammars and hyper-grammars togheter o more sophisticated form of
Affix Grammrs used to describe Algol 68)

Petri nets: http://en.wikipedia.org/wiki/Petri_net (enriched finite state
machine grammars to include devices to trigger state transitions)

Phrase structured grammars: http://en.wikipedia.org/wiki/Chomsky_hierarchy
(seminal work in the field)

And many others.


E. Martin-Serrano




-----Original Message-----
From: Andrzej Kozlowski [mailto:akoz at mimuw.edu.pl] 
Sent: Monday, January 04, 2010 11:58 AM
To: mathgroup at smc.vnet.net
Subject: [mg106230] [mg106172] Re: [mg106159] Re: More /.{I->-1} craziness


On 3 Jan 2010, at 17:41, Leonid Shifrin wrote:

> Hi Richard,
>
> Below I describe  rather extensively my view on the issues you raised.  J=
ust
> to make myself clear, it is not my intention to get involved in an endles=
s
> debate on these topics. I try to adhere to DRY (don't repeat yourself)
> principle whenever I feel appropriate, so I detail my view on these subje=
cts
> below with the intention to do it only once. But I will certainly appreci=
ate
> your feedback.
>
> On Sat, Jan 2, 2010 at 9:06 AM, R Fateman <fateman at cs.berkeley.edu> wrote=
:
>
>> Leonid Shifrin wrote:
>>
>>> Regarding this issue, I think I entirely agree with what David Bailey a=
nd
>>> other people said: I don't consider replacement rules as a mathematical=
 tool
>>> for end users, but rather as an inner layer of Mathematica, which is al=
so
>>> exposed for flexibility / convenience and intended primarily to be used=
 by
>>> the more advanced users.
>>>
>>
>> Unfortunately many users or potential users are not as sophisticated in
>> their understanding of the distinction between the underlying mechanisms=
 of
>> a syntax-driven
>> transformation system.  They simply take the marketing blurbs about "A
>> system for doing mathematics"  as a description suggesting that --hey, I=
 do
>> mathematics too.  They don't really know what "syntax" means and they do=
n't
>> think they need to know, because syntax is not part of their mathematics
>> education.
>>
>
> Well, if these people don't understand the importance of syntax for doing
> any formal sicence, regardless of whether it is done by a human or a
> computer, and somehow believe that some software is able to completely
> automate this problem away without any further efforts on their side  -  =
too
> bad for them and their current and future employers. Every tool used blin=
dly
> will eventually produce nonsense. Mathematica is a research tool. I view =
it
> as a tool for explorations, tests, verifications and sometimes discoverie=
s,
> but not a substitute for domain knowledge, intuition, right questions to =
ask
> and anticipation for possible correct answers.


I would add this: if someone does not know what syntax is he should take
some time off and read almost any introductory on mathematical logic. Need
not be written by anyone who has anything to do with computer science and
can be in fact pretty old.
The first example form my shelf: Yuri Manin "Lecture on Mathematical Logic"
vol 1., Chapter I, Section 2, Language of propositions: alphabet, syntax and
interpretation. (1974, in Russian but there is no shortage of equivalent
English texts).



  • Prev by Date: Re: Re: NDSolve problem with switching
  • Next by Date: Re: Combining data from indexed lists efficiently
  • Previous by thread: Re: Re: More /.{I->-1} craziness
  • Next by thread: Re: More /.{I->-1} craziness