<< cu-Prolog第三版 関数一覧 >> 関数・マクロのアルファベット順の一覧である。 関数エントリ モジュール #define ARG_EQ #define ARG_FALSE #define ARG_TRUE #define ATOMIC_TYPE #define Arg(T,N) #define Arg1(T) #define Arg2(T) #define Arg3(T) #define BACKTRACK #define BL #define BL #define BL #define BR #define BR #define BR #define BRACKET #define CATMAX #define CHEAP_SIZE #define CLAUSE_TYPE #define CM #define CM #define CM #define CO #define CO #define CO #define COMMA #define COMPONENT_CHECKED #define CONSTANT_TERM #define CONST_LIST_TYPE #define CONST_MARK #define COPYRIGHT #define CPUTIME #define CT #define CT #define CT #define CTnormal #define CTnotrace #define CTstep #define C_BLINK #define C_CLS #define C_HIGHLIGHT #define C_LOAD #define C_NORMAL #define C_REVERSE #define C_SAVE #define C_UNDER #define CatSet #define CatSingle #define CnstMax #define Component(F,N) struct term *CtoL(nbuf,flag) #define DEBUG #define DEBUG #define DEBUG #define DEBUG #define DEBUG #define DERIVATION #define DOWN #define DUMMY_DEF #define Def1(F,N,A,P) #define Def1Red(F,N,A,P) #define Def2(F,N,A,P) #define Def2Red(F,N,A,P) #define Defatom(T,N) #define Deftemp(F,N,A) #define ECLAUSE_TYPE #define ESP_SIZE #define ETERNAL #define EXTRACT #define FALSE #define FALSE_REGISTERED #define FILE_POINTER #define FILE_TYPE #define FINITEFUN #define FLOAT_NUM #define FLT_EPSILON #define FROM_CONC #define FROM_CONC #define FROM_NAME #define FROM_NAME #define FULLSTOP #define FX #define FY #define HASH_SIZE #define HEAP_SIZE #define INFIX #define INPUT #define INT_NUM #define Is_Leap #define Is_Modular #define Is_Msolvable #define Is_Normaltrace #define Is_Notrace #define Is_Steptrace #define Is_Trace #define Is_ctnormal #define Is_ctnotrace #define Is_ctstep #define KEYIN #define LC #define LC #define LC #define LIST_TYPE #define Leap_mode int Llevel(t,e,nv) void LtoC(t,e,pos,flag) void LtoP(t,e,tt,depth) #define MAIN #define MEDIUM #define MEMORY_ALLOC(X,Y,F) #define MODULAR_DEFINED #define Modmax_def #define Modular_mode #define Msolvable_mode #define N #define N #define N #define NAME #define NAME_MAX #define NAME_SIZE #define NEW #define NEWPRED #define NL #define NOEXTRACT #define NONFUNC #define NON_UNFOLDABLE #define NOREDUCED_CLAUSE #define NOT_CONSTANT_TERM #define NUMBER struct clause *Nclause(head,body,flag) struct cset *Ncset(flag) struct eclause *Neclause(val,env,tail,flag) struct pair *Nenv(n) struct node *Newnode(goal,icons,env,nlink,nlast) struct term *Nfile(x) struct func *Nfunc(ftype,n,a) struct clause *Nlist(head,body,flag) struct term *Nnum(nbuf,flag) struct term *Nnum_val(x,flag) #define Normal #define Normaltrace_mode #define Notrace_mode struct pst *Npst(flag) struct term *Npst_item(p,pobj,next) #define Npstobj(Head,Env,Tail,Flag) #define Npstobj(Head,Env,Tail,Flag) #define Npstobj(Head,Env,Tail,Flag) struct term *Nstr(x,flag) struct term *Nterm(n,flag) struct term *Nvar(nbuf,flag) #define OUTPUT void PCat(t,e,f) #define POSTFIX #define PRED_IN_LINE #define PREFIX #define PST_ITEM_TYPE #define PST_TYPE void P_csnumber(cs,mode) void P_dclause(cl,e) void P_hclause(cl,e) void P_hclause_sub(cl,e) void P_status() void P_var(vlist) int Panswer(root,vlist) void Pbinding(vlist,env) void Pcahc_core(c,cst,e) void Pclause(c,e) void Pclause_core(c,e) void Pcmp(cmp) void Pcset_cstr(cs) void Pcset_def(cs) void Peclause(ec) void Peclause_core(ec,d) void Penergy(cl) void Pfunctor(t,e,d) void Pgoal(n) void Ppst(t,e,d) void Ppst_content(ptt,d) void Ppst_content2(ptt,env,d) #define Pred(T) struct func *Predicate(fname,arity) #define Predname(T) void Psequence(t,e,d) void Psubcat(t,e) void Pterm(t,e) void Pterm_core(t,e,d) struct clause *PtoL(t) void Ptree(t,e) void Pvar(t,n) void Pvariant(va) void Pvpair(va) #define Q #define Q #define Q #define REDUCEDFUN #define REDUCED_DEF #define REFMAX #define REGISTERED #define REMOVED struct term *Rlist(flag) struct term *Rpst(flag) struct term *Rterm(n,flag) struct term *Rterm_half(n,flag,m) struct term *Rterm_leftover(n,m,flag,t) int Rtoken() #define SAFE #define SG #define SG #define SG #define SHEAP_SIZE #define SP #define SP #define SP #define SPECIFIED #define SPYFUN #define STAY_IF #define STAY_IF_FALSE_PRED #define STAY_IF_TRUE_PRED #define STB(F) #define STE #define STINGY #define STRING #define SUSPEND #define SYSFAIL #define SYSFUN #define SYSNO #define SYSPRED #define SYSTRUE void Showfunc(f) void Showhorn(c,cst,e) void Shownewfunc() #define Steptrace_mode #define TB #define TE #define TEMPFUN #define TEMPORAL #define TEMPORAL_DEFINED #define TNTB #define TNTE #define TREEMAX #define TRUE #define TSTB #define TSTE #define TTB #define TTE #define TYPE1SYS #define TYPE1SYS_REDUCED #define TYPE2SYS #define TYPE2SYS_REDUCED #define Termalloc(a) #define Termalloc(a) void Trace_Answer(root) void Trace_False(n) void Trace_False2(n) int Trace_Goal(n) void Trace_True(n) void Trace_True2(n) void Trace_Unification(n,s) #define UC #define UC #define UC #define UL #define UL #define UL #define UNIT_DEFINED #define UNSAFE #define UNTOUCHED #define UP #define USERFUN #define USTACK_SIZE #define VACUITY_NOCHECK #define VARNAME #define VAR_GLOBAL_TYPE #define VAR_PST_TYPE #define VAR_VOID_TYPE #define VERSION #define VMAX #define XF #define XFX #define XFY #define YF #define YFX void abandon_transformation() int abolish_pred(t,e) int abomb_pred(t,e) void add_clause(c,vlist,anum) void add_component_pst(f,a,ec) void add_cs_to_set(cs,flag) void add_label(f,a,l,flag) void add_set(s,flag) void add_to_set() void addpst(t,e) void adv() #define advance int alldigit(c) int *alloc(n) void allspy(n) #define alpha #define alphabet(CH) int app_str(x,y,z,ez) int apply(target,head,rest,anum) int apply_add_clause(head,e0,ec) int arg_pred(t,e) int arg_type(a) int assert_pred(t,e) int assertz_pred(t,e) #define atomic_equal(u,t) void attach(c,vl,anum) void attach_arg(arg,c,vl) int attach_pred(t,e,n,m,status) struct node *backtrack_node(n) #define bracket(C) int calc_1(x,y,z,e,op) int calc_2(x,z,y,e,op) void calc_all_var(f) void calc_component() int calc_pred(t,e,op) int *challoc(n) int check(c) int check_INITDEF() void check_all_unit(fl) void check_constant_term(t) int check_modularity(cst) void check_recursion() void check_unitpred(f) int clause_pred(t,e,n,status) void clear_predicate(f) void clear_up_DEF() int close_pred(t,e) int cmp_clause(a1,a2) int cmp_cplxt(a1,a2) int cmp_flt(a1,a2) int cmp_fp(a1,a2) int cmp_int(a1,a2) int cmp_label(l1,l2) int cmp_list(a1,a2) int cmp_pst(a1,a2) int cmp_str(a1,a2) int cmp_var(a1,a2) int cname_pred(t,e,nn) #define cnew(s) struct term *cnlistmake(n) int compare_pred(t,e) #define component_checked(F) #define component_not_checked(F) struct clause *compress_clause(cst) int concat2_pred(t,e) int concat_pred(t,e,n,status) struct clause *convert_list_to_clause(t,e,tt,ee,p,emsg) struct term *copy_arg(t,i,flag) struct clause *copy_clause(cl,flag) struct term *copy_pst(pt,flag) struct term *copy_term(t,flag) int count_pred(t,e) int cs_status_type(st) int cu(t,e) int cunify_pred(t,e) int cut_pred(t,e,n) int decode_pname(fname) void decrement_vacuous(t) int default_pred(t,e) void defclause() void defnewfunc() void defsyspred() void delete_constraint(vl) void delete_tmp() #define delimitchar(C) int diff_str(x,z,y,e,first) void disp_func_def(f_from,f_to) void divide_consts(cl) int divstr_pred(t,e) #define down(p,t,e) struct pair *ealloc(n) struct eclause *eclause_append(head,tail) struct eclause *eclause_conc(ec1,ec2) void edit_predicate() void end_unfoldfold() int energy(tm) struct pair *env(t,e) int eq_pred(t,e) int eq_pred_sub(x,y,ex,ey) int equal_pred(t,e) int equalpred(t1,e1,t2,e2) void error(s) void error_detail(t,e,s) struct func *exist_fname(fname) struct term *exist_termpair(t) struct term *exist_vpair(t) struct node *extend(n,status) int extend_apply(target,head,rest,e0,f,s) int fail_pred(t,e) int file_open_pred(t,e,openmode) #define filep_value(Term) void filewrite(n) struct pst_item *find_pstitem(t,e) #define finitefun(F) int firsthalf(h,w) int foldunfold() void freeheap() struct cset *from_to(s1,s2) #define funcalloc(a) #define funcalloc(a) struct func *funcsearch(fname,arity) int functor_pred(t,e) void garbagecollect() void general_assert(t,e,flag) int gensym_pred(t,e) int geq_pred(t,e) int greater_arg(a1,a2) int greater_pred(t,e) int greater_term(t1,t2) int halt_pred(t,e) int has_common_label(ec,cm) int has_no_pst(t) int has_no_var(t) int hash(fname) int have_nextgoal(n) #define head_of_list(Term) void helpmenu() #define in_cheap(X) #define in_sheap(X) #define in_upper_heap(X,Y) void index_func(fnew) void index_funclist(flist) struct itrace *index_newflist(fl,it) void index_op(f,type,prec) void index_set(chead,con,flag) void init_atoms() void init_category() void init_froles() void init_heap_max() void init_operator() void init_pp() struct set *init_set(n) void init_status() void init_syspred() void init_system_component(f,a) void init_unfoldfold() struct clause *insert_clause(ct,cl) void insert_cs(cs,newcs) struct eclause *insert_pstobj(val,tail,flag) #define is_atomic(Term) int is_body_finite(f) #define is_clause(Term) #define is_component_checked(F) #define is_component_not_checked(F) #define is_dead(n) #define is_eclause(Term) #define is_file(Term) #define is_funcsys(F) #define is_functor(Term) #define is_int(Term) #define is_list(Term) #define is_lower(CH) int is_modular_clause(cl) int is_modular_head(t) int is_modular_literal(t) #define is_nofuncsys(F) #define is_num(Term) #define is_pst(Term) #define is_pstitem(Term) #define is_readable(FP) #define is_root(n) #define is_string(Term) int is_term_end(c) #define is_tip(n) #define is_unitclause(Set) #define is_varname(X) #define is_voidvar(t) #define is_writable(FP) #define isallunit(F) #define isatom(Term) #define isconst(Term) #define isconst_functor(Term) #define isconst_list(L) #define isdigit(X) #define isfinite(F) #define isfunc(F) #define isnewpred(F) #define isnonfunc(F) #define isnoreduced(F) #define isnospy(F) #define isnotnewpred(F) int isop_pred(t,e,n,status) #define isrecursive(F) #define isreduced(F) #define isspy(F) #define issystem(F) #define isuser(F) #define isvar(t) #define isxdigit(X) #define kanzi(CH) #define kanzi(CH) int keyread(a) int leq_pred(t,e) int less_pred(t,e) void list_to_cat(t0,n) struct clause *list_to_clause(t,e) int literalnumber(c) void loghandle(fname) void main(argc,argv) int make_func(f,a,t,e) int makelist_pred(t,e) void mark_component_checked_all() int match(clo,clt,e) int match_func(t,e,f,ef,a,ea) void match_term(t1,t2,e) #define mediterm(a) #define mediterm(a) int memb_pred(t,e,n,status) struct component *merge_component(ca,cb,flag) struct eclause *merge_pst_objects(target,e,object,f,safeflag) void modular(c,vlist,anum) struct clause *modular_form(clist,vlist,anum) int multiply_pred(t,e) char *nalloc(n,flag) int name_pred(t,e) #define new(s) struct clause *new_constraint(cmp) struct clause *new_pred_set(cc) #define newpred(F) void next() struct node *next_goal(m,oldnode,btnode) int nl_pred(t,e) #define nospyfun(F) int not_pred(t,e) #define notconst(Term) #define notconst_list(L) #define novar(Term) struct cset *nth_cset(n) struct clause *nth_literal(cl,n) int null_or_nil(t,e) #define num_value(Term) int numcomp_pred(t,e,op) #define numeric(X) void ocheck(p,t,e) void oldlink(n) void on_interrupt() struct set *one_def_literal(f) int op_pred(t,e) struct operator *op_search(fname,otype) int open_pred(t,e) void open_title() int or_pred(t,e,n,m,status) void oscommand() int pcon_pred(t,e,n) int pickname(t,e) int pnames_pred(t,e) int pp_number(ec) int pred_compare(f1,f2) int prefix_is_atom(m) void prepare() void preprocess_all_unit(fl,flag) void preprocess_constr_sub(flag) void preprocess_constraints(fn) void preprocess_unit(f,flag) void print_ancestors(n) void print_constant() void print_hash_table() void print_pp(d) void printtime() void printtime() void printtime() struct node *proceed_node(n,btnode) void prolog_execution() void pst_add_unify(t,e,u,f) void pst_add_unify_sub(entry,ol,e) void pst_unify(t,e,u,f,safeflag) void push_log(oldt,oldenv,newt) void push_pstlog(oldt,oldenv,newt) void putcursor() int pvalue_pred(t,e) void quit_prolog() void quit_transformation() int quote_needed(f) #define quotesign void read_comments() void read_digits(i) void read_hexa(i) int read_pred(t,e) void read_spechar(i) void readfile() #define readword(S) void rec_to_finite() void recalc_component() void recalc_voccur_sub(t,v) void recalc_voccurrence(cl,v) struct eclause *record_pstlists(ptt,e) struct pst_item *record_pstobjects(t,e) #define recursivefun(F) struct eclause *reduce_clause(cl,e) struct eclause *reduce_clause_m(cl,e) struct clause *reduce_cstr(cst,vlist,anum,env) struct clause *reduce_substitute(cst,e) #define reducedfun(F) int refute(Root,n,Status) void remove_from_CSTR(f) struct clause *remove_modular_literals(cl) struct pst_item *remove_pstitem(t,e) void rename_var_names(v) void renum_pvars(pvs,vnum) struct clause *reorder(cl,tc) void reorder_clause(cl,tc) void replace_terms(c1,c2,vl) void reset_component() int reset_timer_pred(t,e) void reset_voccurrence(v) int resolve(n0,n,sliteral,env) int retract_pred(t,e,n,status) void safe_unify(t,e,u,f,extflag) int *salloc(n) int satisfiable(cl,anum) void scanpst_clause(t,e) void scanpst_eclause(ec) void scanpst_functor(t,e) void scanpst_term(t,e) struct term *search_log(t,e) struct term *search_pstlog(t,e) int see_pred(t,e) int seen_pred(t,e) void set_body_component(ff) void set_category() void set_eof() void set_head_component(f) void set_inputfile(n) void set_new_def(c,vl,anum) void set_temporal_def(f) struct set *setconcat(slist,s) void settimer() void settimer() void settimer() void show_category() void show_heap_max() void show_newdefs() void show_pred_def(f) void show_pred_roles(f) void show_syspred_name() void show_syspred_status(f) void show_userpred_name() void showdef(fname) void showvar(v) int skip(c) void skip_cr() #define skipline #define snew(s) struct clause *sort_clause(cl) #define specialchar(C) struct compartment *split(clist,vlist,anum) #define spychange(F) #define spyfun(F) void spyswitch(fname) struct clause *startmodular(clist,vlist,anum) int stay_pred(t,e) int step_asking() void stepswitch() void store_termpair(told,tnew) void store_vpair(told,tnew) #define str_value(Term) int strcmp_pred(t,e) #define streq(p,q) int strlen_pred(t,e) int substr_pred(t,e) int subsume(t,e,u,f,flag) int subsume_pst(t,e,u,f,flag) int subsume_pstlist(x,y,e,flag) int sum_pred(t,e) struct clause *surface_copy_clause(cl,flag) int system_function(t,e,n) int system_pred(t,e,n,m,status) void systemcommand(c) int tab_pred(t,e) #define tail_of_list(Term) struct clause *target_literal(cl) struct clause *target_literal(cl) int tell_pred(t,e) #define tempterm(a) #define tempterm(a) char *termname(t,e) int termnumber(t) struct term *termset(t,e,flag) struct eclause *termset_pstobj(pobj,flag) struct eclause *termset_pstobj_sub(pobj,e,flag) int timer_pred(t,e) int told_pred(t,e) struct term *tolist(c,flag) #define tprint0(X) #define tprint1(X,V) #define tprint2(X,V1,V2) #define tprint3(X,V1,V2,V3) #define tprint4(X,V1,V2,V3,V4) #define tputc(X) void traceswitch() void trans_routine() struct eclause *transform(precond,newc,newenv) int tree_pred(t,e) void treeprint(t,e,n) int true_pred(t,e,n,status) void truncate_varname(n,nbuf) struct term *try_fold(c,n) int tunify(t,e,u,f,flag) int type_pred(t,e) int unbreak_pred(t,e) void undo(u) void unfold_cstr(cs) void unfold_derivation(cs) void unify(t,e,u,f) void unify_merge_psts(target,object,safeflag) void unify_pst_extract(t,e,u,f) void unify_pstlist_objects(entry,ol,e,safeflag) struct term *up_atomic(t,flag) struct term *up_const(t,flag) struct term *up_const_functor(t,flag) struct clause *up_eclause(ec,flag) void up_init() struct clause *up_itrace_clause(cl,anum) struct term *up_pst(pt,e,flag) void up_restore() void upush(p) #define userfun(F) int var_pred(t,e) struct term *var_trans(v,flag) struct variant *variant(cl,flag) struct variant *variant_v(cl,flag) struct term *varsearch(varname) #define vcomponent(t) #define vconstraint(t) #define vdecrement(t) #define vheadoccurrence(t) #define vincrement(t) #define vlink(t) #define vname(t) #define vnumber(t) #define voccurrence(t) int vpair_length(vp) #define white int write_pred(t,e) void writenewfunc() --------------