/[mojave]/metaprl/theories/itt/itt_bool.ml
ViewVC logotype

Log of /metaprl/theories/itt/itt_bool.ml

Parent Directory Parent Directory | Revision Log Revision Log


Sticky Revision:
(Current path doesn't exist after revision 7950)

Revision 3584 - (view) (download) (annotate) - [select for diffs]
Modified Thu Apr 25 15:28:40 2002 UTC (19 years, 2 months ago) by nogin
File length: 25113 byte(s)
Diff to previous 3529
- Added the comment module to the theories.pdf ("make latex").

- Added a hack allowing to override a theory display with another theory's
display. This is necessary for bootstrapping reasons - it allows one
to get a reasonable output of a theory (e.g. Comment) that is defined before
all essential display forms (e.g. the Summary ones) are there.

- Added debugging code to make it easier to find dforms that cause
zone begin/end mismatch (and used it to get rid of all
the "Unballanced buffer" warnings in "make latex").

- Minor dforms&comments updates.


Revision 3529 - (view) (download) (annotate) - [select for diffs]
Modified Thu Mar 7 22:55:35 2002 UTC (19 years, 3 months ago) by nogin
File length: 25110 byte(s)
Diff to previous 3343
Fixing a lable problem noticed by Yegor.


Revision 3343 - (view) (download) (annotate) - [select for diffs]
Modified Fri Jul 20 23:06:48 2001 UTC (19 years, 11 months ago) by nogin
File length: 25115 byte(s)
Diff to previous 3339
Itt_fset is finally complete!


Revision 3339 - (view) (download) (annotate) - [select for diffs]
Modified Tue Jul 17 03:04:06 2001 UTC (19 years, 11 months ago) by nogin
File length: 25084 byte(s)
Diff to previous 3329
- Improved proof replay.
- Fset proof fixes.
- Other minor fixes.


Revision 3329 - (view) (download) (annotate) - [select for diffs]
Modified Fri Jul 13 21:34:19 2001 UTC (19 years, 11 months ago) by nogin
File length: 25047 byte(s)
Diff to previous 3324
I've removed old Itt_int* theories and switched all the ITT to Yegor's
new theories.


Revision 3324 - (view) (download) (annotate) - [select for diffs]
Modified Mon Jul 9 20:57:19 2001 UTC (19 years, 11 months ago) by nogin
File length: 24818 byte(s)
Diff to previous 3292
Numerous display form updates.


Revision 3292 - (view) (download) (annotate) - [select for diffs]
Modified Sun Jun 24 10:25:49 2001 UTC (20 years ago) by nogin
File length: 24965 byte(s)
Diff to previous 3281
*** IMPORTANT: before doing "cvs update" see warning below ***

This commit implements a global resource that brings together resource management
that used to be done by each resource in its own way.

- A much simplier object (Mp_resource.resource_info) is now needed to create a new resource.
Additionally, many resource helper modules, such as term_match_table now provide functions
that create a resource_info for you.

- Funtions get_tactic_arg, get_int_tactic_arg, etc were replaced by a single function
get_resource_arg (note: functions for basci types, such as get_with_arg, get_sel_args, etc
were _not_ affected)

- Resource declaration statement now declares and resource creation statement now creates
a function get_<name>_resource. This function ca be passed as a second argument
to get_resource_arg to retrieve the current value of a particular resource.

- Resource annotation functions are now separate from the resource declaration/creation
mechanism. Resource annotation on a rule are now passed to a function named
process_<name>_resource_annotation. This function must have the appropriate
Mp_resource.annotation_processor type for the resource. This function can be declared
and implemented in _any_ module, not just the module that declares and creates the
<name> resource.

- Currenlty MetaPRL leaves it to Ocaml to keep track of these functions.
Consequently the module that defines the process_<name>_resource_annotation function
must be open'ed (not included!) by modules that use <name> annotations.

-----

Unfinished business in this commit:
- Remainder of TODO 1.12 and 1.13

- Some proofs were broken by this commit. It appears that they were broken for
a "good" reason, but still need to be fixed.

- I need to make sure things now always have the right precedences (all things being equal,
the later an item is added to resource, the earlier precedence it should have).

- Consider adding refiner sentinels and display forms to global resource as well.
Currently each of them still does its own way of resource management (although the way
display forms are managed was changed by this commit - need to make sure the precedences
are right).

- Distributed refinement: I am afraid that the current resource code
will either work correctly only if all processes in the distributed group have
the same global resource, or it will attempt to pass around all the resource data.
Obviously, neither of these choices is a good one.

*** WARNING ***

This commit changes the tactic_arg type and also makes minor changes in
the FilterCache.info type. Because of that old .prlb and .cmoz files
*will no longer work*. Old .prla files will work, but will produce lots
of (harmless) Filter_summary.dest_term warning.

Before doing "cvs update" do the following:
1) export all your unsaved proofs into .prla files.
2) rm -f theories/*/*.prlb
3) run "make clean"


Revision 3281 - (view) (download) (annotate) - [select for diffs]
Modified Wed Jun 20 13:56:53 2001 UTC (20 years ago) by nogin
File length: 24976 byte(s)
Diff to previous 3279
The redundant "_resource" suffix should not be used in resource names.


Revision 3279 - (view) (download) (annotate) - [select for diffs]
Modified Wed Jun 20 11:48:09 2001 UTC (20 years ago) by nogin
File length: 25246 byte(s)
Diff to previous 3276
- Renamed andthenC -> thenC
- Added byDefT : conv -> tactic
- Proved rewrites in Itt_dprod
- Removed some unused stuff from one of the filter_prog interfaces.


Revision 3276 - (view) (download) (annotate) - [select for diffs]
Modified Tue Jun 19 15:17:10 2001 UTC (20 years ago) by nogin
File length: 25252 byte(s)
Diff to previous 3238
Added support for the following syntax of resource improvement:
let resource name += expr
and
let resource name += [ expr1; expr2; ...; exprn ]


Revision 3238 - (view) (download) (annotate) - [select for diffs]
Modified Sun May 27 18:08:16 2001 UTC (20 years ago) by nogin
File length: 25656 byte(s)
Diff to previous 3236
I rewrote the Itt_squash tactics and the squash_resource implementation
and made sure most of the theories expand.

- I implemented squash_resource annotations - see documentation for
more information
- autoT will now always attempt to squash the sequent and unsquash all
the hypotheses

Left to do:
- Update the documentation, especially the itt_quickref.txt
- Itt_collections would not expand, but I was planning to rewrite it anyway,
so it does not make sense to try fixing the current version.
- Itt_fset would not expand, it needs lots of work, including (preferably)
some improvements to autoT (not squash-related).


Revision 3236 - (view) (download) (annotate) - [select for diffs]
Modified Wed May 23 15:42:53 2001 UTC (20 years, 1 month ago) by nogin
File length: 26340 byte(s)
Diff to previous 3223
- Proved all the theorems in itt_squash.
- Still need to figure out the right way to do squash_resource and
the relevant tactics.


Revision 3223 - (view) (download) (annotate) - [select for diffs]
Modified Tue May 8 23:59:11 2001 UTC (20 years, 1 month ago) by nogin
File length: 26324 byte(s)
Diff to previous 3176
Finally, I am able to commit what I was getting to
in all these commits over the last several days.

I changed the parser to index declared opnames by its "shape" -
last string of opname + parameter types + subterm arities
instead of just the last string (as it used to be). This means that
the parser now checks whether the usage of an opname corresponds
to its declaration. This allowed me to detect numerous typos in
display forms and even some rules and rewrites and, hopefully,
will prevent people from making such typos in the future.

This is only the first pass of the implementation. I still need to:
- make sure none of my fixes broke any display forms that used to work
  because of typos cancelling each other
- update the documentation
- implement checking of shapes on the opnames specified using the
  Module!name notation (currently no checking is done on such opnames)


Revision 3176 - (view) (download) (annotate) - [select for diffs]
Modified Wed Mar 7 13:02:26 2001 UTC (20 years, 3 months ago) by yegor
File length: 26319 byte(s)
Diff to previous 3139
Term construction/decomposition functions added for "bor"
decideC, decide amd decideT added. May be it is better to call its split...


Revision 3139 - (view) (download) (annotate) - [select for diffs]
Modified Sun Feb 4 19:38:29 2001 UTC (20 years, 4 months ago) by nogin
File length: 26104 byte(s)
Diff to previous 3068
I moved the bind operator from ITT to the Perv module. This makes sense because
what we really mean by "bind" is a generic binding construction, not something
ITT-specific.
I've also replaced Perv!lambda with Perv!bind since it was now redundant
and it was indeed used as "bind", not as "lambda" (there were no beta-reduction
for Perv!lambda).


Revision 3068 - (view) (download) (annotate) - [select for diffs]
Modified Thu Sep 21 21:18:56 2000 UTC (20 years, 9 months ago) by nogin
File length: 26071 byte(s)
Diff to previous 3058
- Added ~ and sqeq to parser. For now, they produce Perv!"rewrite" terms,
but once the new rewriting mechanisms are implemented, we'll be able to
change them to produce "sqeq" opname in "local" theory. I also changed all
ITT conditional rewrites from Perv!"rewrite" to ~.

- "make clean" now cleans all the new stuff Jason added to doc/{ps,latex}


Revision 3058 - (view) (download) (annotate) - [select for diffs]
Modified Sun Sep 10 20:41:19 2000 UTC (20 years, 9 months ago) by jyh
File length: 26146 byte(s)
Diff to previous 3056
Last commit failed partway through...


Revision 3056 - (view) (download) (annotate) - [select for diffs]
Modified Mon Sep 4 17:09:49 2000 UTC (20 years, 9 months ago) by cwitty
File length: 20538 byte(s)
Diff to previous 3050
Started changing declare/prim_rw to define (as in TODO 2.01.2).
Also fixed an unsoundness in itt_dprod.ml where fst{} had two definitions:

 prim_rw unfoldFst : fst{'e} <--> spread{'e; u, v. 'u}
 prim_rw unfoldSnd : fst{'e} <--> spread{'e; u, v. 'v}


Revision 3050 - (view) (download) (annotate) - [select for diffs]
Modified Sun Aug 20 01:40:18 2000 UTC (20 years, 10 months ago) by nogin
File length: 20740 byte(s)
Diff to previous 3047
- I added my personal TODO file that contains a list of things
that I am considering doing with/in/about/around MetaPRL

- I fixed the display form modes in ITT!!!
1) I added the except_mode[...] display form option. It is opposite
to the mode[...] option. The main idea was to be able to say
except_mode[src]
2) I made sure all the display forms in ITT (and below it, except for
Ocaml) are annotated with proper mode and except_mode options.
3) I added (in one of the previous commits) the  set_dfmode
command to MetaPRL toploop. Now  set_dfmode "src"  can be used
to produce terms in a form suitable for cutting and pasting into
.ml files and command line tactic arguments.
4) I updated the documentation accordingly.


Revision 3047 - (view) (download) (annotate) - [select for diffs]
Modified Mon Aug 14 04:28:07 2000 UTC (20 years, 10 months ago) by nogin
File length: 20560 byte(s)
Diff to previous 3042
I changed the unhide rules according to hide{A} = squash{A} semantics.

Alexei, can you take a look at my changes and see if you agree with them?
Also, do we need more elimination rules for union and more introduction rules
for intersection?


Revision 3042 - (view) (download) (annotate) - [select for diffs]
Modified Wed Aug 9 23:54:39 2000 UTC (20 years, 10 months ago) by nogin
File length: 20791 byte(s)
Diff to previous 3007
Got rid of Itt_equal!member.
----------------------------

Now the only way to represent membership in ITT is to use << equals{T;x;x} >>
To avoid extra typing, this can be typed as << x IN T >> (note that "IN" has
to be capitalized here, while in << x=x in T >> it has to be lowercase).

I updated the rules and tactics approprially. I also updated itt_quickref.txt
(Although I have not checked whether the original text was correct and if it was
not, my modifications could also be incorrect).

I reexpanded all the proofs. Most worked correctly, except for the following:
- Some proofs were nonexistant or incomplete even before my changes.
- Itt_fset is very outdated and would not expand without some major effort.
- Many proofs in Itt_collection are broken because of heavy reliance on tatcics
that need term arguments that were broken by the variable naming bug (BUGS 3.11).
I am not sure whether it's the only problem with Itt_collection (probably not).


Revision 3007 - (view) (download) (annotate) - [select for diffs]
Modified Thu Jun 8 11:55:06 2000 UTC (21 years ago) by nogin
File length: 22260 byte(s)
Diff to previous 2906
Smarter type inference algorithm capable of doing things like

# ti <<lambda{x.spread{'x;u,v.it}}>>;;
- : Refiner.Refiner.Refine.term = x:(Top X Top) --> Unit


Revision 2906 - (view) (download) (annotate) - [select for diffs]
Modified Tue Feb 22 17:42:16 2000 UTC (21 years, 4 months ago) by jyh
File length: 22381 byte(s)
Diff to previous 2905
Itt_bool now expands.


Revision 2905 - (view) (download) (annotate) - [select for diffs]
Modified Tue Feb 22 05:39:46 2000 UTC (21 years, 4 months ago) by nogin
File length: 22315 byte(s)
Diff to previous 2808
Added a new function for free variable testing.
Renamed all the free variable testing functions for uniformity:
   val is_var_free : string -> term -> bool
   val is_some_var_free : string list -> term -> bool
   val is_some_var_free_list : string list -> term list -> bool

Made Strict rewriter checking use is_some_var_free (speedup!).


Revision 2808 - (view) (download) (annotate) - [select for diffs]
Modified Wed Aug 25 19:09:25 1999 UTC (21 years, 10 months ago) by jyh
File length: 22310 byte(s)
Diff to previous 2788
I added a TeX mode for display.  This was a quick hack, and it
it _not_ the way it should be done long term.  We should be able
to do the formatting and indentation with boxes, etc.

I added SIL.  This theory is an incomplete semantics of a
"simple imperative language."


Revision 2788 - (view) (download) (annotate) - [select for diffs]
Modified Mon Jul 5 14:49:32 1999 UTC (21 years, 11 months ago) by jyh
File length: 22427 byte(s)
Diff to previous 2775
ifthenelse_member was defined twice.


Revision 2775 - (view) (download) (annotate) - [select for diffs]
Modified Sun Jul 4 13:13:44 1999 UTC (21 years, 11 months ago) by jyh
File length: 22425 byte(s)
Diff to previous 2753
Things seem to be working pretty smoothly now.  This is mostly minor
fixes.  Still need to fix the problems with the mp toploop.

    1. Proofs now use Alexey's ASCII format.  By default, proofs
       should be saved to CVS in .prla format.  You can generate ASCII
       files by using "make export", or you can use the "export ()"
       instead of the "save ()" command in the editor.  For speed,
       .prlb files are now saved in a raw, marshaled format.  When you
       edit a theory, the newest of .cmoz, .prlb, or .prla files is
       loaded.  There is a new command "convert" to convert between
       all the different proof file formats.
          convert -I ... [-raw|-term|-lib|-ascii] -impl file.cmoz
          raw: save the file in fast, raw format
	  term: save the file as <magic#>/<marshaled term_io>
	  lib: send the file to the Nuprl5 library
	  ascii: create a .prla file

       Developers: _please_ mention any changes to the basic data
          structures in your CVS logs.  The things that matter are:
          Refiner.Refiner.TermType.term
	  Filter_summary.summary_info
	  Tactic_boot_sig.TacticType.{tactic_arg,extract}
	  Proof_boot.io_proof

       Users: to be safe, save all your proofs using "make export"
          before doing a cvs update.

    2. "expand ()" and "expand_all ()" now work.  I also added
       "clean ()" and "clean_all ()" commands to remove those peasky
       dangling proof nodes when you are satisfied with a proof.  By
       default, proofs are saved only down to the innermost rule-box
       level, and primitive refinements are omitted.  I haven't added
       a "deep_save ()" command; it seems unecessary.

    3. Sorry, but I had to move theories/boot into the filter.  There
       are no major changes here, but the directory structure in
       filter has changed significantly.

    4. I added a THEORIES variable to the mk/config file that
       specifies what theories you want to compile.  This means that
       you don't have to edit all the Makefiles when you add a theory,
       and it also means that you can keep your own theories without
       having to commit them to cvs.


Revision 2753 - (view) (download) (annotate) - [select for diffs]
Modified Fri Jun 25 00:19:15 1999 UTC (22 years ago) by jyh
File length: 22281 byte(s)
Diff to previous 2743
These are some minor changes to make things work better.  Changed
meaning of ThinOption in elim_resource: it now means to thin the hyp
by default, unless overridden by thinningT false.

Fixed some proof operations.  Added "move_to_assum" command to take
the current subgoal and make it an extra assumption of the entire
proof (it may not work at the moment).

ls now takes a _string_ argument.  Use ls "u";; to display only the
unproved rules in the current module.

Proved many membership variants of the standard type constructors,
but there are a few more to go.  When you are defining theories, I
believe you should use membership, not equality.  After all, equality
is derivable from membership, and membership is a lot easier.

Still to go: ASCII format proof files; save proofs _without_ extracts
by default.  The expand () function does not reexpand proofs correctly.
A few problems with proof navigation.


Revision 2743 - (view) (download) (annotate) - [select for diffs]
Modified Wed Jun 23 04:50:29 1999 UTC (22 years ago) by jyh
File length: 21857 byte(s)
Diff to previous 2674
This is a major release; I bumped the release number to 0.6.
WARNING: There are major changes here, and there may be problems
   with this version that prevent you from using your old proof.
   Save your work before using this version.
NOTE: If you decide to try this out, and you find problems,
   please(!) send me email so I can fix it.

Changes:
   1. The proof structure is totally changed, so that the proof
      editor edits the raw proof extracts.  This means that you
      can view the actions of the refiner down to the primitive
      rule applications.  In the proof editor, you can use
      "down 0" (or "cd "0") to descend into the proof of a rule box.
      Primitive proofs are called "extracts", and are labeled with
      brackets (like [extract]).  To expand the extract, use the command
      "unfold ()".  You should be able to get all the way down to
      the primitive rule/rewrite applications.

      This also means that the format of the proof files (the .prlb
      files) has changed.  The old proof files are still valid,
      but this is a hack and will be deprecated in the next
      few months.  I haven't yet added Alexey's ASCII proof
      files, but that will come with the next release.

      As usual, the "undo ()" command undoes the last proof step,
      including "unfold ()".  The "nop ()" command, reset the undo
      stack.  I also added a "redo ()" command that undoes the
      last undo.

      There is a simple rule-box proof cache for collecting proofs
      as you edit them.  If cached proofs are available, you will
      see them in brackets (like [* # * *]) on the status line.
      I haven't yet:( added the commands to use cached proofs.

   2. Refiner changes.  I added two new features: the "cutT <term>"
      tactic cuts in a new assumption.  Also, you can apply
      rewrites directly on assumptions, with the "rwc" and
      "rwch" operations, that take a clause argument.  Basically,
      this means that instead of folding the goal, you can unfold
      the assumption.  I believe this is sound; let me know if
      you think otherwise!

   3. Resource changes.  I added resource automation, built on
      the basic resource parsing Alexey added.  Ratherthan writing
      resource code for every rule, you can annotate most rules
      to generate the resource code directly.  You can see lots of
      examples in the Itt theory.  Basically, there are three useful
      resources annotations:
         intro_resource []: adds the rule as an introduction in dT
         intro_resource [SelectOption i]: adds to selT i dT
         elim_resource []: adds as an elimination rule to dT.
            This normally tries to thin the hyp that was eliminated.
         elim_resource [ThinOption]: don't thin the hyp

      Rules should be annotated with labels on their clauses,
      like [wf], [main], [assertion], etc.  This means that in
      most tactic aplcations, you no longer need to have the
      thenLT [addHiddenLabel "main"; ...] part.

      N.B.  This is the most likey parts of this release to
      cause problems, because I deleted most old resource code.

      Also, you can still write standard resource code, but there
      is no longer a d_resource--it has been broken into two parts:
      the intro_resource for application to goals, and elim_resource
      for application to hyps.

   4. The proof editor is multi-threaded, so you can work on multiple
      proofs simultaneously.  In the normal Emacs editor, this is
      no help for you.  But there is a new Java editor with the
      standard point-and-click interface, and it views the proof
      in HTML, with multiple windows etc.  The beautiful thing is
      that you can use display forms to add commands to edit windows.
      The sad thing is that I built it on NT, Java 1.2 is required,
      and I haven't tried the blackdown.org Java release on Linux.
      This editor is pending some bug fixes from Sun to get the
      fonts right (they call this a standard release?).

      In any case, here are the direct implications.  The display
      forms have an "html" mode.  The display form formatting in
      the module Rformat has been completely redone, but display
      _should_ be the same as it was before.

      It is likely that I will add an HTML dump, so we can send
      uneditable proofs around by email or on the web.  Check out
      the file theories/base/summary.ml to see some example HTML
      display forms.

      The other issue: your MetaPRL process starts a web server on
      YOUR local machine using YOUR process id on the "next" available
      TCP port, and it serves files only from the search path that you pass
      MetaPRL.  I realize that this has security implications.  This
      is necessary to get browser access to the working MetaPRL proof.
      Is this crazy?  Let me know your beliefs, religious or
      otherwise.

   5. There are numerous minor changes.  I redid parts of the WeakMemo,
      Term_header_constr, and TermHash.  The theories/tactic directory
      has been split into tactic/boot (which is not compiled by MetaPRL),
      and theories/tactic (which is).

Jason


Revision 2674 - (view) (download) (annotate) - [select for diffs]
Modified Wed May 26 00:41:08 1999 UTC (22 years, 1 month ago) by nogin
File length: 28437 byte(s)
Diff to previous 2669
I removed @ from the parameter syntax for meta-parameters. Now
[xxx:s] is parsed as a meta-string parameter (MString "xxx") and
["xxx":s] is parsed as a string parameter (Sting "xxx")

I also copied .cmoz files to .prlb files until I've reached a fixpoint.


Revision 2669 - (view) (download) (annotate) - [select for diffs]
Modified Sun May 23 21:55:17 1999 UTC (22 years, 1 month ago) by jyh
File length: 28440 byte(s)
Diff to previous 2652
This is a major modification to how parameters are handled.
1. All level parmeters are now meta.  That is, univ[@i:l] is
   exactly the same as univ[i:l].  The rewriter handles
   lavel expressions, so matching with levels like
   univ[3 | i':l | j:l] should work correctly.

   The syntax still requires the @ for meta-parameter of
   other types.  For instance, token["hello world":t] is
   a normal token, and token[@"hello world":t] is a
   token with a meta-parameter.

2. There are no more parameter expressions.  For instance,
   the term natural_number[@i + @j] is not valid anymore.
   To replace them, the module theories/base/base_meta.ml
   defines ML rewrites that implement the same functionality.
   For example,
      meta_sum{number[12]; number[5]} --> number[17]

3. There is no term natural_number[@i:n] any more.  This was
   always a bad name, since it has always been possible for the
   parameter to be negative.

4. The Itt_equal.cumulativity rule is no longer defined as a
   side-condition.  It now uses Base_meta.meta_lt to define
   inclusion on level expression.  Cumulativity expansion
   should be performed automatically by the dT tactic.
   So:
      sequent ['ext] { ... >- univ[@i:l] = univ[@i:l] in univ[@j:l] }
      BY dT 0
   should always either succeed or fail, without producing
   subgoals.

I haven't fully tested the side-conditions.  As usual, let me know
if you see anything strange.  Next, I'm looking at the
rewriter free variable soundness problem.


Revision 2652 - (view) (download) (annotate) - [select for diffs]
Modified Thu May 13 23:18:29 1999 UTC (22 years, 1 month ago) by kopylov
File length: 28753 byte(s)
Diff to previous 2629
1) Added a bug list into BUGS

2) Changed the keywords:
axiom -> rule  (.mli files)
primrw -> prim_rw  (.ml files)
rwthm -> thm_rw  (.ml files)

3) Fixed the rule Itt_struct.hypSubstitution


Revision 2629 - (view) (download) (annotate) - [select for diffs]
Modified Sun Apr 4 22:07:38 1999 UTC (22 years, 2 months ago) by jyh
File length: 28741 byte(s)
Diff to previous 2573
This is the first phase for modifying resources.
The Mp_resource interface has been substantially simplified, but
I believe that it retains as much functionality as it did before
the change.

The next step for me to add the Mp_resource support for
adding resources as rule annotations.


Revision 2573 - (view) (download) (annotate) - [select for diffs]
Modified Mon Jan 25 18:21:31 1999 UTC (22 years, 5 months ago) by jyh
File length: 28966 byte(s)
Diff to previous 2525
Distributed refiner for CADE-16.


Revision 2525 - (view) (download) (annotate) - [select for diffs]
Modified Mon Dec 28 21:07:52 1998 UTC (22 years, 5 months ago) by jyh
File length: 28870 byte(s)
Diff to previous 2494
Numerous minor changes.

Added itt_fset: a theory of finite sets based on a list
implementation quotiented by equivalence under arbitrary
occurrences and ordering.

Added initial reflection theory.  Terms are quotiented by
alpha-equality, so normal well-formedness proofs are difficult,
and more work needs to be done to define free variables and
substitution.


Revision 2494 - (view) (download) (annotate) - [select for diffs]
Modified Tue Oct 13 01:14:08 1998 UTC (22 years, 8 months ago) by jyh
File length: 6586 byte(s)
Diff to previous 2493
I changed all the obvious places of Nuprl-Light, NL, nl, or any
other instance to MetaPRL, MP, or mp, etc.  The docs may be broken
but I'll fix them soon.  As usual, let me know if anything breaks.


Revision 2493 - (view) (download) (annotate) - [select for diffs]
Modified Mon Oct 12 22:40:01 1998 UTC (22 years, 8 months ago) by jyh
File length: 6590 byte(s)
Diff to previous 2456
Added "reflection" theory, for reflecting sentences in the meta-logic
into the Nuprl type theory.


Revision 2456 - (view) (download) (annotate) - [select for diffs]
Modified Sat Sep 5 22:31:37 1998 UTC (22 years, 9 months ago) by jyh
File length: 6511 byte(s)
Diff to previous 2443
Added license headers to each of the files in preparation for
the first major release.  The license is GNU public license; if
any of you have problems with that, let me know right away.  When
you add new code, you should credit yourself as the author.  When
you modify code, you should add a "Modified by:" to the header,
and possibly a short summary of your changes.

I tried to get the Author lists as correct as I remember, but there
are more than 550 files(!) and I may have made some mistakes. Please
add yourself if I didn't do it right.


Revision 2443 - (view) (download) (annotate) - [select for diffs]
Modified Mon Aug 24 13:43:48 1998 UTC (22 years, 10 months ago) by jyh
File length: 5352 byte(s)
Diff to previous 2380
Slightly better Ensemble scheduling.
Native-code compiler has trouble marshaling functions--
its probably a problem with the marshaler.

Added Nl_num, a ML-only implementation of bignums.
This is slower than the C version used by OCaml, but
we can marshal the Nl_nums.  Most of the files changed
are just replacements of Num.* with Nl_num.*.


Revision 2380 - (view) (download) (annotate) - [select for diffs]
Modified Sun Aug 2 17:12:26 1998 UTC (22 years, 10 months ago) by jyh
File length: 5349 byte(s)
Diff to previous 2307
Modified rewriter to handle Alexey's new sequents.  The rewriter is
now moved to a new directory refiner/rewrite.  Clause numbers in
TermMan now start with 1.  The tactics seem to work, but there may
be some lurking problems with hypothesis numbering.


Revision 2307 - (view) (download) (annotate) - [select for diffs]
Modified Mon Jul 6 17:55:31 1998 UTC (22 years, 11 months ago) by nogin
File length: 5369 byte(s)
Diff to previous 2244
Removed $Log messages from all NL files.


Revision 2244 - (view) (download) (annotate) - [select for diffs]
Modified Mon Jun 15 22:33:52 1998 UTC (23 years ago) by jyh
File length: 5593 byte(s)
Diff to previous 2226
Added CZF.


Revision 2226 - (view) (download) (annotate) - [select for diffs]
Modified Fri Jun 12 18:36:50 1998 UTC (23 years ago) by jyh
File length: 5510 byte(s)
Diff to previous 2224
Working factorial proof.


Revision 2224 - (view) (download) (annotate) - [select for diffs]
Added Fri Jun 12 13:47:49 1998 UTC (23 years ago) by jyh
File length: 4139 byte(s)
D tactic works, added itt_bool.


This form allows you to request diffs between any two revisions of this file. For each of the two "sides" of the diff, enter a numeric revision.

  Diffs between and
  Type of Diff should be a

  ViewVC Help
Powered by ViewVC 1.1.26