home bbs files messages ]

Forums before death by AOL, social media and spammers... "We can't have nice things"

   sci.math.symbolic      Symbolic algebra discussion      10,432 messages   

[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]

   Message 9,518 of 10,432   
   bursejan@gmail.com to All   
   =?UTF-8?Q?Re=3A_Test_Cases_for_Gr=C3=B6b   
   05 Jul 17 11:44:25   
   
   Am Mittwoch, 5. Juli 2017 20:17:59 UTC+2 schrieb Richard Fateman:   
   > When one resorts to argumentum ad hominem it is a   
   > compliment to the quality of the opposing argument, and a sign   
   > of desperation on one's part.   
      
   Likewise, you RJF started this bull shit.   
      
   > On 7/5/2017 4:55 AM, bursejan@gmail.com wrote:   
   >   I just ran it on my Maxima (5.40.0)/SBCL system.   How to run in SBCL   
   > has been described earlier in this thread.   Jan can do it.)   
      
   Yes, I was expecting that you run it with SBCL. But I also   
   wrote somewhere else that CLISP is more faithful to my   
   Prolog interpreter.   
      
   And you might have a blind spot here. The situation among   
   Prolog systems is very similar as among LISP systems I guess.   
   We have interpreters and compilers:   
      
   Interpreters: Prolog text is executed interpreted, examples   
      Jekejeke Prolog, or SWI-Prolog (SWI-Prolog is like 20%-40%   
      faster than Jekejeke Prolog)   
   Compilers: Prolog text is first compiled and then executed,   
      examples SICStus Prolog, in fact SICStus Prolog allows   
      even mixed code.   
      
   Now what are the plans here? How might we beat maxima or   
   some other system nevertheless performance wise in the future.   
      
   Well this is a research prototype that started December 2016,   
   so its only a few months old. So what is the agenda:   
      
   Phase I: Interpreters   
   a) meta-interpreter running on an interpreter without a module   
     system, to realize single dispatch   
   b) meta-interpreter running on an interpreter with a module   
     system, to realize single dispatch.   
   c) single dispatch realized as special bips (Built-In Predicates)   
     for the interpreter   
      
   Phase II: Compilers   
   a) meta-interpreter running on a compiler without a module   
     system, to realize single dispatch   
   b) meta-interpreter running on a compiler with a module   
     system, to realize single dispatch.   
   c) single dispatch realized as special generate code   
      fo the compiler   
      
   At the moment I have already reached phase I)b), this was the   
   milestone from december 2016. So 3 years is a long time, we might   
   go all the way from phase I)b) to phase II)c), and then beat maxima.   
      
   Usually Prolog compilers are like 10-100 faster than Prolog interpreters.   
   So far I am only doing my tests with a Prolog interpreter, since   
   I don't have yet layed hands on a Prolog compiler with   
   a module system.   
      
   As I already wrote, there is a lot of head room.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)   

[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]


(c) 1994,  bbs@darkrealms.ca