Safe Haskell | Safe-Infered |
---|
- succBB' :: Word
- plusBB' :: Word
- compare' :: Word
- clear :: Register -> LComp ()
- move :: Register -> Register -> LComp ()
- copy :: Register -> Register -> LComp ()
- compare :: Register -> Register -> LComp ()
- succBB :: Register -> LComp ()
- addBB :: Register -> Register -> LComp ()
- multBB :: Register -> Register -> LComp ()
- exptBB :: Register -> Register -> LComp ()
- double :: Register -> Register -> LComp ()
- unaryToBB :: Register -> Register -> LComp ()
- bbToUnary :: Register -> LComp ()
1# Examples
Yields the successor of the backwards-binary number in register 1.
*Language.TRM> decodeBB <$> phi succBB [(1, encodeBB 0)] Just 1 *Language.TRM> decodeBB <$> phi succBB [(1, encodeBB 119)] Just 120
Yields the sum of two backwards-binary numbers in registers 1 and 2.
*Language.TRM> decodeBB <$> phi plusBB [(1, encodeBB 2), (2, encodeBB 3)] Just 5 *Language.TRM> decodeBB <$> phi plusBB [(1, encodeBB 100), (2, encodeBB 20)] Just 120
1#L Programs
compare :: Register -> Register -> LComp ()Source
Compares the contents of the given registers for equality,
leaving a 1
in the first register if they are, or nothing
otherwise. The contents of both registers are destroyed in the
process.