Thanks for the kind words.
I just posted a general announcement of the recent release candidate. See
https://groups.google.com/g/sage-devel/c/676IgptcB7I
Something I personally am interested in is interoperability between the
various systems and backends.
One thing that comes to mind is taking
FYI, related to this thread, it looks like Rocky and a few colleagues are
giving an upcoming talk (2020-10-30) on Mathics at SD110:
https://researchseminars.org/seminar/SageDays110
On Mon, Aug 31, 2020 at 1:44 PM Rocky Bernstein
wrote:
>
>
> On Mon, Aug 31, 2020 at 1:00 PM E. Madison Bray
>
On Mon, Aug 31, 2020 at 1:00 PM E. Madison Bray
wrote:
> On Tue, Jul 14, 2020 at 12:12 AM Rocky Bernstein
> wrote:
> >
> > I think we've beat this to death. So let's agree to disagree.
> >
> > This kind of thing is not intended for someone like you, but rather,
> someone like me who is just
On Tue, Jul 14, 2020 at 12:12 AM Rocky Bernstein
wrote:
>
> I think we've beat this to death. So let's agree to disagree.
>
> This kind of thing is not intended for someone like you, but rather, someone
> like me who is just getting started in Sage and CAS and wants to go through a
> number of
I think we've beat this to death. So let's agree to disagree.
This kind of thing is not intended for someone like you, but rather,
someone like me who is just getting started in Sage and CAS and wants to go
through a number of *simple* Mma tutorials and see *roughly* corresponding
results
the problem I see here is the recipe
requiring "user choice" and somehow specifying "inf in Mma"
Most users will not want to specify, but probably would go along with
"the mathematically consistent choice according to experts who have
studied the matter."
Certainly saying, as one choice, "inf
On Fri, Jul 10, 2020 at 8:41 PM rjf wrote:
> You of course realize that in expressing good intentions, you are not
> alone, and certainly
> not first.
> The devil is in the details. Parsing Mathematica expressions into an
> intermediate
> form (like a Lisp symbolic expression) is the easy part.
You of course realize that in expressing good intentions, you are not
alone, and certainly
not first.
The devil is in the details. Parsing Mathematica expressions into an
intermediate
form (like a Lisp symbolic expression) is the easy part.
Here's a detail that came up in another mailing list.
Ok. Something to consider is rendering to Mathematica output. (And then
doing the same thing for Sage.)
On Fri, Jul 10, 2020 at 1:37 PM Fredrik Johansson <
fredrik.johans...@gmail.com> wrote:
> I will just mention http://fungrim.org/grim/ which is somewhat related to
> the present discussion.
>
I will just mention http://fungrim.org/grim/ which is somewhat related to
the present discussion.
This is an attempt to design a symbolic formula language that is easy to
parse and has well-defined semantics. Key points:
* Can be used within Python (and other languages) without special syntax
Ok. This is on my back-burner list of things to get to.
It is something I would like to do, and think I could do reasonably well,
but I never know if I'll have the free time.
And if someone else wants to take the lead, I'll be happy to share what I
know on the compiler/transpiler end and
Clearly, adding the ability to parse some Mathematica code fits well into
> that goal. If nothing else, it could be a helpful step in converting
> existing Mathematica user code so that it can work in Sage, and that's
> part of being a viable alternative.
>
This is an important point
Thanks for the kind words and encouragement.
On Mon, Jul 6, 2020 at 1:05 AM William wrote:
> Hi Rocky,
>
> I haven't followed every detail of this thread, but just wanted to
> encourage you. The official and original mission statement of SageMath is
> to "Create a viable free open source
Hi Rocky,
I haven't followed every detail of this thread, but just wanted to
encourage you. The official and original mission statement of SageMath is
to "Create a viable free open source alternative to Magma, Maple,
Mathematica and Matlab." Clearly, adding the ability to parse some
On Sun, Jul 5, 2020 at 3:14 PM rjf wrote:
> You could take a look at what Albert Rich has done for testing Rubi in
> different systems.
> Also, the theorem proving people using Coq want to match up with CAS.
> Also, the history of formalizing mathematics (Frege, Russell, etc) may
> influence
On Sat, Jul 4, 2020 at 3:29 PM Nils Bruin wrote:
> On Saturday, July 4, 2020 at 9:10:33 AM UTC-7, Rocky Bernstein wrote:
>>
>>
>> So one goal as briefly mentioned was to be able to write/use a common
>> language for expressing CAS.
>>
>
> This goal (or perhaps a little more broadly, a common
On Sat, Jul 4, 2020 at 7:40 PM rjf wrote:
> There are at least two rather complete parsers for the "Wolfram Language"
> which
> render stuff like
> foo[x_]:= Sin[x]+Log[x]
> into trees / intermediate forms/ Lisp s-expressions.
> (compare to Wolfram's "FullForm" which is essentially lisp
On Sun, Jul 5, 2020 at 12:40 AM rjf wrote:
>
> There are at least two rather complete parsers for the "Wolfram Language"
> which
> render stuff like
> foo[x_]:= Sin[x]+Log[x]
> into trees / intermediate forms/ Lisp s-expressions.
> (compare to Wolfram's "FullForm" which is essentially
There are at least two rather complete parsers for the "Wolfram Language"
which
render stuff like
foo[x_]:= Sin[x]+Log[x]
into trees / intermediate forms/ Lisp s-expressions.
(compare to Wolfram's "FullForm" which is essentially lisp with []
instead of (), and moving parens... x+y becomes
On Saturday, July 4, 2020 at 9:10:33 AM UTC-7, Rocky Bernstein wrote:
>
>
> So one goal as briefly mentioned was to be able to write/use a common
> language for expressing CAS.
>
This goal (or perhaps a little more broadly, a common language for
expressing mathematical objects) has been around
I am sorry that what I posted originally somehow didn't go through. It took
me a while to write and touches on a number of things mentioned in the
discussion. So let me try again.
I have a limited simple-minded brain for all of the various syntaxes and
dialects. So one goal as briefly mentioned
21 matches
Mail list logo
