On Saturday, February 22, 2014 2:33:19 AM UTC+11, vdelecroix wrote:
>
> * the matplotlib widgets: Sage right now uses matplotlib for main
> graphics capabilities. matplpotlib comes with a very complete and
> useful library for making interactive graphics in native windows (with
> cursors and al
I tried reinstalling sage-git, and that solved my problem. Thanks all for
the help!
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-devel+unsubscr...@google
On Friday, March 7, 2014 11:04:29 PM UTC-5, Inderpreet Singh wrote:
>
> On Sat, Feb 22, 2014 at 9:15 AM, john_perry_usm
> >
> wrote:
> > If the 2d notebook is on its way out, we should probably remove that, so
> > that students don't waste their time with proposals that won't be
> accepted.
> I assume Florent's point can be summarized as follow: in the context
> of Sage, and in particular of categories, the general Python rule
> "explicit is better than implicit" is to be taken with a grain of
> salt. Basically, "explicit" should be interpreted as "explicit from
> the code or from the
On Sat, Mar 08, 2014 at 04:13:59AM -0800, Volker Braun wrote:
>I don't understand how you your comment relates to the question. Of course
>I agree that the intended result (coercion in your example, or
>systematically provide methods for parents/elements on this ticket) should
>work
On Sat, Mar 08, 2014 at 12:24:13PM +, Simon King wrote:
> I am not sure if Volker and you talk about the same meaning of "syntax".
I assume Florent's point can be summarized as follow: in the context
of Sage, and in particular of categories, the general Python rule
"explicit is better than imp
On Fri, Mar 07, 2014 at 09:48:11AM -0800, Nils Bruin wrote:
>Shouldn't that be "Does Sage know that R is a finite set *by
>construction*?" If the "is_finite" result gets cached in the categories
>we'd violate immutability of parents, i.e.,
>
>sage: R in FiniteSets()
>False
>
I just cloned the git repo and tried to compile sage. It all went ok until
i got this error message:
>>> Trying to download
http://www.sagemath.org/packages/upstream/atlas/atlas-3.10.1.tar.bz2
[]
Checksum: 9084d7bb0580c54dd233f0b164f07f
On Saturday, March 8, 2014 2:48:03 AM UTC, Anne Schilling wrote:
>
> Volker, how quickly can you get your way of doing things implemented
> and tested in real life situations?
I still think that it would be relatively easy. Even faster would be to not
introduce the subclass syntax on the ticket
Hi Florent,
On 2014-03-08, Florent Hivert wrote:
>> The theory here is that Sets defines a Finite axiom, and by some metaclass
>> magic the inner class Cs.Finite ends up being a subcategory of Sets.Finite.
>> [...]
>> Nicolas thinks this amount of breverity is a desirable feature, and I think
>
I don't understand how you your comment relates to the question. Of course
I agree that the intended result (coercion in your example, or
systematically provide methods for parents/elements on this ticket) should
work effortlessly. The question is, how should the library implementation
look lik
Dear All,
I want to add my testimony about this as a user of the framework.
> What really bothers me with the ticket is the reliance on implicit magic
> over explicitly specifying relations between categories. From the ticket,
> this example:
> The theory here is that Sets defines a Fini
Hi Nils,
On 2014-03-07, Nils Bruin wrote:
> Shouldn't that be "Does Sage know that R is a finite set *by=20
> construction*?" If the "is_finite" result gets cached in the categories=20
> we'd violate immutability of parents, i.e.,
I think that that is not to happen.
Instead, if Sage knows by co
13 matches
Mail list logo
