!, GENERAL
| << |
/, REAL
| |||
!=, REAL
|
INT_INF
|
::, LIST
| |||
> |
WORD
|
:=, GENERAL
| |||
CHAR
| <= |
==, REAL
| |||
INTEGER
|
CHAR
|
?=, REAL
| |||
REAL
|
INTEGER
|
@, LIST
| |||
STRING
|
REAL
|
^, STRING
| |||
TIME
|
STRING
| ~ | |||
WORD
|
TIME
|
INTEGER
| |||
>>, WORD
|
WORD
|
REAL
| |||
>= | * |
WORD
| |||
CHAR
|
INTEGER
| ~>> | |||
INTEGER
|
REAL
|
INT_INF
| |||
REAL
|
WORD
|
WORD
| |||
STRING
|
*+, REAL
| ||||
TIME
|
*-, REAL
| ||||
WORD
| + | ||||
< |
INTEGER
| ||||
CHAR
|
REAL
| ||||
INTEGER
|
TIME
| ||||
REAL
|
WORD
| ||||
STRING
| - | ||||
TIME
|
INTEGER
| ||||
WORD
|
REAL
| ||||
TIME
| |||||
WORD
|
hash |
HEX, STRING_CVT
|
hup, POSIX_SIGNAL
| |||
OS_FILE_SYS
|
hkey, WINDOWS.Reg
|
hupcl, POSIX_TTY.C
| |||
OS_IO
|
home, POSIX_SYS_DB.Passwd
| ||||
hd, LIST
|
hour, DATE
|
Jan, DATE
|
joinBaseExt, OS_PATH
|
Jul, DATE
| |||
join, OPTION
|
joinDirFile, OS_PATH
|
Jun, DATE
|
K_GROUP, POSIX_PROCESS
| kill |
killpid_arg, POSIX_PROCESS
| |||
K_PROC, POSIX_PROCESS
|
POSIX_PROCESS
|
Kind, OS_IO
| |||
K_SAME_GROUP, POSIX_PROCESS
|
POSIX_SIGNAL
|
kind, OS_IO
| |||
Key, WINDOWS
|
POSIX_TTY.V
| ||||
UNIX
|
queryValue, WINDOWS.Key
| quit |
quot, INTEGER
| |||
queryValueEx, WINDOWS.Reg
|
POSIX_SIGNAL
|
quotRem, INT_INF
| |||
queue_sel, POSIX_TTY.TC
|
POSIX_TTY.V
|
xdev, POSIX_ERROR
| |
xorb | |
INT_INF
| |
WORD
|
year, DATE
|
yearDay, DATE
|
ZERO, IEEE_REAL
|
zip, LIST_PAIR
| ||
zeroTime, TIME
|
zipEq, LIST_PAIR
|
This document may be distributed freely over the internet as long as the copyright notice and license terms below are prominently displayed within every machine-readable copy.
Copyright © 2003 AT&T and Lucent Technologies. All rights reserved.
Permission is granted for internet users to make one paper copy for their
own personal use. Further hardcopy reproduction is strictly prohibited.
Permission to distribute the HTML document electronically on any medium
other than the internet must be requested from the copyright holders by
contacting the editors.
Printed versions of the SML Basis Manual are available from Cambridge
University Press.
To order, please visit
www.cup.org (North America) or
www.cup.cam.ac.uk (outside North America). |