| definition: |
(*#) :: BinInt -> BinInt -> BinInt Zero *# _ = Zero Pos _ *# Zero = Zero Pos x *# Pos y = Pos (x *^ y) Pos x *# Neg y = Neg (x *^ y) Neg _ *# Zero = Zero Neg x *# Pos y = Neg (x *^ y) Neg x *# Neg y = Pos (x *^ y) |
| demand: |
argument 1 |
| deterministic: |
deterministic operation |
| documentation: |
--- Multiplies two BinInts. |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({Zero},_) |-> {Zero} || ({Pos},{Zero}) |-> {Zero} || ({Pos},{Pos}) |-> {Pos} || ({Pos},{Neg}) |-> {Neg} || ({Neg},{Zero}) |-> {Zero} || ({Neg},{Pos}) |-> {Neg} || ({Neg},{Neg}) |-> {Pos}}
|
| name: |
*# |
| precedence: |
no precedence defined |
| result-values: |
{Neg,Pos,Zero}
|
| signature: |
BinInt -> BinInt -> BinInt |
| solution-complete: |
operationally complete operation |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |