ViewVC logotype

Log of /metaprl/theories/itt/itt_rfun.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, 1 month ago) by nogin
File length: 20327 byte(s)
Diff to previous 3307
- 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 3307 - (view) (download) (annotate) - [select for diffs]
Modified Mon Jul 2 22:34:20 2001 UTC (19 years, 11 months ago) by kopylov
File length: 20461 byte(s)
Diff to previous 3306
- added rules applyEquality to intro resource

- many rules (e.g. letT and elimination rules for the intersection and union types)
  produces equality hypotheses in the subgoals that rarely used in practice.
  Now such rules thin these hypotheses by default.
  To avoid this one can use doNotThinT = thinningT false.

Revision 3306 - (view) (download) (annotate) - [select for diffs]
Modified Mon Jul 2 00:47:04 2001 UTC (19 years, 11 months ago) by nogin
File length: 20452 byte(s)
Diff to previous 3281
src mode dform fixes.

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

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

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: 20730 byte(s)
Diff to previous 3216
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 3216 - (view) (download) (annotate) - [select for diffs]
Modified Mon May 7 23:29:35 2001 UTC (20 years, 1 month ago) by nogin
File length: 20736 byte(s)
Diff to previous 3124
- Check the arity of the SO variables in the contractum at compile time.

- In rules & rewrites (``Strict'' mode) disallow turning bound variables
into free ones. I actually found two bugs in itt_rfun using this one!

- In display forms (``Relaxed'' mode) allow turning anything (parameters,
bound variables, etc) into variables.

Revision 3124 - (view) (download) (annotate) - [select for diffs]
Modified Wed Jan 31 22:44:31 2001 UTC (20 years, 4 months ago) by nogin
File length: 20734 byte(s)
Diff to previous 3058
Spelling changes.
For best results, upgrade to http://www.cs.cornell.edu/nogin/RPM/MetaPRL/noarch/words-2.1-1.noarch.html

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: 20740 byte(s)
Diff to previous 3050
Last commit failed partway through...

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: 16774 byte(s)
Diff to previous 3042
- 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
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 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: 16674 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: 18311 byte(s)
Diff to previous 3006
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 3006 - (view) (download) (annotate) - [select for diffs]
Modified Mon Jun 5 01:48:17 2000 UTC (21 years ago) by nogin
File length: 18097 byte(s)
Diff to previous 2993
Define type inference types only once, not in 5 places.

Revision 2993 - (view) (download) (annotate) - [select for diffs]
Modified Fri May 26 19:57:46 2000 UTC (21 years ago) by nogin
File length: 18144 byte(s)
Diff to previous 2985
 - Fixed a nasty bug in Term_ds.subst - it didn't notice when the same variable
was mentioned several times in the substitution with different terms substituted
for it. This made it possible to break Term_ds invariants leading to all kinds of
strange behaviour.

 - Changed the argument order for "subst" to be more natural

 - Added a subst1 function to substitute for a single variable without having
to put the substitution into a singleton list.

 - Added the resource annotations and updated the rest of the resource code
