You are FAST! That's amazing. Works exactly as advertised.
Re qng:
"The function returns the final approximation, result, an estimate of
the absolute error, abserr and the number of function evaluations
used, neval."
https://www.gnu.org/software/gsl/manual/html_node/QNG-non_002dadaptive-Gauss_0
Ah, OK cool.
So next: Write a small Lisp wrapper function to call the the foreign
routine and return it's values as a list or maybe an array?
---
wspage@suse:~> export SBCL_HOME=/usr/local/lib/sbcl
wspage@suse:~> fricas -nox
Checking for foreign routines
AXIOM="/usr/local/lib/fricas/target/x86_6
) (exp (- (* x x 0.0 1.0)
Value = 0.7468241328124271
---
I guess I can stick this stuff into '.sbclrc' and end up in FriCAS
that way, but would there be an easier and more portable way to
accomplish this if this should ever become a standard part of the
FriCAS distribution? Can the q
the same error once; after
>
> sudo apt-get install libgsl0-dev
>
> it works fine.
>
> Kurt
>
> It might also be a path problem (not very probable):
> http://stackoverflow.com/questions/28692610/install-gsll-on-sbcl-with-quicklisp
>
>
> Am 25.10.2015 um 04
: 68, column: 0, position: 2729)
--
My SuSE Linux SLES 11/SP3 installation is now a bit old and before
getting even this far I first had to recompile libffi from source.
Maybe something else is wrong but I am wondering if this works with
SBCL/
Thanks.
Bill Page.
On 23 October 2015 at 05:34
Lisp below and all of the
interface code that he did not include could be written in a
combination of BOOT and SPAD.
In any case I am motivated to try to help with this.
Cheers,
Bill Page
On 24 October 2015 at 04:28, Alasdair McAndrew wrote:
>
> The more I read about Lisp the more diffic
On 22 October 2015 at 21:31, Waldek Hebisch wrote:
> Bill Page wrote:
>>
>> What specifically implements the numeric evaluation in the example of
>>
>> NV(x:Float):Float == ... erf(...) ?
>
> One answer is: interpreter via typechecking. Another is that
Please subscribe to the email list:
To post to this group, send email to fricas-devel@googlegroups.com.
Visit this group at http://groups.google.com/group/fricas-devel.
For more options, visit https://groups.google.com/d/optout.
On 23 October 2015 at 11:59, Thomas Baruchel wrote:
> I think the p
f one does not want such automatic simplifications.
This is the essential difference between Expression Float and Expression
Integer.
Bill Page.
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra system" group.
To unsubscribe from thi
(1) -> NV(x:Float):Float == (1+erf(x/sqrt(2)))/2
Function declaration NV : Float -> Float has been added to
workspace.
Type: Void
(2) -> NV(0.7)
Compiling function NV with type Float -> Float
(2) 0.7580363477_769269
The mentioning of "ht" was a Freudian slip ;)
>>>
> Am 11.10.2015 um 18:59 schrieb Bill Page:
>>
>> FriCAS/Axiom graphics requires an X server and that would be very
>> awkward to include in a Jupyter kernel.
>
> That wasn't on my mind of course ...
On 11 October 2015 at 12:47, Kurt Pagani wrote:
>
> Hi Ralf,
>
> Am 11.10.2015 um 12:16 schrieb Ralf Hemmecke:
> ...
>> Graphics is not my main concern at the moment.
>> And hyperdoc I would anyway want to replace by fricas.github.io.
>
> Regarding graphics there are a lot of possibilities now (d3
On 11 October 2015 at 06:16, Ralf Hemmecke wrote:
> ...
> What I am not quite sure is whether the same AXIOMsys can work for both,
> command line version and as a jupyter kernel.
>
> Nevertheless, I'd be happy to have a fricas build procedure that
> automatically does the right thing for getting a
On 2015-10-10 8:08 PM, "Alasdair McAndrew" wrote:
> This is some of the best stuff I've seen for a long time - and in many
ways provides the sort of (Axiom) FriCAS interface which I think could
greatly increase its popularity.
>
> Many thanks for your hard work!
>
+1
Kurt, I think it would be
In FriCAS
(1) -> x:Polynomial(Integer)
Type: Void
(2) -> x + 1/2
1
(2) x + -
2
Type: Polynomial(Fraction(Integer))
On 1 October 2015 at 15:28, 'Bill Hart' via
On 1 October 2015 at 15:10, William Stein wrote:
> On Thu, Oct 1, 2015 at 12:00 PM, Bill Page wrote:
>> ... Clearly the related? concept of
>> "element" is borrowed from category theory - maybe even topos theory?
>
> Yes, parents and elements are from Magma.
On 1 October 2015 at 14:23, William Stein wrote:
> ...
> One other impression you have is that categories were just bolted on
> by combinatorics people at the end. However, David Kohel and I
> actually implemented the first round of category-related stuff in Sage
> right at the very, very beginni
On 1 October 2015 at 13:07, William Stein wrote:
> On Thu, Oct 1, 2015 at 9:38 AM, Bill Page wrote:
>> [Changed thread subject from: Sources of funding - perhaps computer
>> manufacturers? ]
>>
>> What I find hard to swallow is the peculiar mix of "parent",
e a Julia/Nemo list where this should be
continued?
Regards,
Bill Page.
On 1 October 2015 at 10:56, Bill Hart wrote:
>
> On Thursday, 1 October 2015 16:35:20 UTC+2, Bill Page wrote:
>
>>
>> Unfortunately while I am very much in favor of the category/domain
>> approach
.
-- Forwarded message --
From: Bill Page
Date: 12 September 2009 at 00:06
Subject: nasty little bug in pattern matching
To: fricas-devel
The following code:
--
K:=SparseMultivariatePolynomial(Fraction Integer,Symbol)
E:=Expression K
a:=a::Symbol::K; b:=b::Symbol::K; c:=c
this? I am not sure how I can help but if there
is something I can do, just let me know.
Cheers,
Bill Page.
On 13 August 2015 at 17:46, Kurt Pagani wrote:
> Hello Bill
>
> There's no hurry for that. The image is on docker-hub and will wait.
> I've also included your &quo
On 7 September 2015 at 20:33, Waldek Hebisch wrote:
> Abhinav Baid wrote:
>> I went with option 1 as ge_minimal is used within unexported functions
>> as well [1]. Is that fine?
>
> Yes.
> ...
> Thanks for your work. I hope that you will stay with us.
>
+1
--
You received this message because
The problem is that the return type of 'coefficient' when called with
'Symbol' is of type 'Polynomial Fraction Integer'.
Try it this way:
-- test2.input -
R ==> Fraction Integer
listCoeffs: Polynomial(R) -> List(R)
listCoeffs p ==
v : Symbol := variables(p).1
On 4 August 2015 at 07:51, Waldek Hebisch wrote:
>> ...
>> to pass "dynamic-space-size" but this does not seem to have any effect.
>
> Yes.
>
>> Can I build FriCAS from SBCL to provide more memory by default?
>
> One can specify '--dynamic-space-size' argument during _sbcl_
> build to get differen
to have any effect.
Can I build FriCAS from SBCL to provide more memory by default?
Bill Page.
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra system" group.
To unsubscribe from this group and stop receiving emails from it,
You could use this as a work-round:
(1) -> interpret(eval(integrate(x*exp(-(x-u)^2/2)/(sqrt(2*%pi)),
x=a..%plusInfinity), [a=1,u=0.5])::InputForm)
On 30 July 2015 at 22:23, Leon Baum wrote:
> Why can't doesn't the following produce a numerical result?
>
> (71) -> eval(integrate(x*exp(-(x-u)^2/2)
On 23 July 2015 at 18:43, Waldek Hebisch wrote:
> ... I would remove
> OrderedFreeMonoid and move functionality to FreeMonoid.
>
> Opinions?
>
+1
In general I think that removing the prefix "Ordered..." and merging
domains where ever possible is a good idea.
Bill.
--
You received this message
C but I have no idea if William Stein
really can make it commercially viable even if it is run as
essentially non-profit. In any case I am optimistic enough to have
become a member for $7 per month so that I can run my stuff on a more
dedicated SMC server.
Bill Page.
On 10 June 2015 at 17:25
questions.
I am also anxious to work with anyone interested in being a
collaborator in SMC to work on this.
Bill Page.
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra system" group.
To unsubscribe from this group and stop receiving emai
https://cloud.sagemath.com/projects/4bc39013-7b65-4a65-9d3d-bec4a4ce4d5a/files/fricas-CR%20Introduction.sagews
I have published the most recent version of my work on conjugate
expressions in FriCAS on Sage Math Cloud (SMC). This is still an
experiment but I would be very glad to receive criticism
CliffordAlgebra(2,Expression(Integer),[[*02c(1,1),*02c(2,1)],[*02c(1,2),*02c(
2,2)]])
Type: OutputForm
(61) ->
On 16 April 2015 at 12:06, Bill Page wrote:
> OK. Here is an example in the interpreter. One small surprize is the
>
(50) CliffordAlgebra(2,Expression(Integer),[[1,0],[0,1]])
Type: OutputForm
On 16 April 2015 at 10:35, Waldek Hebisch wrote:
> Bill Page wrote:
>>
>> Following up: Is 'devaluate' deprecated and not to be used o
Following up: Is 'devaluate' deprecated and not to be used or is it
intended for some other purpose? If so, what purpose?
On 15 April 2015 at 14:33, Waldek Hebisch wrote:
> Bill Page wrote:
>>
>> Solved. I found that this works:
>>
>> )abbrev domain TEST T
Thanks!
On 15 April 2015 at 14:33, Waldek Hebisch wrote:
> Answer is: use 'outputDomainConstructor(S)$Lisp'.
>
> PS: There is no need to have parametrized package. It is enough to
> pass type parameter to 'name'.
>
--
You received this message because you are subscribed to the Google Groups
"
Solved. I found that this works:
)abbrev domain TEST Test
Test(S:Type): with
name: ()->OutputForm
==
name() == devaluate(S)$Lisp::OutputForm
--
name()$Test(Complex Integer)
On 15 April 2015 at 12:40, Bill Page wrote:
> How can I obtain the name (domain expression) of a domai
How can I obtain the name (domain expression) of a domain as a
OutputForm in SPAD? E.g. something like:
)abbrev domain TEST Test
Test(S:Type): with
name: ()->OutputForm
==
name() == S::OutputForm
--
name()$Test(Complex Integer)
--
You received this message because you are subscribed
Some people might be interested in a draft new version of a similar
book by Davenport here:
http://staff.bath.ac.uk/masjhd/JHD-CA.pdf
It is incomplete in a few places but contains a lot of new material.
> On 6 April 2015 at 18:38, Waldek Hebisch wrote:
>>
>> OK, I was oversimplifying. One impo
On 6 April 2015 at 18:38, Waldek Hebisch wrote:
> Bill Page wrote:
>>
>> At the risk of unnecessarily complicating your example which I presume
>> was intended to address other issues, I would say that it is not
>> accurate to say that "we implement equality so
On 6 April 2015 at 19:06, Waldek Hebisch wrote:
> Bill Page wrote:
>>
>> On 5 April 2015 at 11:50, Waldek Hebisch wrote:
>> > Bill Page wrote:
>> >>
>> >> Reading the definition:
>> >>
>> >> ++ An eltable over domains D and
On 6 April 2015 at 19:12, Waldek Hebisch wrote:
>
> I think that generalizing XHashTable is a good idea. OTOH I
> think that trying to use it to implement Kernel (or Expression)
> has serious problems.
>
Besides the fact that there is no obvious efficient way to represent
an order relation on th
On 5 April 2015 at 17:43, Waldek Hebisch wrote:
> ...
> The discussion is more about equality and builtin simplifications.
> We could use representation like above for Expression(Integer).
> But then we would have to provide special code to implement
> simplifications due to associative law, distr
On 5 April 2015 at 11:50, Waldek Hebisch wrote:
> Bill Page wrote:
>>
>> Reading the definition:
>>
>> ++ An eltable over domains D and I is a structure which can be viewed
>> ++ as a function from D to I.
>> ++ Examples of eltable structures range from da
On 5 April 2015 at 05:24, Ralf Hemmecke wrote:
> On 04/05/2015 07:37 AM, Bill Page wrote:
>> After reviewing all of the discussion in this thread concerning
>> XHashTable, I find that I now agree with Ralf's original response.
>> Perhaps it is not a good design decision
On 5 April 2015 at 05:03, Ralf Hemmecke wrote:
>
> In fact, in the long run, I would like to remove non-constructive
> functions. Or at least adapt their specification. Equality of streams,
> for example, is not computable in general. So Stream(X) should not
> inherit from BasicType.
I think that
On 5 April 2015 at 04:49, Ralf Hemmecke wrote:
> ...
> In general I agree with Waldek that categories shouldn't have too many
> requirements for their arguments. And as for Eltable(A,B), yes,
> mathematically it sounds a bit odd that one can have a function
>
> elt: (%, A) -> B
>
> even though o
On 5 April 2015 at 12:32, Martin Baker wrote:
> I don't know if this is relevant to your discussion about kernels (most of
> it goes over my head) but I thought I might mention something I would like
> to implement, at some time in the future, in case there is some requirement
> that is relevant?
After reviewing all of the discussion in this thread concerning
XHashTable, I find that I now agree with Ralf's original response.
Perhaps it is not a good design decision to pass a custom equality
when creating an XHashTable. In fact, I would go further and claim
that this also applies to the pass
On 4 April 2015 at 18:19, Waldek Hebisch wrote:
> ...
>> On 04/04/2015 04:00 PM, Waldek Hebisch wrote:
>> > I think that categories should make only minimal requirements on
>> > parameters. So it is natural to generalize TableAggregate to
>> > require only Type on first parameter. Some operation
On 1 April 2015 at 02:26, Waldek Hebisch wrote:
>>
>> On 31 March 2015 at 18:21, Waldek Hebisch wrote:
>> ...
>> >For expression equality requires
>> >computing difference, while simple hash would remove irrationalities
>> >from denominators, which is much more involved.
>>
>> Express
On 1 April 2015 at 11:08, Ralf Hemmecke wrote:
> On 03/31/2015 10:46 PM, Bill Page wrote:
>> Code embedded in a lot of text, i.e. noweb, was bad enough but now we
>> have a lot of text embedded in code and that seems even worse.
>
> Sorry, but I still think that writing lit
On 1 April 2015 at 17:28, Ralf Hemmecke wrote:
> ..
> table: (Key -> SingleInteger) -> %
> ++ table(h) creates an empty hash table that uses h instead of
> ++ hash$Key. Note that h should be a mathematical function in
> ++ the sense that from k1=k2 follows h(k1)=h(k2). If tha
Oops, I meant to add this code:
On 1 April 2015 at 00:38, Bill Page wrote:
> ...
>>We may add some test to give better
>>error message, but it should be cheap (like comparing index
>>with bound).
>
> Yes, that is quite easy:
rehashAux!(x: %, ix: Z): %
On 31 March 2015 at 18:21, Waldek Hebisch wrote:
>
> 1) Why do you expect 'hash' to be cheaper than 'eq'? In normal
>case both 'hash' and 'eq' have to look at all components
>of a value.
If we look for A among many B_i we must look at all the components of
A and all the components of B_i
Oops, I meant to write:
On 31 March 2015 at 16:46, Bill Page wrote:
> ...
> Of course I will update the documentation but not without first
> complaining that the current situation with
>
> )if LiterateDoc ... )endif
>
and elsewhere as
)if false ... )endif
> in abou
On 27 March 2015 at 03:30, Ralf Hemmecke wrote:
>
> Well.. If we drop SetCategory from Key, then the documentation must be
> rewritten in some places. I strongly oppose if just the new function is
> committed without changing the appropriate places in the whole
> documentation, i.e. the part insid
On 26 March 2015 at 19:15, Waldek Hebisch wrote:
> Bill Page wrote:
>> ...
>> XHashTable(Key: SetCategory, Entry: Type):
>>Join(TableAggregate(Key, Entry), finiteAggregate, shallowlyMutable) with
>> table: (Key -> SingleInteger) -> %
>> @@ -111,6
On 26 March 2015 at 03:31, Ralf Hemmecke wrote:
> On 03/26/2015 04:25 AM, Waldek Hebisch wrote:
>> It makes sense to remove implementation of 'map' from
>> 'ExpressionFunctions2' in non-Ring case,
>
> Yes. Removal of bug is always good.
>
> Anyway, it's well known that I don't like Expression(X).
On 25 March 2015 at 23:25, Waldek Hebisch wrote:
> Bill Page wrote:
>> it seems that since List Integer is not a Ring, map is called
>> recursively on the list obtained by retract. But oddly the 2nd time
>> around S = Expression Integer and R = Expression List Integer so
Expression List Integer exports almost no operations. In particular
it does not export +. The representation of Expression List Integer is
a constant kernel in Kernel List Integer. The name constant() comes
from the operator name of this kernel created by constantKernel.
Use
)set message bottom
On 24 March 2015 at 10:10, Ralf Hemmecke wrote:
> On 03/24/2015 02:35 PM, Waldek Hebisch wrote:
>> I admit that current situation where at category level we claim
>> there here is hash function, but a lot of domains lack implementaion
>> is unsatisfactry. But it is not clear what to do. We could
://www.calculemus.net/meetings/siena01/Papers/Davenport.pdf
On 24 March 2015 at 09:35, Waldek Hebisch wrote:
> Bill Page wrote:
>>
>> The following patches provide hashUpdate! and as a result hash
>> functions to the Expression, Kernel, Float and Complex domains.
>> ...
>> wspag
On 23 March 2015 at 18:27, Ralf Hemmecke wrote:
> On 03/23/2015 03:41 PM, Bill Page wrote:
>> The following patches provide hashUpdate! and as a result hash
>> functions to the Expression, Kernel, Float and Complex domains.
>
> Looks OK to me. And if these domains export
The following patches provide hashUpdate! and as a result hash
functions to the Expression, Kernel, Float and Complex domains. Also
included is a patch to XHashTable to optionally pass a user specified
function representing equality in the key domain. This is important
for the use of XHashTable i
On 20 March 2015 at 14:07, Waldek Hebisch wrote:
> Bill Page wrote:
>>
>> On 19 March 2015 at 19:26, Waldek Hebisch wrote:
>> > Basically, kernels
>> > need special handling when saving/restoring them to/from files.
>> > Intput/output routines see only
On 19 March 2015 at 19:26, Waldek Hebisch wrote:
> Bill Page wrote:
>> ...
>> Why not something more SPADish like:
>>
>> Rep == Record(position:NonNegativeInteger, op:OP, arg:List S)
>
Gee, my guess was almost what it used to be ...
> That could be anwered
tion (partition) over a set
requires something else, no?
Bill.
On 18 March 2015 at 12:36, Waldek Hebisch wrote:
> Bill Page wrote:
>>
>> Waldek,
>>
>> Since this apparently came up again in another situation (your reply
>> to my recent email), I thought I would t
Thanks. I'll review your previous email in more detail.
On 17 March 2015 at 02:48, Waldek Hebisch wrote:
> Bill Page wrote:
>>
>> The following sequence of commands:
>>
>> --
>> integrate(sin(sqrt(x*x)),x)
>> )trace INTEF )math
>> integrate(s
Waldek,
Since this apparently came up again in another situation (your reply
to my recent email), I thought I would try again to more carefully
understand the problem you describe. I've highlighted some of your
original email by marking them a), b) etc. below.
On 10 May 2014 at 08:40, Waldek Heb
The following sequence of commands:
--
integrate(sin(sqrt(x*x)),x)
)trace INTEF )math
integrate(sin(sqrt(x*x)),x)
)trace INTEF )off
integrate(sin(sqrt(x*x)),x)
D(%,x)
%-sin(sqrt(x*x))
normalize %
--
produces unexpected results. For example:
http://axiom-wiki.newsynthesis.org/SandBoxTraceAffects
Sorry, it is my error. I tried again with a complete re-build from
SVN revision 1890 and everything is OK.
On 1 March 2015 at 11:29, Waldek Hebisch wrote:
> Bill Page wrote:
>> ...
>> (4) -> integrate(%,x)
>>
>>>> Error detected within library code:
wspage@opensuse:~> fricas -nox
Checking for foreign routines
AXIOM="/usr/local/lib64/fricas/target/x86_64-suse-linux"
spad-lib="/usr/local/lib64/fricas/target/x86_64-suse-linux/lib/libspad.so"
foreign routines found
openServer result 0
FriCAS Computer Algebra System
For hyperlinked pages like the TeXmacs page I think the best way would
be to create a new page and copy the contents (cut-and-paste) of the
old page to the new one. That way the link (camel-case words, i.e.
words containing more than one upper case letter) will not be changed.
If the old page is o
On 13 February 2015 at 14:06, Ralf Hemmecke wrote:
>
> I'm definitely for reverting that back to TeXmacs!
>
> Bill, you are probably most experienced with such things. Can you do it?
>
Sure. If there is no replacement page for TeXmacs, then the simplest
thing would be just to rename the OldTeXmac
I noticed that on January 8 someone identified as 'test1' on the wiki
renamed the TeXmacs page to OldTeXmacs. Since TeXmacs was a hyperlink
on quite a few other pages which referenced this program, these other
pages were automatically updated to now say OldTeXmacs everywhere that
used to say TeXmac
On 4 February 2015 at 10:13, Ralf Hemmecke wrote:
> On 02/04/2015 03:52 PM, Bill Page wrote:
>
> Whatever can be done with something of type Symbol depends on
> the library functions that have Symbol in there argument types.
>
Yes, that is trivially true. I was thinking
The distinction between "symbol" and "identifier" is rather subtle,
particularly in the interpreter - an identifier being something to
which we may assign a value and a symbol being something for which we
may substitute a value. Somewhere between Symbol and identifiers we
also have something called
On 3 February 2015 at 07:41, Ralf Hemmecke wrote:
>
> In fact, also the treatment of scripted symbols in Symbol is somewhat
> strange. It encodes the numbers of sub/super/presuper/presub scripts
> into the name of the symbol, and then concats all scripts into a flat
> list. Why not storing somethi
I remain strongly motivated to include something in FriCAS to provide
symbolic conjugate in Expression but I think that so far we have not
had sufficient opportunity to resolve differences of opinion on what
effect this might have on other parts of FriCAS. I am also a bit
disappointed that this do
On 19 January 2015 at 06:06, Ralf Hemmecke wrote:
>> Yes. 'xftest...' means failing test.
>
> OK.
>
> Waldek wrote:
>> expected failures are known bugs, so no news.
>
I am not familiar with the details of particular test frameworks but
it seems to me that one should be able to distinguish between
On 7 January 2015 at 09:54, Bill Page wrote:
>
> I think we all want to get new and interesting things done in FriCAS
> and now waste time on useless discussion. So rather than
Typo::
and *not* waste time on useless discussion. So rather than
> "bikeshedding" as such I
On 5 January 2015 at 18:44, Waldek Hebisch wrote:
>
> My policy was that comments are as author of the code wants
> them to be. Rationale for this policy is simple:
>
> - normally the author is the person who will fix problems,
> so his/her needs should take precedence
> - it cuts various bikes
On 31 December 2014 at 22:06, Waldek Hebisch wrote:
>> On 24 December 2014 at 20:31, Eugene Surowitz wrote:
>> > Ralf is only telling it as it is,
>> > but I wish I could be even as pessimistic as him.
>> >
> Bill Page wrote:
>>
>> I a
On 30 December 2014 at 17:49, Raymond Rogers wrote:
>
> On 12/30/2014 04:44 PM, Bill Page wrote:
> I am inclined more to agree with Waldek here that the SPAD language
> is already in principle sufficient as a mathematical notation - for
> someone sufficiently motivated to actu
On 30 December 2014 at 13:23, Raymond Rogers wrote:
>
> On 12/29/2014 04:05 PM, Bill Page wrote:
>
> Axiom - One developer - when he goes Axiom goes.
>
> I think that you are probably right here that "when he goes the
> [original] Axiom project goes". I am n
ly may thrive
while others wither and die out. Open source development is kind of
"organic" or maybe better said: "Darwinian". I think this is one of
the reasons that many concepts from conventional software
"engineering" do not map well into the open source world.
&g
> Oh, and PanAxiom has no systematic development of basic numerology.
>
I suppose it is worthwhile to ask what you might mean by "numerology"?
Obviously not http://en.wikipedia.org/wiki/Numerology ... Maybe
"number systems"?
Regards,
Bill Page.
--
You received this message becaus
On 26 December 2014 at 20:23, Waldek Hebisch wrote:
> Bill Page wrote:
>>
>> ... On the other hand, it does seem rather "heavy handed" to me for
>> Waldek to have gone to the trouble of removing it and risking irritating
>> Ralf over a relatively minor is
Well, I don't suppose that it is such a good thing to polarize things
any more but I am inclined to agree with Waldek concerning the
readability of SPAD versus the limited usefulness and potential
pitfalls of verbose documentation. I don't think that the material
deleted by Waldek from Ralf's patc
On 19 December 2014 at 12:56, Waldek Hebisch wrote:
>
> I admit that ATM I am thinking about removing ')savesytem',
> since what it is doing now is of little use and anything more
> interesting needs to be implemented.
>
> Opinions?
>
Remove it.
--
You received this message because you are subs
On 6 December 2014 at 20:06, Kurt Pagani wrote:
>
> Yes, 'class' is a good example to express what I initially wanted to
> say: in Fricas the types Integer,Float,Fraction(Integer) are for dealing
> with 'instances' of the corresponding 'class', whereas my focus was
> more on the methods of the 'cl
oposed, however, that's logic too, even
> HOL, and practically I'd be scared to compute an atlas of an algebraic
> manifold by the help of type inference.
I agree that in one sense you are right. Higher order logic might be
appropriate for describing the types used in FriCAS/Axiom. But fro
On 4 December 2014 at 08:08, Waldek Hebisch wrote:
> Bill Page wrote:
>>
>> On 30 November 2014 at 20:58, Waldek Hebisch
>> wrote:
>> > Bill Page wrote:
>> > ...
>> > Depends on definition of 'conjugate'. One reasonable definition
>&
On 30 November 2014 at 20:58, Waldek Hebisch wrote:
> Bill Page wrote:
> ...
> Depends on definition of 'conjugate'. One reasonable definition
> of 'conjugate' on _functions_ is:
>
> conjugate(f)(z) = conjugate(f(conjugate(z)))
>
This looks odd to me.
On 26 November 2014 at 02:50, Ralf Hemmecke wrote:
> ...
> Maybe, it's not new, but who would say that 2*\pi is real?
Yes, of course. FriCAS already has a domain name Pi and a category
named RealConstant with descendants of
FloatingPointSystem
IntegerNumberSystem
QuotientFieldCategory
Re
On 25 November 2014 at 16:29, Kurt Pagani wrote:
>
> )abbrev domain RR Real
> ++ Description: The field of "real numbers" modelled as
> ++ domain Expression(Integer) + some extensions.
Kurt, could you describe what you are trying to do in a little more detail?
Perhaps I am a little confused but
On 25 November 2014 at 14:05, Waldek Hebisch wrote:
> Bill Page wrote:
>> I propose the following patch:
>> +if (F has conjugate : F -> F) then
>> + localReal? x == x = conjugate(x)
>> +else if (R has imaginary : () -> R) and (R has conjugate : R
s conjugate : R -> R) then
localReal? x ==
(u := retractIfCan(x)@Union(R, "failed")) case R
and (u::R) = conjugate(u::R)
-
else localReal? x == true
iiilog x ==
--
On 25 November 2014 at 08:07, Bill Page wrote:
> Yes. Are you aware of any collater
Yes. Are you aware of any collateral damage that might result from
removing this implicit assumption?
Thanks.
On 25 November 2014 at 06:20, Waldek Hebisch wrote:
> Bill Page wrote:
>> (2) -> log(exp(z))
>>
>>(2) z
>>
I understand (1), (3) to (10) but why does FriCAS return (2)?
(1) -> exp(log(z))
(1) z
Type: Expression(Integer)
(2) -> log(exp(z))
(2) z
Type: Expression(Integer)
(3) -> sin(asin(z))
On 21 November 2014 09:33, Waldek Hebisch wrote:
> ...
> Transforming 'sqrt(x)' into 'exp(log(x)/2)' would go in opposite
> direction.
>
Yes, thank you. I see what you mean. As usual maybe the documentation
could be a little more explicit. :)
> For correctness 'realElementary' should be merged i
401 - 500 of 1443 matches
Mail list logo
