author wenzelm
Mon, 22 Nov 1993 12:08:45 +0100
changeset 137 ad5414f5540c
parent 107 b4a8dabc7313
permissions -rw-r--r--
*** empty log message ***


22-Oct-1993 MMW
20-Nov-1993 MMW

Some things notable, but not (yet?) covered by the manual.

- constants of result type prop should always supply concrete syntax
  (elaborate on this in last sect of 'Defining Logics' (?));

- 'Variable --> Constant' possible during rewriting;

- 'trivial definitions' via macros (e.g. "x ~= y" == "~ (x = y)");

- patterns matching any remaining arguments are not possible (i.e. what would
  be (f x y . zs) in LISP); e.g. HOL's @ (supposing it implemented via macros
  which it is *not*): "@x. P" == "Eps(%x. P)", now the print rule doesn't
  match things like Eps(%x. P, a, b, c);

- alpha: document the precise manner in which bounds are renamed for

- parsing: applications like f(x)(y)(z) are not parse-ast-translated into
  (f x y z); this may cause some problems, when the notation "f x y z" for
  applications will be introduced;