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

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

Parent Directory Parent Directory | Revision Log Revision Log


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

Revision 2922 - (view) (download) (annotate) - [select for diffs]
Modified Thu Mar 16 19:52:02 2000 UTC (21 years, 4 months ago) by lolorigo
File length: 39029 byte(s)
Diff to previous 2921
added/improved functionality for metaprl/jprover/nuprl5 io


Revision 2921 - (view) (download) (annotate) - [select for diffs]
Modified Mon Mar 13 23:03:12 2000 UTC (21 years, 4 months ago) by steph
File length: 38454 byte(s)
Diff to previous 2905
 ----------------------------------------------------------------------
 Enter Log.  Lines beginning with `CVS:' are removed automatically

 Committing in .

 Modified Files:
 	itt_logic.ml itt_logic.mli
 ----------------------------------------------------------------------


Revision 2905 - (view) (download) (annotate) - [select for diffs]
Modified Tue Feb 22 05:39:46 2000 UTC (21 years, 5 months ago) by nogin
File length: 38405 byte(s)
Diff to previous 2885
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 2885 - (view) (download) (annotate) - [select for diffs]
Modified Thu Feb 17 22:13:44 2000 UTC (21 years, 5 months ago) by nogin
File length: 38405 byte(s)
Diff to previous 2880
Fixed the jtest function


Revision 2880 - (view) (download) (annotate) - [select for diffs]
Modified Wed Feb 2 18:19:32 2000 UTC (21 years, 5 months ago) by steph
File length: 38396 byte(s)
Diff to previous 2822
*** empty log message ***


Revision 2822 - (view) (download) (annotate) - [select for diffs]
Modified Fri Oct 22 01:07:59 1999 UTC (21 years, 9 months ago) by nogin
File length: 37734 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, 11 months ago) by jyh
File length: 37762 byte(s)
Diff to previous 2790
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 2790 - (view) (download) (annotate) - [select for diffs]
Modified Tue Jul 6 15:35:50 1999 UTC (22 years ago) by nogin
File length: 37840 byte(s)
Diff to previous 2786
Changed genAssumT:

generalize all the assumtions that have the "member" goal, not only the first one,
do the usual assumT thing for non-member goals

After the generalization, prove the "main" subgoal automatically


Revision 2786 - (view) (download) (annotate) - [select for diffs]
Modified Mon Jul 5 13:38:57 1999 UTC (22 years ago) by jyh
File length: 38081 byte(s)
Diff to previous 2775
Added: Itt_logic.genAssumT : int list -> tactic
This tactical "generalizes" over a set of assumptions.  The first
assumption should be for a membership judgment.  For example:
   ...
i. H >- t in T list
   ...
j. H >- Q[t]
   ...
   H >- P[t]
   BY genAssumT [i; j]
1. H >- all l: T list. (Q[l] => P[l])
2. H; x: (all l: T list. (Q[l] => P[l])) >- P[t]


Revision 2775 - (view) (download) (annotate) - [select for diffs]
Modified Sun Jul 4 13:13:44 1999 UTC (22 years ago) by jyh
File length: 36560 byte(s)
Diff to previous 2773
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 2773 - (view) (download) (annotate) - [select for diffs]
Modified Sun Jul 4 03:02:58 1999 UTC (22 years ago) by nogin
File length: 33929 byte(s)
Diff to previous 2753
I wrote a decideT tactic, similar to Nuprl4 Decide tactic.

We need to prove some decidability rules and add them to the decide_resource
in order to make this tactic useful.


Revision 2753 - (view) (download) (annotate) - [select for diffs]
Modified Fri Jun 25 00:19:15 1999 UTC (22 years, 1 month ago) by jyh
File length: 33982 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, 1 month ago) by jyh
File length: 34004 byte(s)
Diff to previous 2677
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 2677 - (view) (download) (annotate) - [select for diffs]
Modified Thu May 27 12:31:06 1999 UTC (22 years, 2 months ago) by eli
File length: 43397 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, 2 months ago) by nogin
File length: 43365 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, 2 months ago) by jyh
File length: 43406 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, 2 months ago) by kopylov
File length: 43481 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, 3 months ago) by jyh
File length: 43467 byte(s)
Diff to previous 2578
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 2578 - (view) (download) (annotate) - [select for diffs]
Modified Thu Jan 28 22:53:13 1999 UTC (22 years, 6 months ago) by nogin
File length: 43990 byte(s)
Diff to previous 2531
Fixed some of "this expression should have type unit" warnings


Revision 2531 - (view) (download) (annotate) - [select for diffs]
Modified Wed Dec 30 03:58:59 1998 UTC (22 years, 7 months ago) by jyh
File length: 43976 byte(s)
Diff to previous 2529
The general intuitionistic propDecideT now works.
There was a bug in Itt_logic preventing << false >> from
being recognized.


Revision 2529 - (view) (download) (annotate) - [select for diffs]
Modified Tue Dec 29 23:30:21 1998 UTC (22 years, 7 months ago) by jyh
File length: 43856 byte(s)
Diff to previous 2525
Added pigeonhole problem in editor/ml/test.ml.

To try it:

% ./mptop
# #use "y.ml";;
# refine timingT proveT;;


Revision 2525 - (view) (download) (annotate) - [select for diffs]
Modified Mon Dec 28 21:07:52 1998 UTC (22 years, 7 months ago) by jyh
File length: 43809 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, 9 months ago) by jyh
File length: 43521 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, 10 months ago) by jyh
File length: 43525 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, 11 months ago) by jyh
File length: 42366 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, 11 months ago) by jyh
File length: 42363 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, 11 months ago) by jyh
File length: 42351 byte(s)
Diff to previous 2376
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 2376 - (view) (download) (annotate) - [select for diffs]
Modified Fri Jul 31 14:35:45 1998 UTC (22 years, 11 months ago) by jyh
File length: 38446 byte(s)
Diff to previous 2356
Added TPTP theory, and Ensemble library.  Fixed sequent displays.
BUG: rewrites fail on sequents.


Revision 2356 - (view) (download) (annotate) - [select for diffs]
Modified Fri Jul 24 21:11:12 1998 UTC (23 years ago) by nogin
File length: 23354 byte(s)
Diff to previous 2347
Functorized the Simple_print module over the Refiner module


Revision 2347 - (view) (download) (annotate) - [select for diffs]
Modified Thu Jul 23 18:40:34 1998 UTC (23 years ago) by nogin
File length: 23340 byte(s)
Diff to previous 2337
Moved eseqent type to the TermType module.
Made the types of esequent components hidden to make them read-only.


Revision 2337 - (view) (download) (annotate) - [select for diffs]
Modified Wed Jul 22 00:34:42 1998 UTC (23 years ago) by jyh
File length: 23287 byte(s)
Diff to previous 2336
Removed dest_sequent, and changed Term_man_sig.esequent to use arrays.


Revision 2336 - (view) (download) (annotate) - [select for diffs]
Modified Tue Jul 21 22:47:13 1998 UTC (23 years ago) by jyh
File length: 23189 byte(s)
Diff to previous 2333
Added NL toploop so that we can compile NL native code.


Revision 2333 - (view) (download) (annotate) - [select for diffs]
Modified Fri Jul 17 15:39:32 1998 UTC (23 years ago) by jyh
File length: 23175 byte(s)
Diff to previous 2326
CZF is complete, although we may wish to add pairing and inf.


Revision 2326 - (view) (download) (annotate) - [select for diffs]
Modified Tue Jul 14 21:04:31 1998 UTC (23 years ago) by jyh
File length: 20901 byte(s)
Diff to previous 2325
Added to itt_derived.


Revision 2325 - (view) (download) (annotate) - [select for diffs]
Modified Tue Jul 14 15:44:03 1998 UTC (23 years ago) by jyh
File length: 20870 byte(s)
Diff to previous 2320
Intermediate version with auto tactic.


Revision 2320 - (view) (download) (annotate) - [select for diffs]
Modified Thu Jul 9 21:08:59 1998 UTC (23 years ago) by jyh
File length: 8797 byte(s)
Diff to previous 2314
Upgraded czf.


Revision 2314 - (view) (download) (annotate) - [select for diffs]
Modified Wed Jul 8 15:42:11 1998 UTC (23 years ago) by jyh
File length: 8796 byte(s)
Diff to previous 2309
Pushed higherC into the refiner for efficiency.


Revision 2309 - (view) (download) (annotate) - [select for diffs]
Modified Mon Jul 6 21:39:34 1998 UTC (23 years ago) by jyh
File length: 8050 byte(s)
Diff to previous 2307
Working czf_itt_set.


Revision 2307 - (view) (download) (annotate) - [select for diffs]
Modified Mon Jul 6 17:55:31 1998 UTC (23 years ago) by nogin
File length: 7413 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 (23 years ago) by jyh
File length: 9487 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 (23 years ago) by nogin
File length: 9487 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, 1 month ago) by jyh
File length: 9369 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, 1 month ago) by jyh
File length: 9296 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, 1 month ago) by jyh
File length: 9003 byte(s)
Diff to previous 2224
Added CZF.


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


Revision 2209 - (view) (download) (annotate) - [select for diffs]
Modified Mon Jun 1 13:57:13 1998 UTC (23 years, 1 month ago) by jyh
File length: 8676 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, 2 months ago) by jyh
File length: 8408 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, 3 months ago) by jyh
File length: 8269 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, 3 months ago) by jyh
File length: 8048 byte(s)
Diff to previous 2061
*** empty log message ***


Revision 2061 - (view) (download) (annotate) - [select for diffs]
Modified Mon Sep 8 15:02:40 1997 UTC (23 years, 10 months ago) by jyh
File length: 7944 byte(s)
Diff to previous 2047
This version compiles Ensemble.


Revision 2047 - (view) (download) (annotate) - [select for diffs]
Modified Wed Aug 6 16:18:55 1997 UTC (23 years, 11 months ago) by jyh
File length: 7868 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, 3 months ago) by jyh
File length: 4140 byte(s)
This is the initial checkin of Nuprl-Light.
I am porting the editor, so it is not included
in this checkin.

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