Dear Maude Abusers,

A new alpha release can be accessed at SRI-CSL in:

~eker/public_html/Maude/Alpha82/

or downloaded from:

http://www.csl.sri.com/~eker/Maude/Alpha82/

Alpha release site authentication:

User Name: maudeabuser
Password: bughunter

This version is a pure alpha release - it is not destined for the
Maude website though of course you may redistribute it under the GPL.
Because of this I have only made binaries for Linux and Solaris - I
will make a MacOSX binary in the near future.

Bug fixes
==========
(1) Infinity and -Infinity now work on MacOSX (and FreeBSD) -
    previously Infinity was converted to 0. Reported by Carolyn.

(2) Various bugs in show module (and show all) commands
    fixed. Reported by Narciso.

(3) Break points no longer cause an internal error when executing
    builtin function symbols. Reported by Christiano Braga.

(4) metaPrettyPrint() now handles variables at the kind level
    correctly. Reported by Joe Hendrix.

(5) Printing a sort redeclaration warning from the metalevel no
    longer causes an internal error. Reported by Peter Olveczky.

(6) Various files (ChangeLogs and compiler code) that were accidently
    left out of the last source tree are included - automake files are
    fixed.

Other changes
==============
(1) The semantics over owise equations wrt operator level strategies
    has changed. Now owise equations can only be used in evaluating the
    final 0 of a strategy. This change was suggested by Joe Hendrix.

(2) The Int operators quo, rem, gcd, lcm, divides now work on Rats.
    quo gives the number of whole times a rational can be divided by
    another, rem gives the rational remainder. divides returns true if
    a rational divides a rational a whole number of times. gcd returns
    the largest rational that divides into each of its arguments a
    whole number of times while lcm returns the smallest rational that
    is an integer multiple of its arguments.

(3) Ctor coloring is now supported for iter symbols:

set print color on .

fmod ITER-COLOR is
  sorts Nat0 Nat1 Nat2 Nat .
  subsort Nat0 Nat1 Nat2 < Nat .
  op s_ : Nat0 -> Nat1 [iter ctor] .
  op s_ : Nat1 -> Nat2 [iter ctor] .
  op s_ : Nat2 -> Nat0 [iter] .
  op 0 : -> Nat0 [ctor] .
endfm

red s 0 .
red s s 0 .
red s s s 0 .
red s s s s 0 .


(4) META-LEVEL has two new polymorpic functions:

  op upTerm : Universal -> Term [special (...)] .
  op downTerm : Term Universal -> Universal [special (...)] .

    upTerm() converts a term into it's meta-representation, while
    downTerm() converts a meta-term into a regular term. They can
    handle regular terms at the kind level. The 2nd argument to
    downTerm is a term belonging to the appropriate component that is
    returned should the meta-term not represent a valid term in that
    component.

fmod UP-DOWN-TEST is
  inc META-LEVEL .
  sort Foo .
  ops a b c d e : -> Foo .
  op f : Foo Foo -> Foo .
  eq c = d .
endfm

red upTerm(upTerm(f(a, f(b, c)))) .
red downTerm(downTerm(upTerm(upTerm(f(a, f(b, c)))), X:Term), a) .


(5) The configuration now supports building without Tecla
    (--with-tecla=no). Requested by Ambarish.

Steven