Artifact d726f845fae670a84d255c1db0994bbd4f986441495305082a6b7f3e7e8fe456:
- Executable file
r38/packages/redlog/redlog.red
— part of check-in
[f2fda60abd]
at
2011-09-02 18:13:33
on branch master
— Some historical releases purely for archival purposes
git-svn-id: https://svn.code.sf.net/p/reduce-algebra/code/trunk/historical@1375 2bfe0521-f11c-4a00-b80e-6202646ff360 (user: arthurcnorman@users.sourceforge.net, size: 27328) [annotate] [blame] [check-ins using] [more...]
% ---------------------------------------------------------------------- % $Id: redlog.red,v 1.24 2003/11/11 15:08:19 sturm Exp $ % ---------------------------------------------------------------------- % Copyright (c) 1995-2003 Andreas Dolzmann and Thomas Sturm % ---------------------------------------------------------------------- % $Log: redlog.red,v $ % Revision 1.24 2003/11/11 15:08:19 sturm % Added fluid declaration for fancy printing. % % Revision 1.23 2003/10/27 14:32:25 gilch % Renamed rlrqtfcplit to rlhqetfcsplit. % Renamed rlrqtfcfullsplit to rlhqetfcfullsplit. % Renamed rlrqtfcfast to rlhqetfcfast. % Renamed rlrqvb to rlhqevb. % Renamed rlrqvarsel to rlhqevarsel. % Renamed rlrqvarselx to rlhqevarselx. % Renamed rlrqdim0 to rlhqedim0. % Renamed rlrqtheory to rlhqetheory. % Renamed rlrqgbred to rlhqegbred. % Renamed rlrqconnect to rlhqeconnect. % Renamed rlrqstrconst to rlhqestrconst. % Renamed gbdimmin to rlhqegbdimmin. % % Revision 1.22 2003/10/21 15:22:31 gilch % Added switches for type formual computation. % Added switches for HQE. % % Revision 1.21 2003/10/12 19:41:14 sturm % Introduced rl_texmacs. The test "if get('or,'fancy!-infix!-symbol) = 218" % does not work in general since Windows does not guarantee to load % fmprint at startup. % % Revision 1.20 2003/08/21 14:46:38 seidl % Fancy printing for bounded quantifiers (for TeXmacs). % % Revision 1.19 2003/07/08 13:34:23 sturm % Added support for TeXmacs. % % Revision 1.18 2003/06/03 15:40:33 seidl % Added case for bounded quantifiers to rl_cxp. % % Revision 1.17 2003/03/27 22:54:35 seidl % Introduced bounded quantifiers ball and bex. Added access function % rl_b, constructor rl_mkbq, predicate rl_bquap. % % Revision 1.16 2003/01/30 12:27:05 sturm % Renamed switch vmatverbose to rlvmatvb and moved switch and fluid % declarations to where they belong. % % Revision 1.15 2003/01/29 11:34:45 sturm % Moved determinant code to from module ofsfcadproj to new module ofsfdet. % % Revision 1.14 2003/01/13 10:01:10 dolzmann % Added entry points for xopt. % % Revision 1.13 2003/01/11 16:39:04 sturm % Switch rlcadverbose on by default. % % Revision 1.12 2002/05/28 13:22:00 sturm % Added black box rl_fbqe() and corresponding switch rlqefb. % That is, for ofsf, rlqe uses rlcad in case of failure now. % % Revision 1.11 2002/05/28 13:12:23 seidla % Added switches rlcadpreponly, rlcadte and rlcadpbfvs, changed default for % switch rlcadaproj to off. % % Revision 1.10 2002/01/25 14:42:36 sturm % Added switch rlcaddecdeg, off by default. % % Revision 1.9 2002/01/18 15:37:34 seidla % Default value for switch rlcadpartial set to ON. Removed unused % switches rlallp and rlanuex. Added switch rlcaddnfformula. % % Revision 1.8 2002/01/16 13:04:02 seidla % Imported CAD from rlprojects. % % Revision 1.7 1999/09/22 13:02:12 dolzmann % Added switch definitions for the ofsf part of susi. % % Revision 1.6 1999/03/23 12:26:37 sturm % Renamed switch rlsisqf to rlsiatadv. % % Revision 1.5 1999/03/23 09:23:41 dolzmann % Changed copyright information. % Added list of exported procedures. % % Revision 1.4 1999/03/21 13:38:51 dolzmann % Added switch rlsusi. % % Revision 1.3 1999/03/18 14:08:22 sturm % Added new service rl_specelim!* in cl_qe for covering the "super % quadratic special case' for ofsf. This method is toggled by switch % rlsqsc, which is off by default. Context dvfsf uses cl_specelim which % is constantly "false." Context acfsf does not use cl_qe at all. % % Revision 1.2 1998/04/09 11:00:09 sturm % Added switch rlqeqsc for quadratic special case. This now OFF by default! % % Revision 1.1 1997/08/18 14:51:10 sturm % Renamed "rl.red" to this file "redlog.red". % Adapted created!-package. % % ---------------------------------------------------------------------- % Revision 1.15 1997/08/12 17:03:51 sturm % Fixed fancy printing for Xr and PC versions. % % Revision 1.14 1996/10/23 11:28:08 dolzmann % Added switch rlqevarsel and corresponding code. % % Revision 1.13 1996/10/20 15:55:07 sturm % Added switches rlnzden, rlposden, and rladdcond and corresponding code % handling the input of reciprocal terms. % % Revision 1.12 1996/10/08 13:54:52 dolzmann % Renamed "degree parity decomposition" to "parity decomposition". % Adapted names of procedures and switches accordingly. % % Revision 1.11 1996/10/08 13:01:26 dolzmann % Removed switch rltabcb. % % Revision 1.10 1996/10/01 10:25:17 reiske % Introduced new service rltnf and related code. % % Revision 1.9 1996/09/29 14:21:25 sturm % Removed switch rlqeans. Introduced service rlqea instead. % Also introduced corresponding service rlgqea. % % Revision 1.8 1996/09/05 11:16:37 dolzmann % Introduced new switch !*rlqegenct. % Turned on rlsiexpla by default. % Introduced property cleanupfn on the internal service procedure identifier. % % Revision 1.7 1996/07/13 11:22:22 dolzmann % Introduced new switches rlgsbnf and rlgsutord with default values. % % Revision 1.6 1996/07/08 07:18:42 sturm % ex, all, and !*fof are no longer operators. Consequently, the number % of arguments of ex and all is checked now. % % Revision 1.5 1996/07/02 15:12:21 sturm % Fixed a bug in length computation. % % Revision 1.4 1996/06/24 09:11:44 sturm % Put 'lengthfn to rtype 'logical instead of tag '!*fof. % % Revision 1.3 1996/06/05 15:10:42 sturm % Turned off rlsimpl and rlsiexpla by default. % Changed the subfn of the rtype logical to rl_sub!*fof. % % Revision 1.2 1996/05/12 08:28:07 sturm % Introduced new switches rldavgcd and rlsitsqspl. % % Revision 1.1 1996/03/22 12:18:24 sturm % Moved and split. % % Revision 1.23 1996/03/18 15:47:20 sturm % Added service rlatml. % Made rl_simp apply rl_simpl in dependence on the switch rlsimpl. % Changed rl_reval to avoid double simplification. % Removed rl_aeval. % Major changes in the treatment of switches. Moved default declarations % from context files to here. % Major changes in rl_set. % Removed treatment of several context properties: rl_enterargnum, % rl_me2tag, rl_tag2me. % The for loop actions "mkand" and "mkor" flatten the top-level now. % Moved rl operator classification predicates from module cl to here. % Rewritten rl_prepfof1, rl_resimp. % Changed context conversion in rl_simp!*fof. % Added macros rl_mkbb: black boxes are introduced by this now. % Added macro rl_mkserv replacing smacro rl_mkinterf. Major changes in % AM-SM paramter passing routines. % Changed data-driven code for internal representations. Introduced % "rl_"-properties on the context tag: rl_lengthat, rl_resimpat, and % rl_prepat, rl_prepterm, rl_simpterm. % % Revision 1.22 1996/03/11 13:19:03 reiske % Added black boxes fctrat and tordp. % Added interface for rlapnf and rlifacl. % % Revision 1.21 1996/03/10 13:04:09 sturm % Added switch rlqeheu. % Added interface for rlmatrix. % % Revision 1.20 1996/03/10 12:48:34 dolzmann % Added new switch !*rlgsvb. % % Revision 1.19 1996/03/09 13:37:01 sturm % Added switch rlqesr. % Renamed fluid rl_tag!* to rl_cid!*, removed fluid rl_ctag!*. % Moved rl_updcache1 to rl_updcache. % Moved the black boxes from module cl to here changing the "cl_" % prefixes into "rl_". % Moved the constructors/access functions from module cl to here % renaming them as follows: % cl_op -> rl_op % cl_arg1 -> rl_arg1 % cl_arg2l -> rl_arg2l % cl_arg2r -> rl_arg2r % cl_argn -> rl_argn % cl_var -> rl_var % cl_mat -> rl_mat % cl_constr1 -> rl_mk1 % cl_constr2 -> rl_mk2 % cl_constrn -> rl_mkn % cl_sconstrn -> rl_smkn % cl_constrq -> rl_mkq % Overworked structuring into submodules. % Added primitive support for a subfn. % % Revision 1.18 1996/03/04 17:14:14 sturm % Moved the treatment of the switch !*rlsimpl to rl_mk!*fof and % rl_prepfof. Turned off !*rlrealtime temporarily for the call to % rl_simpl. % % Revision 1.17 1996/03/04 13:09:39 dolzmann % Added switch !*rlbnfsac. % Removed switch !*rlbnfsb. % % Revision 1.16 1996/02/26 12:51:38 sturm % Fixed bugs in rl_updcache1 and rl_mkinterf. % % Revision 1.15 1996/02/18 14:07:41 sturm % Added switches rlsifac and rlqegsd. % Removed switch rlqesdnf. % Added optional theory to rlqe. Modified rl_qe!-s2a accordingly. % Made rlatl available in the AM. % % Revision 1.14 1996/02/18 12:42:52 dolzmann % Fixed a bug in rl_simp. % Added optional parameters to rlgsc, rlgsd, and rlgsn. % Added switch rlgserf. % % Revision 1.13 1995/11/16 08:12:14 sturm % Added switch rlsimpl and respective code. % Added primitive support for Xr. % Rewritten rl_simpq: Variable lists as first argument are possible now. % Added module rlfor implementing mkand and mkor actions in for-loops. % Added an optional parameter to the interface for rlex and rlall. % % Revision 1.12 1995/10/18 10:17:59 sturm % Added switches rlbnfsb and rlbnfsm. % % Revision 1.11 1995/09/05 07:59:02 sturm % Added switches rlqesdnf, rlsipw, rlsipo. % % Revision 1.10 1995/08/31 13:57:32 sturm % Added procedure rl_!*foflength. % Modified rl_mk!*fof for a more consistent AM representation of atomic % formulas. % % Revision 1.9 1995/08/30 07:44:14 sturm % Modified rl_set. It accepts and returns a list now. Added fluid % rl_argl!* for the extra rl_set parameters. % Removed psopfn rl_set from AM. % Fixed rlrealtime to nil in rl_identifyonoff. % % Revision 1.8 1995/08/08 10:22:39 sturm % Removed switch rldev and dependent code. % Renamed rl_ppriand to rl_ppriop. It is now used with all RL infix % operators. % Added rl_prepq. % Fixed a bug in procedure rl_mkinterf1. % Added extra optional argument to rlsimpl. Extended its AM backconversion. % % Revision 1.7 1995/08/03 05:32:52 dolzmann % Added procedure rlgsn. % % Revision 1.6 1995/08/02 07:22:02 sturm % Added fluid rl_deflang!* and default language code. % Added switches rlsiidem and rlsiso. % Changed copyright messages. % % Revision 1.5 1995/07/12 15:11:26 sturm % Added procedure rl_identifyonoff. % % Revision 1.4 1995/07/07 11:29:50 sturm % Removed "_" in switch names and AM interface names. % Added switches rlrealtime, rlopt1s, renamed switch rl_smsimpl to rlsism. % Renamed Groebner simplifiers: rl_gbcsimpl to rlgsc and % rl_gbdsimpl to rlgsd. % Added procedures rl_simpterm, rl_prepterm, and rl_mkterm. % Major changes in module rl3 (AM interface), added realtime code. % % Revision 1.3 1995/06/21 09:04:37 sturm % Removed declarations of non-used local variables. % Commented create!-package out. % Changed qe inteface, added opt and optgen interfaces. % Added switches rl_parallel, rl_qeans, rl_qedfs. % Renamed switches rl_tablib and rl_tablcb to rl_tabib and rl_tabcb resp. % % Revision 1.2 1995/06/01 13:36:37 dolzmann % Renamed switch rl_nocheck to rl_sichk with opposite semantic. % Added switch rl_gsprod. % Moved treatment of SQ's from rl_simpatom to rl_simp. % % Revision 1.1 1995/05/29 14:47:22 sturm % Initial check-in. % % ---------------------------------------------------------------------- lisp << fluid '(rl_rcsid!* rl_copyright!*); rl_rcsid!* := "$Id: redlog.red,v 1.24 2003/11/11 15:08:19 sturm Exp $"; rl_copyright!* := "Copyright (c) 1995-1999 by A. Dolzmann and T. Sturm" >>; module redlog; % Reduce logic component. create!-package('(redlog rlami rlsched rlcont),nil); exports quotelog,rl_mkbb,rl_mkserv,rl_op,rl_arg1,rl_arg2l,rl_arg2r,rl_argn, rl_var,rl_mat,rl_mk1,rl_mk2,rl_mkn,rl_smkn,rl_mkq,rl_quap,rl_junctp,rl_basbp, rl_extbp,rl_boolp,rl_tvalp,rl_cxp,rl_mk!*fof,rl_reval,rl_prepfof,rl_cleanup, rl_simp,rl_simpbop,rl_simpq,rl_simp!*fof,rl_lengthlogical,rl_sub!*fof, rl_print!*fof,rl_priq,rl_ppriop,rl_fancy!-ppriop,rl_fancy!-priq, rl_interf1,rl_a2s!-decdeg1,rl_a2s!-varl,rl_a2s!-number,rl_a2s!-id, rl_a2s!-atl,rl_a2s!-posf,rl_s2a!-simpl,rl_s2a!-gqe,rl_s2a!-gqea,rl_s2a!-qea, rl_s2a!-opt,rl_s2a!-atl,rl_s2a!-ml,rl_s2a!-term,rl_s2a!-decdeg1, rl_a2s!-targfn,rl_a2s!-terml,rl_s2a!-terml,rl_a2s!-term,rl_s2a!-varl, rl_s2a!-fbvarl,rl_s2a!-struct,rlmkor,rlmkand,rl_set!$,rl_set,rl_exit, rl_enter,rl_onp,rl_vonoff,rl_updcache,rl_serviadd,rl_bbiadd; fluid '(rl_cid!* rl_argl!* rl_deflang!* rl_ocswitches!* rl_bbl!* rl_servl!*); fluid '(fancy!-line!* fancy!-pos!*); switch rlsism,rlsichk,rlsiidem,rlsiatadv,rlsipd,rlsiexpl,rlsiexpla,rlsiso, rlsipw,rlsipo,rltabib,rlverbose,rlrealtime,rlidentify,rlgssub,rlgsrad, rlgsred,rlgsprod,rlqepnf,rlqedfs,rlparallel,rlopt1s,rlbrop, rlbnfsm,rlsimpl,rlsifac,rlqegsd,rlgserf,rlbnfsac,rlgsvb,rlqesr,rlqeheu, rldavgcd,rlsitsqspl,rlgsbnf,rlgsutord,rlqegenct,rltnft,rlnzden,rlposden, rladdcond,rlqevarsel,rlqeqsc,rlqesqsc,rlsusi,rlsusimult,rlsusigs,rlsusiadd, rlcadfac,rlcaddnfformula,rlcadprojonly,rlcadpreponly,rlcadbaseonly, rlcadextonly,rlcadverbose,rlcadfasteval,rlcaddebug,rlcadpartial, rlcadfulldimonly,rlcadtrimtree,rlcadrawformula,rlcadisoallroots,rlcadaproj, rlcadaprojalways,rlcadhongproj,rlanuexverbose,rlanuexdifferentroots, rlanuexdebug,rlanuexpsremseq,rlanuexgcdnormalize,rlanuexsgnopt,rlcaddecdeg, rlcadte,rlcadpbfvs,rlqefb,rlxopt,rlxoptsb,rlxoptpl,rlxoptri,rlxoptric, rlxoptses,rlxoptrir,rlourdet,rlvmatvb,rlhqetfcsplit,rlhqetfcfullsplit, rlhqetfcfast,rlhqevb,rlhqevarsel,rlhqevarselx,rlhqedim0,rlhqetheory, rlhqegbred,rlhqeconnect,rlhqestrconst,rlhqegbdimmin; on1 'rlbrop; off1 'rlbnfsm; on1 'rlbnfsac; on1 'rlqepnf; on1 'rlsiso; on1 'rlsiidem; off1 'rlidentify; off1 'rlrealtime; off1 'rlparallel; off1 'rlopt1s; off1 'rlqedfs; off1 'rlverbose; on1 'rlsichk; on1 'rlsism; off1 'rlsipw; on1 'rlsipo; on1 'rltabib; on1 'rlgssub; on1 'rlgsrad; on1 'rlgsred; on1 'rlgserf; off1 'rlgsprod; on1 'rlgsvb; off1 'rlsimpl; on1 'rlsiatadv; on1 'rlsipd; on1 'rlsiexpl; on1 'rlsiexpla; on1 'rlsifac; off1 'rlqesr; on1 'rlqeheu; off1 'rlqegsd; on1 'rldavgcd; on1 'rlsitsqspl; on1 'rlgsbnf; off1 'rlgsutord; on1 'rlqegenct; on1 'rltnft; on1 'rlqevarsel; off1 'rlnzden; off1 'rlposden; off1 'rladdcond; off1 'rlqeqsc; off1 'rlqesqsc; off1 'rlsusi; on1 'rlsusimult; off1 'rlsusigs; on1 'rlsusiadd; on1 'rlcadfac; on1 'rlcaddnfformula; off1 'rlcadpreponly; off1 'rlcadprojonly; off1 'rlcadbaseonly; off1 'rlcadextonly; on1 'rlcadverbose; on1 'rlcadfasteval; off1 'rlcaddebug; on1 'rlcadpartial; off1 'rlcadfulldimonly; on1 'rlcadtrimtree; off1 'rlcadrawformula; off1 'rlcadisoallroots; off1 'rlcadaproj; off1 'rlcadaprojalways; on1 'rlcadhongproj; off1 'rlanuexverbose; on1 'rlanuexdifferentroots; off1 'rlanuexdebug; off1 'rlanuexpsremseq; on1 'rlanuexgcdnormalize; off1 'rlanuexsgnopt; off1 'rlcaddecdeg; on1 'rlcadte; on1 'rlcadpbfvs; on1 'rlqefb; on1 'rlxopt; on1 'rlxoptsb; % select boundary type on1 'rlxoptpl; % passive list on1 'rlxoptri; % result inheritance off1 'rlxoptric; % result inheritance to conatiner off1 'rlxoptrir; % result inheritance to result on1 'rlxoptses; % structural elimination sets. off1 'rlourdet; off1 'rlvmatvb; % Fixied switch, provides debugging within ofsfdet on1 'rlhqetfcsplit; % Splits type formula computation up to degree 4. off1 'rlhqetfcfast; % Splits type formula computation unconditionally. off1 'rlhqetfcfullsplit; % Compute case distinctions only for unknown signs. off1 'rlhqevb; % More verbose output. on1 'rlhqevarsel; % Optimize variable selection in the case dim I=n. on1 'rlhqevarselx; % Advances optimization with more computational effort. on1 'rlhqetheory; % Use initial conditions for CGB computation. off1 'rlhqedim0; % Only zero dimensional branches. off1 'rlhqegbred; % Use reduced Groebner systems. off1 'rlhqeconnect; % Connect branches which differs only in the theory. on1 'rlhqestrconst; % Use combined structure constants. on1 'rlhqegbdimmin; % Choose maximal independent variable set with % minimal cardinality in the case 0<dim<n. put('rlidentify,'simpfg, '((t (rl_identifyonoff t)) (nil (rl_identifyonoff nil)))); procedure quotelog(x); 'logical; procedure rl_texmacsp(); get('tmprint,'package); put('logical,'evfn,'rl_reval); put('logical,'subfn,'rl_sub!*fof); put('logical,'lengthfn,'rl_lengthlogical); put('!*fof,'prifn,'rl_print!*fof); put('!*fof,'fancy!-prifn,'rl_print!*fof); %put('!*fof,'prifn,'prin2!*); put('!*fof,'rtypefn,'quotelog); put('!*fof,'rl_simpfn,'rl_simp!*fof); put('and,'rtypefn,'quotelog); put('and,'rl_simpfn,'rl_simpbop); put('and,'rl_prepfn,'rl_prepbop); put('and,'pprifn,'rl_ppriop); put('and,'fancy!-pprifn,'rl_fancy!-ppriop); put('or,'rtypefn,'quotelog); put('or,'rl_simpfn,'rl_simpbop); put('or,'rl_prepfn,'rl_prepbop); put('or,'pprifn,'rl_ppriop); put('or,'fancy!-pprifn,'rl_fancy!-ppriop); put('not,'rtypefn,'quotelog); put('not,'rl_simpfn,'rl_simpbop); put('not,'rl_prepfn,'rl_prepbop); algebraic infix impl; put('impl,'rtypefn,'quotelog); put('impl,'rl_simpfn,'rl_simpbop); put('impl,'rl_prepfn,'rl_prepbop); put('impl,'number!-of!-args,2); put('impl,'pprifn,'rl_ppriop); if rl_texmacsp() then put('impl,'fancy!-infix!-symbol,"\longrightarrow ") else put('impl,'fancy!-infix!-symbol,222); algebraic infix repl; put('repl,'rtypefn,'quotelog); put('repl,'rl_simpfn,'rl_simpbop); put('repl,'rl_prepfn,'rl_prepbop); put('repl,'number!-of!-args,2); put('repl,'pprifn,'rl_ppriop); if rl_texmacsp() then put('repl,'fancy!-infix!-symbol,"\longleftarrow ") else put('repl,'fancy!-infix!-symbol,220); algebraic infix equiv; put('equiv,'rtypefn,'quotelog); put('equiv,'rl_simpfn,'rl_simpbop); put('equiv,'rl_prepfn,'rl_prepbop); put('equiv,'number!-of!-args,2); put('equiv,'pprifn,'rl_ppriop); if rl_texmacsp() then put('equiv,'fancy!-infix!-symbol,"\longleftrightarrow ") else put('equiv,'fancy!-infix!-symbol,219); flag('(impl repl equiv and or),'spaced); precedence equiv,when; precedence repl,equiv; precedence impl,repl; flag('(true false),'reserved); put('ex,'rtypefn,'quotelog); put('ex,'rl_simpfn,'rl_simpq); put('ex,'number!-of!-args,2); put('ex,'prifn,'rl_priq); put('ex,'rl_prepfn,'rl_prepq); put('ex,'fancy!-prifn,'rl_fancy!-priq); if rl_texmacsp() then put('ex,'fancy!-functionsymbol,"\exists ") else put('ex,'fancy!-functionsymbol,36); put('all,'rtypefn,'quotelog); put('all,'rl_simpfn,'rl_simpq); put('all,'number!-of!-args,2); put('all,'prifn,'rl_priq); put('all,'rl_prepfn,'rl_prepq); put('all,'fancy!-prifn,'rl_fancy!-priq); if rl_texmacsp() then put('all,'fancy!-functionsymbol,"\forall ") else put('all,'fancy!-functionsymbol,34); put('bex,'rtypefn,'quotelog); put('bex,'rl_simpfn,'rl_simpbq); put('bex,'number!-of!-args,3); put('bex,'prifn,'rl_pribq); put('bex,'rl_prepfn,'rl_prepbq); % semms not to be used! %put('bex,'fancy!-functionsymbol,36); put('bex,'fancy!-prifn,'rl_fancy!-pribq); if rl_texmacsp() then put('bex,'fancy!-functionsymbol,"\bigvee ") else put('bex,'fancy!-functionsymbol,36); %%% 36 okay? put('ball,'rtypefn,'quotelog); put('ball,'rl_simpfn,'rl_simpbq); put('ball,'number!-of!-args,3); put('ball,'prifn,'rl_pribq); put('ball,'rl_prepfn,'rl_prepbq); %put('ball,'fancy!-functionsymbol,34); put('ball,'fancy!-prifn,'rl_fancy!-pribq); if rl_texmacsp() then put('ball,'fancy!-functionsymbol,"\bigwedge ") else put('ball,'fancy!-functionsymbol,34); %%% 34 okay? flag('(rl_simpbop rl_simpq rl_simpbq rl_prepbop rl_prepq rl_prepbq),'full); macro procedure rl_mkbb(lst); % Make black box. begin scalar args,vn,name,n,prgn; name := eval cadr lst; n := eval caddr lst; args := for i := 1:n collect mkid('a,i); vn := intern compress nconc(explode name,'(!! !*)); prgn := {'setq,'rl_bbl!*,{'cons,mkquote vn,'rl_bbl!*}} . prgn; prgn := {'put,mkquote name,''number!-of!-args,n} . prgn; prgn := {'de,name,args,{'apply,vn,'list . args}} . prgn; prgn := {'fluid,mkquote {vn}} . prgn; return 'progn . prgn end; macro procedure rl_mkserv(argl); begin scalar bname,evalfnl,oevalfnl,odefl,resconv,amp,len, args,sm,smv,prgn,am,psval; bname := eval nth(argl,2); evalfnl := eval nth(argl,3); oevalfnl := eval nth(argl,4); odefl := eval nth(argl,5); resconv := eval nth(argl,6); amp := eval nth(argl,7); len := length evalfnl + length oevalfnl; args := for i := 1:len collect mkid('a,i); sm := intern compress append('(!r !l !_),explode bname); smv := intern compress nconc(explode sm,'(!! !*)); prgn := {'setq,'rl_servl!*,{'cons,mkquote smv,'rl_servl!*}} . prgn; prgn := {'put,mkquote sm,''number!-of!-args,len} . prgn; prgn := {'de,sm,args,{'apply,smv,'list . args}} . prgn; prgn := {'fluid,mkquote {smv}} . prgn; if amp then << am := intern compress append('(!r !l),explode bname); psval := intern compress nconc(explode sm,'(!! !$)); prgn := {'put,mkquote am,''psopfn,mkquote psval} . prgn; prgn := {'put,mkquote psval,''number!-of!-args,1} . prgn; prgn := {'put,mkquote psval,''cleanupfn,''rl_cleanup} . prgn; prgn := {'de,psval,'(argl),{'rl_interf1,mkquote sm,mkquote evalfnl, mkquote oevalfnl,mkquote odefl,mkquote resconv,'argl}} . prgn >>; return 'progn . prgn end; procedure rl_op(f); % Reduce logic operator. [f] is a formula. Returns the top-level % operator of [f]. In this sense truth values are operators. if atom f then f else car f; procedure rl_arg1(f); % Reduce logic argument of unary operator. [f] is a formula $\tau % (\phi)$ with a unary boolean top-level operator $\tau$. Returns % the single argument $\phi$ of $\tau$. cadr f; procedure rl_arg2l(f); % Reduce logic left hand side argument of binary operator. [f] is a % formula $\tau(\phi_1,\phi_2)$ with a binary boolean top-level % operator $\tau$. Returns the left hand side argument $\phi_1$ of % $\tau$. cadr f; procedure rl_arg2r(f); % Reduce logic right hand side argument of binary operator. [f] is % a formula $\tau(\phi_1,\phi_2)$ with a binary boolean top-level % operator $\tau$. Returns the right hand side argument $\phi_2$ of % $\tau$. caddr f; procedure rl_argn(f); % Reduce logic argument list of n-ary operator. [f] is a formula % $\tau(\phi_1,...)$ with unary, binary, or $n$-ary top-level % operator $\tau$. Returns the arguments of $\tau$ as a list % $(\phi_1,...)$. cdr f; procedure rl_var(f); % Reduce logic variable. [f] is a formula $Q x (\phi)$ where $Q$ is % a quantifier. Returns the quantified variable $x$. cadr f; procedure rl_mat(f); % Reduce logic matrix. [f] is a formula $Q x (\phi)$ where $Q$ is a % quantifier. Returns the matrix $\phi$. caddr f; procedure rl_b(f); % Reduce logic bound. [f] is a formula starting with a bounded % quantifier. Returns the bound. cadddr f; procedure rl_mk1(uop,arg); % Reduce logic make formula for unary operator. [uop] is a unary % operator, [arg] is a formula. Returns the formula $[uop]([arg])$ % with top-level operator [uop] and argument [arg]. {uop,arg}; procedure rl_mk2(bop,larg,rarg); % Reduce logic make formula for binary operator. [bop] is a binary % operator, [larg] and [rarg] are formulas. Returns the formula % $[bop]([larg],[rarg])$ with top-level operator [bop], left hand % side [larg], and right hand side [rarg]. {bop,larg,rarg}; procedure rl_mkn(nop,argl); % Reduce logic make formula for n-ary operator. [nop] is a unary, % binary, or $n$-ary operator; [argl] is a list $(\phi_1,...)$ of % formulas; for binary or $n$-ary [nop] the length of [argl] is a % least 2. Returns the formula $[nop](\phi_1,..)$ with top-level % operator [nop], and the elements of [argl] as its arguments. nop . argl; procedure rl_smkn(nop,argl); % Reduce logic safe make formula for n-ary operator. [nop] is one % of ['and], ['or]; [argl] is a list $(\phi_1,...)$ of formulas. % Returns a formula. If [argl] is empty, ['true] is returned for % $[nop]=['and]$, and $['false]$ is returned for $[nop]=['or]$. If % [argl] is of length 1, its single element $\phi_1$ is returned. % Else the formula $[nop](\phi_1,..)$ with top-level operator % [nop], and the elements of [argl] as its arguments is returned. if argl and cdr argl then nop . argl else if null argl then if nop eq 'and then 'true else 'false else car argl; procedure rl_mkq(q,v,m); % Reduce logic make quantified formula. [q] is a quantifier, [v] is % a variable, [m] is a formula. Returns the formula $[q] [x] ([m])$ % which is quantified with quantifier [q], quantified variable [v], % and matrix [m]. {q,v,m}; procedure rl_mkbq(q,v,b,m); % Reduce logic make quantified formula. [q] is a quantifier, [v] is % a variable, [b] is a fof with x as only free variable, [m] is a % formula. Returns a formula which is quantified with quantifier % [q], quantified variable [v], which is restricted by [b] and % matrix [m]. {q,v,m,b}; procedure rl_quap(x); % Reduce logic quantifier predicate. [x] is any S-expression. % Returns non-[nil] iff [x] is a quantifier. x eq 'ex or x eq 'all; procedure rl_bquap(x); % Reduce logic bounded quantifier predicate. [x] is any % S-expression. Returns non-[nil] iff [x] is a bounded quantifier. x eq 'bex or x eq 'ball; procedure rl_junctp(x); % Reduce logic junctor predicate. [x] is any S-expression. Returns % non-[nil] iff [x] is one of ['and], ['or] which we refer to as % junctors. x eq 'or or x eq 'and; procedure rl_basbp(x); % Reduce logic basic boolean operator predicate. [x] is any % S-expression. Returns non-[nil] iff [x] is a junctor or ['not]. % We refer to these as basic boolean operators. rl_junctp x or x eq 'not; procedure rl_extbp(x); % Reduce logic extended boolean operator predicate. [x] is any % S-expression. Returns non-[nil] iff [x] is one of ['impl], % ['repl], or ['equiv]. We refer to these as basic boolean % operators. x eq 'impl or x eq 'repl or x eq 'equiv; procedure rl_boolp(x); % Reduce logic boolean operator predicate. [x] is any S-expression. % Returns non-[nil] iff [x] is a boolean operator, i.e. one of % ['and], ['or], ['not], ['impl], ['repl], or ['equiv]. rl_basbp x or rl_extbp x; procedure rl_tvalp(x); % Reduce logic truth value predicate. [x] is any S-expression. % Returns non-[nil] iff [x] is one of ['true], ['false]. x eq 'true or x eq 'false; procedure rl_cxp(x); % Reduce logic complex, i.e., non-atomic, operator predicate. rl_tvalp x or rl_boolp x or rl_quap x or rl_bquap x; endmodule; % [redlog] end; % of file