PUTCPower Up Test Call (wireless industry, cell phones)
Copyright 1988-2018 AcronymFinder.com, All rights reserved.
References in periodicals archive ?
puts (c:r) [much greater than] puts s = {definition puts (putc c [much greater than] puts r) [much greater than] puts s = {associativity [much greater than]} putc c [much greater than] (puts r [much greater than] puts s) = {inductive hypothesis} putc c [much greater than] puts (r++s) = {definition puts} putc (c: (r++s)) = {definition ++} putc ((c:r)++s) Proposition.
Here only the three monad laws are required for the proof, and we need no laws to describe the behavior of getc or putc.
echo :: IO () echo = getc [much greater than]= \c [right arrow] if (c = = `\n') then done else putc c [much greater than] echo This looks remarkably like a program in an imperative language, such as C.
puts s = prod (map putc s) [much greater than]= \_[right arrow]
Here, slightly simplified, are definitions of getc and putc.
More precisely, they have been built in to the corresponding primitives: where before one wrote getc [much greater than] = k now one writes getck k, and where before one wrote putc c [much greater than] k now one writes putcK c k.