MATHS INVOLVED:
===============

1) bivariate factorization (over Z, F_p, C). Preliminary ?

2) BSD package ( analytic rank + rank 1 Heegner + Sha ? ) --> J.Cremona 
2p) p-adic BSD package ( analytic rank + rank 1 Heegner + Sha ? ) 

3) "formal polynomials" with indeterminate degree [ e.g X^k ] (???)

4) Dedekind zeta rewritten

5) extended benchmark [ make test-all ]
   interesting bnfs ?

6) multiple zeta values [ ask for Zagier's script ]

7) S-units (and other algebraic numbers) in compact representation if
available.

8) finish PSLQ (Level 2) = algdep, lindep ... [ over R ]

9) ell. curves over number fields (conductor, heights...)

10) add examples to documentation (GP)

10') ideas for the tutorial ?


PURELY TECHNICAL:
=================

1)  GP history * readline history
               * dump / restore a GP session
2)  interface to NTL (Shoup's C++ Number Theoretic Library) under GP
[ B. Allombert ]. Polynomial arithmetic + LLL.
3)  more generally, set of documented hooks to interface PARI (GP?) with
other libraries/packages
4)  fix up headers to minimize namespace conflicts
5)  install() easier to use [ using description system, install code preloaded ]
6)  loading extra contributed packages
7)  Z[K] (???)
8) optional package "elldata" [ as galdata ]
9) optional package "bnfdata" [ as galdata ]

============

1) function names (rename completely, consistency)
2) document precisely what is in which file. Rename if needed.
3) modularization [ level3 ] --> wrappers.
   cgetg(n, t_MAT) --> makemat