CurryInfo: peano-1.1.0 / Data.Nat.leq

definition: Info
 
leq :: Nat -> Nat -> Bool
leq Z     _     = True
leq (S _) Z     = False
leq (S x) (S y) = leq x y
demand: Info
 argument 1
deterministic: Info
 deterministic operation
documentation: Info
 
less-or-equal predicated on natural numbers:
failfree: Info
 (_, _)
indeterministic: Info
 referentially transparent operation
infix: Info
 no fixity defined
iotype: Info
 {({Z},_) |-> {True} || ({S},{Z}) |-> {False} || ({S},{S}) |-> {False,True}}
name: Info
 leq
precedence: Info
 no precedence defined
result-values: Info
 {False,True}
signature: Info
 Nat -> Nat -> Prelude.Bool
solution-complete: Info
 operationally complete operation
terminating: Info
 yes
totally-defined: Info
 reducible on all ground data terms