Sindbad~EG File Manager

Current Path : /usr/home/beeson/MathXpert/
Upload File :
Current File : /usr/home/beeson/MathXpert/proverdl.h

/* functions exported by prover.dll */
/*_____________________________________________________________________*/
typedef struct a
   { term prop;       /* proposition being assumed */
     int line;         /* line number at which the assumption was made */
     struct a *link;   /* link to previous form of this assumption */
   } assumption;

typedef int (*eqnsolver)(term,term,term *);
eqnsolver get_solver(void);  /* returns the current equation-solver */
                          /* this function is not exported       */

typedef struct
  { assumption **assumptions;
    short maxassumptions;
    short nextassumption;
    term *theorems;
    short maxtheorems;
    short nexttheorem;
    term *history;
    unsigned long *permhistory;   /* values of nextperm as a function of the
                             line number; used by undo(). This array,
                             like history, has dimension maxhistory. */
    unsigned maxhistory;
    /* but currentline is maintained by var.dll */
    unsigned long *workspace;  /* empty space to use for allocating assumptions */
    unsigned long  maxworkspace; /* dimension of workspace. An unsigned long
                            because when workspace is allocated, this
                            value is multiplied by sizeof(long), and I don't
                            want to have to worry about casts, and in the
                            future this may well grow past 64K anyway. */

    unsigned long nextworkspace; /* how much workspace is used at present */

    eqnsolver solver;    /* equation-solving function    */
  }  proverdata;


short get_nextassumption(void);
void set_nextassumption(short);
term get_assumption(int);
assumption **get_assumptions(void);
void replace_assumption(int, term);
int simplify_assumptions(term);
term *get_theorems(void);
short get_nexttheorem(void);
term history(int);
void set_history(int,term);
term *historyp(int);
int immediate(term);  /* prover.c; called also in redineq.c */
term codomain(term);
int unwind(term t, term *next);
void init_constraints(void);
void push_assumption(term, int);
void pop_assumption(int);
unsigned long get_nextperm(void);
void reset_nextperm(unsigned long);
int get_lpt_defnflag(void);
void set_lpt_defnflag(int);
int get_lpt_binderflag(void);
void set_lpt_binderflag(int);
void clear_already(term *);

Sindbad File Manager Version 1.0, Coded By Sindbad EG ~ The Terrorists