in CZF so that it now compiles (but I didn't try to expand anything).

Revision 2985 - (view) (download) (annotate) - [select for diffs]
Modified Thu May 25 05:14:42 2000 UTC (21 years ago) by nogin
File length: 18147 byte(s)
Diff to previous 2911
Merged the unify_mm branch.

Revision 2911 - (view) (download) (annotate) - [select for diffs]
Modified Thu Feb 24 01:42:53 2000 UTC (21 years, 3 months ago) by jyh
File length: 18098 byte(s)
Diff to previous 2822
Planning for update to .prla files.

Revision 2822 - (view) (download) (annotate) - [select for diffs]
Modified Fri Oct 22 01:07:59 1999 UTC (21 years, 8 months ago) by nogin
File length: 17914 byte(s)
Diff to previous 2808
Added new function to mp_debug
let show_loading s = if !debug_load then Printf.eprintf s eflush

and replaced all usages of debug_load with show_loading

Revision 2808 - (view) (download) (annotate) - [select for diffs]
Modified Wed Aug 25 19:09:25 1999 UTC (21 years, 9 months ago) by jyh
File length: 17942 byte(s)
Diff to previous 2778
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 2778 - (view) (download) (annotate) - [select for diffs]
Modified Mon Jul 5 02:34:48 1999 UTC (21 years, 11 months ago) by jyh
File length: 17968 byte(s)
Diff to previous 2775
Added Itt_sort for Alexey's demo.  Reading the .prla file is _really_ slow
so I added the .prlb file as well.  We known that normalization is exponential:
do we have to add a number to every term, or can we be smarter?

In Base_dtactic I added two options:
   IntroArgsOption of (tactic_arg -> term -> term list) * term option
   ElimArgsOption of (tactic_arg -> term -> term list) * term option
The function computes the term arguments for the rule, and the term option
specifies the subterm to pass.  Example:
   interactive applyMember {| intro_resource [IntroArgsOption (infer_type_args, << 'f >>)] |} 'H ('A -> 'B) :
       [wf] sequent [squash] { 'H >- member{.'A -> 'B; 'f} } -->
       sequent ['ext] { 'H >- member{'T; .'f 'a} }
This would use the type inference function "infer_type_args" to infer the type for 'f
and use it as the term argument ('A -> 'B).  Of course, the refiner will complain if
the infered type is not a simple function type.

This is only used in Itt_sort right now, and it is experimental.  We want
an option like this because type inference is such a common requirement.
But this specification is too ad-hoc, and I will think about it further
(suggestions welcome).

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: 18011 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:

       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: 19497 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: 14166 byte(s)
Diff to previous 2688
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.

   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

   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).


Revision 2688 - (view) (download) (annotate) - [select for diffs]
Modified Sat Jun 5 09:22:02 1999 UTC (22 years ago) by cwitty
File length: 14103 byte(s)
Diff to previous 2677
Fixed minor inaccuracies in doc/it_quickref.txt.

Bugfix in max_level_exp (both ds and std).

Fixed precedence of "fun" constructor:
   (a -> b) -> c
was displaying as
   a -> b -> c

Revision 2677 - (view) (download) (annotate) - [select for diffs]
Modified Thu May 27 12:31:06 1999 UTC (22 years ago) by eli
File length: 14091 byte(s)
Diff to previous 2674
Fix some slot[lt]{...} and slot[le]{...} to use quotes.

Revision 2674 - (view) (download) (annotate) - [select for diffs]
Modified Wed May 26 00:41:08 1999 UTC (22 years ago) by nogin
File length: 14087 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: 14092 byte(s)
Diff to previous 2667
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.
      sequent ['ext] { ... >- univ[@i:l] = univ[@i:l] in univ[@j:l] }
      BY dT 0
   should always either succeed or fail, without producing

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 2667 - (view) (download) (annotate) - [select for diffs]
Modified Sat May 22 11:24:29 1999 UTC (22 years, 1 month ago) by jyh
File length: 14086 byte(s)
Diff to previous 2660
Modified the itt_rfun display form to be recursive.
Sorry about the delay.  I forgot, and cs-annex-1 is
having trouble.

Revision 2660 - (view) (download) (annotate) - [select for diffs]
Modified Thu May 20 23:11:57 1999 UTC (22 years, 1 month ago) by kopylov
File length: 14136 byte(s)
Diff to previous 2652
Fixed fun_df3:

 dform fun_df3 : rfun{'A; f, x. 'B['f; 'x]} =
-   "{" " " slot{bvar{'f}} `"|" "fun"{'A; x. 'B['f; 'x]} "}"
+   "{" " " slot{bvar{'f}} `" | "  slot{bvar{'x}} `":" slot{'A} " " rightarrow " " slot{'B} "}"

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: 14101 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: 14099 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, 4 months ago) by jyh
File length: 14160 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: 14123 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

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: 13991 byte(s)
Diff to previous 2456
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 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: 13995 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: 12836 byte(s)
Diff to previous 2420
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 2420 - (view) (download) (annotate) - [select for diffs]
Modified Fri Aug 7 01:48:31 1998 UTC (22 years, 10 months ago) by jyh
File length: 12833 byte(s)
Diff to previous 2380
Added unify_subst type to retain unification info between separate
calls to TermSubst.unify.  This requires that type inference be modified,
and there are still some small modifications to be made in Itt_rfun.
We need to do some optimization in Cycle_dag and unification.

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: 12767 byte(s)
Diff to previous 2336
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 2336 - (view) (download) (annotate) - [select for diffs]
Modified Tue Jul 21 22:47:13 1998 UTC (22 years, 11 months ago) by jyh
File length: 13082 byte(s)
Diff to previous 2307
Added NL toploop so that we can compile NL native code.

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: 13079 byte(s)
Diff to previous 2283
Removed $Log messages from all NL files.

Revision 2283 - (view) (download) (annotate) - [select for diffs]
Modified Thu Jul 2 18:38:08 1998 UTC (22 years, 11 months ago) by jyh
File length: 15533 byte(s)
Diff to previous 2280
Refiner modules now raise RefineError exceptions directly.
Modules in this revision have two versions: one that raises
verbose exceptions, and another that uses a generic exception.

Revision 2280 - (view) (download) (annotate) - [select for diffs]
Modified Wed Jul 1 04:38:04 1998 UTC (22 years, 11 months ago) by nogin
File length: 15425 byte(s)
Diff to previous 2272
Moved Refiner exceptions into a separate module RefineErrors

Revision 2272 - (view) (download) (annotate) - [select for diffs]
Modified Tue Jun 23 22:12:44 1998 UTC (23 years ago) by jyh
File length: 15307 byte(s)
Diff to previous 2268
Improved rewriter speed with conversion tree and flist.

Revision 2268 - (view) (download) (annotate) - [select for diffs]
Modified Mon Jun 22 19:46:48 1998 UTC (23 years ago) by jyh
File length: 15194 byte(s)
Diff to previous 2244
Rewriting in contexts.  This required a change in addressing,
and the body of the context is the _last_ subterm, not the first.

Revision 2244 - (view) (download) (annotate) - [select for diffs]
Modified Mon Jun 15 22:33:52 1998 UTC (23 years ago) by jyh
File length: 14986 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: 14923 byte(s)
Diff to previous 2224
Working factorial proof.

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

Revision 2222 - (view) (download) (annotate) - [select for diffs]
Modified Tue Jun 9 20:53:04 1998 UTC (23 years ago) by jyh
File length: 14675 byte(s)
Diff to previous 2209
Propagated refinement changes.
New tacticals module.

Revision 2209 - (view) (download) (annotate) - [select for diffs]
Modified Mon Jun 1 13:57:13 1998 UTC (23 years ago) by jyh
File length: 14624 byte(s)
Diff to previous 2190
Proving twice one is two.

Revision 2190 - (view) (download) (annotate) - [select for diffs]
Modified Thu May 28 13:48:44 1998 UTC (23 years ago) by jyh
File length: 14384 byte(s)
Diff to previous 2152
Updated the editor to use new Refiner structure.
ITT needs dform names.

Revision 2152 - (view) (download) (annotate) - [select for diffs]
Modified Fri Apr 24 02:44:07 1998 UTC (23 years, 2 months ago) by jyh
File length: 14245 byte(s)
Diff to previous 2150
Added more extensive debugging capabilities.

Revision 2150 - (view) (download) (annotate) - [select for diffs]
Modified Wed Apr 22 22:45:29 1998 UTC (23 years, 2 months ago) by jyh
File length: 14025 byte(s)
Diff to previous 2117
*** empty log message ***

Revision 2117 - (view) (download) (annotate) - [select for diffs]
Modified Thu Apr 9 18:26:13 1998 UTC (23 years, 2 months ago) by jyh
File length: 13867 byte(s)
Diff to previous 2047
Working compiler once again.

Revision 2047 - (view) (download) (annotate) - [select for diffs]
Modified Wed Aug 6 16:18:55 1997 UTC (23 years, 10 months ago) by jyh
File length: 13769 byte(s)
Diff to previous 2032
This is an ocaml version with subtyping, type inference,
d and eqcd tactics.  It is a basic system, but not debugged.

Revision 2032 - (view) (download) (annotate) - [select for diffs]
Added Mon Apr 28 15:52:46 1997 UTC (24 years, 1 month ago) by jyh
File length: 9655 byte(s)
This is the initial checkin of Nuprl-Light.
I am porting the editor, so it is not included
in this checkin.

    refiner: logic engine
    filter: front end to the Ocaml compiler
    editor: Emacs proof editor
    util: utilities
    mk: Makefile templates

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