From section 1.2 of Aldor Users Guide

• http://www.aldor.org/docs/HTML/chap1.html

sieve.as

A prime number sieve to count primes <= n.

# include "axiom.as"

import from Boolean, Integer, NonNegativeInteger;

sieve(n: Integer): Integer  == {
        isprime: OneDimensionalArray Boolean := new(n::NonNegativeInteger, true);

        np:Integer := 0;
        for p in 2..n | isprime p repeat {
                np := np + 1;
                for i in (p+p)..n by p repeat isprime i := false;
        }
        np
}

   Compiling FriCAS source code from file 
      /var/zope2/var/LatexWiki/8473420842059482192-25px001.as using 
      AXIOM-XL compiler and options 
-O -Fasy -Fao -Flsp -laxiom -Mno-ALDOR_W_WillObsolete -DAxiom -Y $AXIOM/algebra -I $AXIOM/algebra
      Use the system command )set compiler args to change these 
      options.
   Compiling Lisp source code from file 
      ./8473420842059482192-25px001.lsp
   Issuing )library command for 8473420842059482192-25px001
   Reading /var/zope2/var/LatexWiki/8473420842059482192-25px001.asy

-- Old GCL version use:
--)lisp (si::allocate-contiguous-pages 1500 t)
--)lisp (si::allocate 'sfun 50 t)

for i in 1..4 repeat
        n := 10^i
        outputList ["There are ", sieve n, " primes <= ", n]

   There are 4 primes <= 10
   There are 25 primes <= 100
   There are 168 primes <= 1000
   There are 1229 primes <= 10000

Type: Void

To run this program on your own computer you need linux and Axiom+Aldor from AxiomBinaries.

1. Save the program source as a file called 'sieve.as':

     $ vi sieve.as
   

2. Start Axiom:

     $ AXIOMsys
   

3. Compile the program:

     (1) -> )compile sieve.as
   

4. Run it:

       for i in 1..6 repeat ( _
           n := 10^i; _
           outputList ["There are ", sieve n, " primes <= ", n] _
       )