This SRFI is currently in ``final'' status. To see an explanation of each
status that a SRFI can hold, see
here.
To
provide input on this SRFI, please
mailto:srfi minus 70 at srfi dot schemers dot org
.
See instructions
here to subscribe to the list. You can access the discussion via
the
archive of the mailing list.
You can access
post-finalization messages via
the archive of the mailing list.
Rather than create several SRFI documents which labor over semantics with and without the other numerical SRFI proposals, SRFI-70 proposes them together.
Checks for division by zero (and their absence) are one of the most common programming errors. In numerical code, the conscientious programmer must deeply nest conditionals to assure that checks for zero precede each division.
With infinities incorporated into the number system, division by zero returns an infinity rather than signaling an error. It lets initialization of variables precede bounds checks and gives flexibility in placement of those checks.
Floating-point overflow is more difficult to check for; programs often have vulnerabilities to numeric inputs in certain ranges. Because the overflow can occur in multiple places in mathematical expressions, fixing the program to run test cases which previously produced overflow errors does not guarantee that overflow from every possible input will be handled.
In an implementation supporting infinities, infinities propagate upward through most mathematical expressions. Complete input coverage can be achieved with checks at fewer points in the program than would be needed without infinities.
At least nine implementations of Scheme incorporate IEEE-754 infinities. Porting those implementations should be easy. Programs written without recourse to infinities are compatible with implementations having them; but programs using infinities will be incompatible with implementations lacking them. Thus incorporation of inexact infinities into R6RS improves portability of code written to use infinities.
`infinite?'
predicate will return `#t'
for infinities, `#f' for other numbers;`finite?'
predicate will return `#f'
for infinities, `#t' for other numbers; and
(+ 1 +inf.0) ==> +inf.0
; the only numbers which can be
their own increments are inexact numbers.
(= +inf.0 +inf.0) ==> #t (= -inf.0 +inf.0) ==> #f (= -inf.0 -inf.0) ==> #tFor any finite real number x:
(= -inf.0 x)) ==> #f (= +inf.0 x)) ==> #f (< -inf.0 x +inf.0)) ==> #t (> +inf.0 x -inf.0)) ==> #t
Chongkai Zhu points out that -inf.0 cannot be encoded by polar notation unless pi is a number in the implementation.
positive infinity | negative infinity | Scheme implementations | |
---|---|---|---|
A | +#.# | -#.# | Scm 5d7, Guile 1.3.4, Bigloo 2.5c |
B | +/0 | -/0 | |
D | #i+/0 | #i-/0 | |
E | 1/0 | -1/0 | Scm 5d8 |
F | +1/0 | -1/0 | |
G | +1/0. | -1/0. | |
H | #i1/0 | #i-1/0 | Kawa 1.7 |
I | #i+1/0 | #i-1/0 | |
J | inf.0 | -inf.0 | Elk 3.0 |
K | +inf. | -inf. | Gambit 3.0 |
L | +inf.0 | -inf.0 | Mz Scheme 202, Chez, Larceny |
M | #i+inf | #i-inf |
The unsigned notation of J does not meet the stipulations of R5RS section 2.1 "Identifiers":
... in all implementations a sequence of letters, digits, and "extended alphabetic characters" that begins with a character that cannot begin a number is an identifier.Notations K and L use `.' to indicate the inexactness of infinities. The trailing `0' of L seems superfluous, but mzscheme will not accept infinity literals without it. In mathematical parlance, "inf" stands for infimum, the greatest lower bound. These notations require extensions to R5RS number syntax.
Notations E, F, H, and I can be read in some implementations without modifying the Scheme reader. Of course in those implementations, the `1' can be replaced by any positive integer.
As Paul Schlie points out, negative infinity is just as reasonable a result of 1/0 as is positive infinity. So for output, notations F and I should be used in preference to E and H because the `+' emphasizes the sign of the positive infinity. Notations B and D eliminate the `1' for positive and negative infinities, further emphasizing the sign of the infinity.
Notation G uses a trailing `.' to indicate inexactness as K does. This requires a small extension to R5RS number syntax, as rational notation (`1/0') does not currently allow a trailing period. Notations G and K are awkward when the last word in a sentence.
SRFI 73: Exact Infinities uses notation E with a `#e' prefix. So notations E, F, and B should probably be not be used for inexact infinities to avoid confusion with SRFI-73.
Someone unfamiliar with R5RS when encountering notation D might guess that `#i' signifies an infinity. This is an improvement over notation I, which might be mistaken for a complex number.
J and K lumped with L can be considered to have a plurality among implementations incorporating infinities; so SRFI-70 specifies L. Standardizing the notation for infinities increases portability among implementations.
But what about numbers whose precision is too large to be represented? R5RS is unclear about this. Such an important property of number systems should be explicit. This SRFI assigns that responsibility for exact numbers to the programmer:
Each exact number corresponds to a single mathematical number. It is the programmer's responsibility to avoid using exact numbers with magnitude or precision too large to be represented in the implementation.Operations which would return too precise exact numbers can either return an inexact number (assuming the range of inexacts is sufficient) or report a violation of an implementation restriction.
For inexact numbers, it is the programmer's responsibility to avoid using complex numbers with magnitude too large to be represented in the implementation.With this distinction between exact and inexact numbers, the last sentence of section 6.2.1 Numerical types, which seems to imply that each internal number representation is instantiated both in exact and inexact forms, is struck:
... In order to catch uses of inexact numbers where exact numbers are required, Scheme explicitly distinguishes exact from inexact numbers.Some Scheme implementations treat an exact 0 as stronger than an inexact 0.0; returning 0 forThis distinction is orthogonal to the dimension of type.
(/ 0 0.0)
while signaling
an error for (/ 0.0 0)
. This leads to the use of
exactness coercions to select behavior of `/' and
`expt', a practice which can be very opaque.
Section 6.2.2 Exactness states:
A number is inexact if it was written as an inexact constant, if it was derived using inexact ingredients, or if it was derived using inexact operations. Thus inexactness is a contagious property of a number.But this section also states:
An operation may, however, return an exact result if it can prove that the value of the result is unaffected by the inexactness of its arguments. For example, multiplication of any number by an exact zero may produce an exact zero result, even if the other argument is inexact.By those paragraphs, inexactness is a contagious property of all numbers except 0, the only number whose exactness is contagious! To resolve this conflict, the latter two sentences are struck. This change enhances portability of programs because the exactness of mixed exactness products and quotients are specified, and no longer at the discretion of implementations.
expt
is very simple:
The simplicity is nice, but in the absence of infinities, the straightforward scheme implementation
- procedure: expt z1 z2
Returns z1 raised to the power z2:
z_1^{z_2} = e^{z_2 log z_1}
0^{0} is defined to be equal to 1.
(define (expt b x) (exp (* x (log b))))is incapable of operating when b is zero.
According to G. Sussman, the change in R5RS to
was "... attempting to follow Common Lisp and APL when it came to boundary conditions and branch cuts." That line failed in its attempt; in R5RS0^{z} is 1 if z = 0 and 0 otherwise.
(expt 0 -1) ==> 1
.
About expt
,
Common-Lisp says:
expt
is defined as b^{x} = e^{x} log b. This defines the
principal values precisely. The range of expt is the entire complex
plane. Regarded as a function of x, with b fixed, there is no branch
cut. Regarded as a function of b, with x fixed, there is in general a
branch cut along the negative real axis, continuous with quadrant II.
The domain excludes the origin. By definition, 0^{0}=1. If b=0 and the
real part of x is strictly positive, then b^{x}=0. For all other values
of x, 0^{x} is an error.
With log(0) being -inf.0, and because exp(-inf.0) is 0.0, Common-Lisp
behavior would follow from:
(define (expt b x) (exp (* x (log b))))except when b is zero.
With (log 0)
being -inf.0, the product of x and
-inf.0 determines the trajectory of exp
.
Exp
's domain repeats every 2*pi radians in the imaginary
direction. This multiplication rotates the negative real infinity.
If it rotates into a direction other than pure real, then the limit of
(exp (* b (log x)))
does not exist (because of the 2*pi
periodicity).
Common-Lisp's criterion of testing the sign of the real part of x can be seen as snapping the direction of the product to either a positive or negative real infinity.
(exp (* 1 -inf.0)) ==> 0.0 (exp (* -1 -inf.0)) ==> +inf.0Because Common-Lisp doesn't have explicit infinities, it signals an error for negative real parts of x. The Common-Lisp float behavior, except for
(expt 0.0 0.0)
, can be produced by
(define (expt z1 z2) (exp (* (if (zero? z1) (real-part z2) z2) (log z1))))
Having real infinities enables these definitions to work when
z1 is zero. Although the simpler definition is
mathematically satisfying, the "real-part" variant allows
(expt 0.0 z)
to return something other than
0/0 when the exponent has small imaginary parts due to inexact
inaccuracies.
(define (expt z1 z2) (cond ((and (exact? z2) (not (and (zero? z1) (negative? z2)))) (integer-expt z1 z2)) ((zero? z2) (+ 1 (* z1 z2))) (else (exp (* (if (zero? z1) (real-part z2) z2) (log z1))))))In the (above) definition from the reference implementation,
(expt z 0.0)
returns 1 or 1.0 when
z is finite; and 0/0 otherwise.
(expt 0.0 z)
, where z has a
negative real-part, returns +inf.0, where Common-Lisp signals an error.
Otherwise the behavior is the same as Common-Lisp's expt
.
sqrt
has been wrong since R3RS.
Prepending "For real z" to the second sentence corrects it.
These procedures implement the natural one-to-one correspondence between exact and inexact integers throughout an implementation-dependent range.But what if `inexact->exact' is passed an exact number? Writing code to test exactness before calling `inexact->exact' adds opportunities for mistakes with no compensating benefits. A paragraph is added to clarify:
`Exact->inexact' given an inexact argument returns that argument. `Inexact->exact' given an exact argument returns that argument. Thus `exact->inexact' and `inexact->exact' are idempotent.
quotient
, remainder
, and
modulo
as integer operations. They are
required to work for integers, whether exact or inexact. The use of
N for names of their arguments similarly declares
gcd
, lcm
, odd?
, and
even?
to be integer operations.
But these operations become poorly behaved for inexacts outside the range where each integer has a unique representation. For instance, all large magnitude IEEE-754 numbers are integers and even (a multiple of 2) because the radix, and hence the scaling factors, are even.
Distinguishing these functions on the basis of integer arguments overlooks their generalizations to exact rational numbers:
modulo(x/y, w/z) = modulo(lcm(y, z)*x/y, lcm(y, z)*w/z)/lcm(y, z) remainder(x/y, w/z) = remainder(lcm(y, z)*x/y, lcm(y, z)*w/z)/lcm(y, z) gcd(x/y, w/z) = gcd(x, w)/lcm(y, z) lcm(x/y, w/z) = lcm(x, w)/gcd(y, z)SRFI-70 changes the domain of
gcd
and lcm
to
exact rationals.
Common-Lisp mod and rem are general to rational and real arguments:
(mod 2/3 1/5) ==> 1/15 (mod .666 1/5) ==> 0.065999985This SRFI extends
quotient
, remainder
, and
modulo
to work for exact rationals and inexact reals.
One possibility is having those functions also convert to exact, like the Common-Lisp functions of the same names do. But implementation of the extension of `quotient', `modulo', and `remainder' to finite real numbers requires inexact `floor' and `truncate'.
To capture these common patterns of usage, `exact-round', `exact-ceiling', `exact-floor', and `exact-truncate' are added.
The first cut at names were: `round->exact', `ceiling->exact', `floor->exact', and `truncate->exact'. David Van Horn wrote:The name x->y traditionally names a function taking values of type x to type y, such as string->list. But the convention breaks here; what's a value of type floor?Per Bothner suggested the current versions: `exact-round', `exact-ceiling', `exact-floor', and `exact-truncate'.
The R5RS specification of numerical operations leads to unportable and intransparent behavior of programs. Specifically, the notion of "exact/inexact numbers" and the misleading distinction between "real" and "rational" numbers are two primary sources of confusion. Consequently, the way R5RS organizes numbers is significantly less useful than it could be. Based on this diagnosis, we propose to abandon the concept of exact/inexact numbers from Scheme altogether. In this paper, we examine designs in which exact and inexact rounding operations are explicitly separated, while there is no distinction between exact and inexact numbers. Through examining alternatives and practical ramifications, we arrive at an alternative proposal for the design of the numerical operations in Scheme.In my view the essential distinction of number-theoretic operations is that they are exact, not that they are integer as R5RS holds. This SRFI addresses the issue by extending most of the integer procedures to other numeric types. Restricting the integer operations to exact integer arguments would also work.
Cleaning up the Tower demotes the exactness property relative to types while this SRFI promotes it. Yet both find that the exactness of procedures should play a more important role in determining the exactness of numerical results.
In their proposed system:
Any program that does not contain calls to floating-point operations always computes exactly and reproducibly, independent of the Scheme implementation it runs on.This will require either
Full reproducibility will require extensive changes to R5RS:
... an exact division by zero is virtually always a symptom of a genuine programming error or of illegal input data, and the introduction of infinity will only mask this error.This is not the case in the R5RS model, where substitution of exact for inexact does not change the computation.
The advantage of returning NaN instead of raising an error is that the computation still continues, postponing the interpretation of the results to a more convenient point in the program. In this way, NaN is quite useful in numerical computations.While finding +inf.0 and -inf.0 to be very useful in computation, I cannot say the same for 0/0. It usually arises as the result of operating on a real infinity. Tolerating one error is useful; tolerating more than one error in a computation masks programming errors. That is why this SRFI leaves to the implementation whether to report a violation of an implementation restriction or return 0/0.
The problem with NaN is that the program control structure will mostly not recognize the NaN case explicitly. Assume we define comparisons with NaN always to result in #f, as IEEE 754 does, thenBecause it has no sensible place in the total-order of real numbers, 0/0 is not a real number. Thus it is an illegal argument to the comparison procedures `<', `<=', `>', and `>='.(do ((x NaN (+ x 1))) ((> x 10)))will hang but(do ((x NaN (+ x 1))) ((not (<= x 10))))will stop, which is counter-intuitive and may be surprising.
While +inf, -inf, and NaN are quite useful for inexact computations, there is a high price to pay when they are carried over into the exact world: The rational numbers must be extended by the special objects, and the usual algebraic laws will not hold for the extension anymore.This need not be the case. This "high price" is a consequence of the proposed (section 5) "type permeability" kinds #2 and #3, which prohibit exact arguments to inexact procedures.
As shown earlier, infinities are always inexact. Infinities being inexact makes detecting them in exact calculations easier. Not only will the `finite?', `rational?', and `exact?' procedures return `#f' for infinities; but passing infinities to exact-only or integer-only procedures is an error.
<real R> --> <sign> <ureal R>with the line:
<real R> --> <sign> <ureal R> | <sign> I N F . 0in order to extend number syntax to include `+inf.0' and `-inf.0'.
Here is the text proposed to replace section "6.2 Numbers" of R5RS.
Deleted text is marked with a line through it.
Additions and changes are marked in red.
Note: The type restriction for the naming convention `r' is "exact rational number":
- r, r1, ... rj, ...
- exact rational number
Numerical computation has traditionally been neglected by the Lisp community. Until Common Lisp there was no carefully thought out strategy for organizing numerical computation, and with the exception of the MacLisp system [Pitman83] little effort was made to execute numerical code efficiently. This report recognizes the excellent work of the Common Lisp committee and accepts many of their recommendations. In some ways this report simplifies and generalizes their proposals in a manner consistent with the purposes of Scheme.
It is important to distinguish between the mathematical numbers, the Scheme numbers that attempt to model them, the machine representations used to implement the Scheme numbers, and notations used to write numbers. This report uses the types number, complex, real, rational, and integer to refer to both mathematical numbers and Scheme numbers. Machine representations such as fixed point and floating point are referred to by names such as fixnum and flonum.
Mathematically, numbers may be arranged into a tower of subtypes in which each level is a subset of the level above it:
number complex real rational integer
For example, 3 is an integer. Therefore 3 is also a rational,
a real, and a complex. The same is true of the Scheme numbers
that model 3. For Scheme numbers, these types are defined by the
predicates number?
, complex?
, real?
, rational?
,
and integer?
.
There is no simple relationship between a number's type and its representation inside a computer. Although most implementations of Scheme will offer at least two different representations of 3, these different representations denote the same integer.
Scheme's numerical operations treat numbers as abstract data, as independent of their representation as possible. Although an implementation of Scheme may use fixnum, flonum, and perhaps other representations for numbers, this should not be apparent to a casual programmer writing simple programs.
It is necessary, however, to distinguish between numbers that are
represented exactly and those that may not be. For example, indexes
into data structures must be known exactly, as must some polynomial
coefficients in a symbolic algebra system. On the other hand, the
results of measurements are inherently inexact, and irrational numbers
may be approximated by rational and therefore inexact approximations.
In order to catch uses of inexact numbers where exact numbers are
required, Scheme explicitly distinguishes exact from inexact numbers.
This distinction is orthogonal to the dimension of type.
Scheme numbers are either exact or inexact. A number is exact if it was written as an exact constant or was derived from exact numbers using only exact operations. A number is inexact if it is infinite, if it was written as an inexact constant, if it was derived using inexact ingredients, or if it was derived using inexact operations. Thus inexactness is a contagious property of a number.
Each exact number corresponds to a single mathematical number. It is the programmer's responsibility to avoid using exact numbers with magnitude or precision too large to be represented in the implementation. For inexact numbers, it is the programmer's responsibility to avoid using complex numbers with magnitude too large to be represented in the implementation.
If two implementations produce exact results for a
computation that did not involve inexact intermediate results,
the two ultimate results will be mathematically equivalent. This is
generally not true of computations involving inexact numbers
since because
approximate methods such as floating point arithmetic may be used,
but it is the duty of each implementation to make the result as close as
practical to the mathematically ideal result.
Rational operations such as `+' should always produce exact results when given exact arguments. If the operation is unable to produce an exact result, then it may either report the violation of an implementation restriction or it may silently coerce its result to an inexact value. See section 6.2.3 Implementation restrictions.
With the exception of inexact->exact
,
`exact-round', `exact-ceiling',
`exact-floor', and `exact-truncate',
the operations
described in this section must
generally
return inexact results when given any inexact arguments.
An operation may, however, return an exact result if it can prove that
the value of the result is unaffected by the inexactness of its
arguments. For example, multiplication of any number by an exact zero
may produce an exact zero result, even if the other argument is
inexact.
`+inf.0' represents real numbers greater than can be encoded by finite inexacts in the implementation (> 179.76931348623157e306 for IEEE-754 64-bit flonums). `-inf.0' represents numbers less than can be encoded by finite inexacts in the implementation (< -179.76931348623157e306 for IEEE-754 64-bit flonums).
Infinities are returned by some operations which would otherwise cause errors:
division by 0.
taking logarithm of 0.
product, division, sum, difference, tangent, or exponentiation whose mathematical result is outside the range of the implementation's number formats.For any finite real number x:
(= -inf.0 x)) ==> #f (= +inf.0 x)) ==> #f (< -inf.0 x +inf.0)) ==> #t (> +inf.0 x -inf.0)) ==> #tThe notation 0/0 is used within this report to designate a numerical error-object. A numerical function may return such an object when no other number (including real infinities) is the correct value. An implementation may report a violation of an implementation restriction in any calculation for which the result would be 0/0.
Implementations of Scheme are not required to implement the whole tower of subtypes given in section 6.2.1 Numerical types, but they must implement a coherent subset consistent with both the purposes of the implementation and the spirit of the Scheme language. For example, an implementation in which all numbers are real may still be quite useful.
Implementations may also support only a limited range of numbers of any type, subject to the requirements of this section. The supported range for exact numbers of any type may be different from the supported range for inexact numbers of that type. For example, an implementation that uses flonums to represent all its inexact real numbers may support a practically unbounded range of exact integers and rationals while limiting the range of inexact reals (and therefore the range of inexact integers and rationals) to the dynamic range of the flonum format. Furthermore the gaps between the representable inexact integers and rationals are likely to be very large in such an implementation as the limits of this range are approached.
An implementation of Scheme must support exact integers
throughout the range of numbers that may be used for indexes of
lists, vectors, and strings or that may result from computing the length of a
list, vector, or string. The length
, vector-length
,
and string-length
procedures must return an exact
integer, and it is an error to use anything but an exact integer as an
index. Furthermore any integer constant within the index range, if
expressed by an exact integer syntax, will indeed be read as an exact
integer, regardless of any implementation restrictions that may apply
outside this range. Finally, the procedures listed below will always
return an exact integer result provided all their arguments are exact integers
and the mathematically expected result is representable as an exact integer
within the implementation:
+ - * quotient remainder modulo max min abs numerator denominator gcd lcm floor ceiling truncate round rationalize expt
Implementations are encouraged, but not required, to support exact integers and exact rationals of practically unlimited size and precision, and to implement the above procedures and the `/' procedure in such a way that they always return exact results when given exact arguments. If one of these procedures is unable to deliver an exact result when given exact arguments, then it may either report a violation of an implementation restriction or it may silently coerce its result to an inexact number. Such a coercion may cause an error later.
An implementation may use floating point and other approximate representation strategies for inexact numbers.
This report recommends, but does not require, that the IEEE 32-bit and 64-bit floating point standards be followed by implementations that use flonum representations, and that implementations using other representations should match or exceed the precision achievable using these floating point standards [IEEE].
In particular, implementations that use flonum representations must follow these rules: A flonum result must be represented with at least as much precision as is used to express any of the inexact arguments to that operation. It is desirable (but not required) for potentially inexact operations such as `sqrt', when applied to exact arguments, to produce exact answers whenever possible (for example the square root of an exact 4 ought to be an exact 2). If, however, an exact number is operated upon so as to produce an inexact result (as by `sqrt'), and if the result is represented as a flonum, then the most precise flonum format available must be used; but if the result is represented in some other way then the representation must have at least as much precision as the most precise flonum format available.
Although Scheme allows a variety of written notations for numbers, any particular implementation may support only some of them. For example, an implementation in which all numbers are real need not support the rectangular and polar notations for complex numbers. If an implementation encounters an exact numerical constant that it cannot represent as an exact number, then it may either report a violation of an implementation restriction or it may silently represent the constant by an inexact number.
The syntax of the written representations for numbers is described formally in section 7.1.1 Lexical structure. Note that case is not significant in numerical constants.
A number may be written in binary, octal, decimal, or hexadecimal by the use of a radix prefix. The radix prefixes are `#b' (binary), `#o' (octal), `#d' (decimal), and `#x' (hexadecimal). With no radix prefix, a number is assumed to be expressed in decimal.
A numerical constant may be specified to be either exact or inexact by a prefix. The prefixes are `#e' for exact, and `#i' for inexact. An exactness prefix may appear before or after any radix prefix that is used. If the written representation of a number has no exactness prefix, the constant may be either inexact or exact. It is inexact if it contains a decimal point, an exponent, a "#" character in the place of a digit; otherwise it is exact.
Negative infinity is written `-inf.0'. Positive infinity is written `+inf.0'.
In systems with inexact numbers of varying precisions it may be useful to specify the precision of a constant. For this purpose, numerical constants may be written with an exponent marker that indicates the desired precision of the inexact representation. The letters `s', `f', `d', and `l' specify the use of short, single, double, and long precision, respectively. (When fewer than four internal inexact representations exist, the four size specifications are mapped onto those available. For example, an implementation with two internal representations may map short and single together and long and double together.) In addition, the exponent marker `e' specifies the default precision for the implementation. The default precision has at least as much precision as double, but implementations may wish to allow this default to be set by the user.
3.14159265358979F0 Round to single --- 3.141593 0.6L0 Extend to long --- .600000000000000
The reader is referred to section 1.3.3 Entry format for a summary of the naming conventions used to specify restrictions on the types of arguments to numerical routines.
The examples used in this section assume that any numerical constant written using an exact notation is indeed represented as an exact number. Some examples also assume that certain numerical constants written using an inexact notation can be represented without loss of accuracy; the inexact constants were chosen so that this is likely to be true in implementations that use flonums to represent inexact numbers.
These numerical type predicates can be applied to any kind of argument, including non-numbers. They return #t if the object is of the named type, and otherwise they return #f. In general, if a type predicate is true of a number then all higher type predicates are also true of that number. Consequently, if a type predicate is false of a number, then all lower type predicates are also false of that number.
If z is an inexact complex number, then `(real? z)' is true if and only if `(zero? (imag-part z))' is true. If x is an inexact real number, then `(integer? x)' is true if and only if
(and (finite? x) (= x (round x)))
(complex? 3+4i) ==> #t (complex? 3) ==> #t (real? 3) ==> #t (real? -2.5+0.0i) ==> #t (real? #e1e10) ==> #t (rational? 6/10) ==> #t (rational? 6/3) ==> #t (integer? 3+0i) ==> #t (integer? 3.0) ==> #t (integer? 8/4) ==> #t (complex? +inf.0) ==> #t (real? -inf.0) ==> #t (rational? +inf.0) ==> #f (integer? -inf.0) ==> #f
Note: The behavior of these type predicates on inexact numbers is unreliable,
sincebecause any inaccuracy may affect the result.
Note: In many implementations the
rational?
procedure will be the same asreal?
, and thecomplex?
procedure will be the same asnumber?
, but unusual implementations may be able to represent some irrational numbers exactly or may extend the number system to support some kind of non-complex numbers.
These numerical predicates provide tests for the exactness of a quantity. For any Scheme number, precisely one of these predicates is true.
(exact? 5) ==> #t (inexact? +inf.0) ==> #t
These procedures return #t if their arguments are (respectively): equal, monotonically increasing, monotonically decreasing, monotonically nondecreasing, or monotonically nonincreasing.
(= +inf.0 +inf.0) ==> #t (= -inf.0 +inf.0) ==> #f (= -inf.0 -inf.0) ==> #tFor any finite real number x:
(< -inf.0 x +inf.0)) ==> #t (> +inf.0 x -inf.0)) ==> #t
These predicates are required to be transitive.
Note: The traditional implementations of these predicates in Lisp-like languages are not transitive.
Note: While it is not an error to compare inexact numbers using these predicates, the results may be unreliable because a small inaccuracy may affect the result; this is especially true of
=
andzero?
. When in doubt, consult a numerical analyst.
These numerical predicates test a number for a particular property, returning #t or #f. See note above.
(positive? +inf.0) ==> #t (negative? -inf.0) ==> #t (finite? -inf.0) ==> #f (infinite? +inf.0) ==> #t
These procedures return the maximum or minimum of their arguments.
(max 3 4) ==> 4 ; exact (max 3.9 4) ==> 4.0 ; inexactFor any real number x:
(max +inf.0 x) ==> +inf.0 (min -inf.0 x) ==> -inf.0
Note: If any argument is inexact, then the result will also be inexact (unless the procedure can prove that the inaccuracy is not large enough to affect the result, which is possible only in unusual implementations). If `min' or `max' is used to compare numbers of mixed exactness, and the numerical value of the result cannot be represented as an inexact number without loss of accuracy, then the procedure may report a violation of an implementation restriction.
These procedures return the sum or product of their arguments.
(+ 3 4) ==> 7 (+ 3) ==> 3 (+) ==> 0 (+ +inf.0 +inf.0) ==> +inf.0 (+ +inf.0 -inf.0) ==> 0/0 (* 4) ==> 4 (*) ==> 1 (* 5 +inf.0) ==> +inf.0 (* -5 +inf.0) ==> -inf.0 (* +inf.0 +inf.0) ==> +inf.0 (* +inf.0 -inf.0) ==> -inf.0 (* 0 +inf.0) ==> 0/0For any finite number z:
(+ +inf.0 z) ==> +inf.0 (+ -inf.0 z) ==> -inf.0
With two or more arguments, these procedures return the difference or quotient of their arguments, associating to the left. With one argument, however, they return the additive or multiplicative inverse of their argument.
(- 3 4) ==> -1 (- 3 4 5) ==> -6 (- 3) ==> -3 (- +inf.0 +inf.0) ==> 0/0 (/ 3 4 5) ==> 3/20 (/ 3) ==> 1/3 (/ 0.0) ==> +inf.0 (/ 1.0 0) ==> +inf.0 (/ -1 0.0) ==> -inf.0 (/ +inf.0) ==> 0.0 (/ 0 0.0) ==> 0/0 (/ 0.0 0) ==> 0/0 (/ 0.0 0.0) ==> 0/0
`Abs' returns the absolute value of its argument.
(abs -7) ==> 7 (abs -inf.0) ==> +inf.0
These procedures implement number-theoretic (integer)
division. x2 should be non-zero.
All three procedures return integers.
`quotient'
returns an integer. If x1/x2 is an integer:
(quotient x1 x2) ==> x1/x2 (remainder x1 x2) ==> 0 (modulo x1 x2) ==> 0
If x1/x2 is not an integer:
(quotient x1 x2) ==> n_q (remainder x1 x2) ==> x_r (modulo x1 x2) ==> x_m
where n_q is x1/x2 rounded towards zero, 0 < |x_r| < |x2|, 0 < |x_m| < |x2|, x_r and x_m differ from x1 by a multiple of x2, x_r has the same sign as x1, and x_m has the same sign as x2.
From this we can conclude that for integers n1 and n2 with
x2 not equal to 0,
(= x1 (+ (* x2 (quotient x1 x2)) (remainder x1 x2))) ==> #t
provided all numbers involved in that computation are exact.
(modulo 13 4) ==> 1 (remainder 13 4) ==> 1 (modulo -13 4) ==> 3 (remainder -13 4) ==> -1 (modulo 13 -4) ==> -3 (remainder 13 -4) ==> 1 (modulo -13 -4) ==> -1 (remainder -13 -4) ==> -1 (remainder -13 -4.0) ==> -1.0 ; inexact (quotient 2/3 1/5) ==> 3 (modulo 2/3 1/5) ==> 1/15 (quotient .666 1/5) ==> 3 (modulo .666 1/5) ==> 65.99999999999995e-3
These procedures return the greatest common divisor or least common multiple of their arguments. The result is always non-negative.
For exact integer arguments, these procedures are the familiar number theoretic operators:
(gcd 32 -36) ==> 4 (gcd) ==> 0 (lcm 32 -36) ==> 288 (lcm) ==> 1For exact rational arguments,
gcd
returns the largest
rational that divides into each of its arguments a whole number of
times, while lcm
returns the smallest rational that is an
integer multiple of its arguments.
(gcd 1/6 1/4) ==> 1/12 (lcm 1/6 1/4) ==> 1/2 (gcd 1/6 5/4) ==> 1/12 (lcm 1/6 5/4) ==> 5/2
These procedures return the numerator or denominator of their argument; the result is computed as if the argument was represented as a fraction in lowest terms. The denominator is always positive. The denominator of 0 is defined to be 1.
(numerator (/ 6 4)) ==> 3 (denominator (/ 6 4)) ==> 2 (denominator (exact->inexact (/ 6 4))) ==> 2.0
These procedures accept finite real numbers and return integers. `Floor' returns the largest integer not larger than x. `Ceiling' returns the smallest integer not smaller than x. `Truncate' returns the integer closest to x whose absolute value is not larger than the absolute value of x. `Round' returns the closest integer to x, rounding to even when x is halfway between two integers.
Rationale: `Round' rounds to even for consistency with the default rounding mode specified by the IEEE floating point standard.
Note: If the argument to one of these procedures is inexact, then the result will also be inexact. If an exact value is needed, the result should be passed to the `inexact->exact' procedure.
(floor -4.3) ==> -5.0 (ceiling -4.3) ==> -4.0 (truncate -4.3) ==> -4.0 (round -4.3) ==> -4.0 (floor 3.5) ==> 3.0 (ceiling 3.5) ==> 4.0 (truncate 3.5) ==> 3.0 (round 3.5) ==> 4.0 ; inexact (round 7/2) ==> 4 ; exact (round 7) ==> 7
These procedures are the compositions of `inexact->exact' with `floor', `ceiling', `truncate', and `round'.
`Rationalize' returns the simplest rational number differing from x by no more than y. A rational number r_1 is simpler than another rational number r_2 if r_1 = p_1/q_1 and r_2 = p_2/q_2 (in lowest terms) and |p_1|<= |p_2| and |q_1| <= |q_2|. Thus 3/5 is simpler than 4/7. Although not all rationals are comparable in this ordering (consider 2/7 and 3/5) any interval contains a rational number that is simpler than every other rational number in that interval (the simpler 2/5 lies between 2/7 and 3/5). Note that 0 = 0/1 is the simplest rational of all.
(rationalize (inexact->exact .3) 1/10) ==> 1/3 ; exact (rationalize .3 1/10) ==> #i1/3 ; inexact (rationalize 3 +inf.0) ==> 0
These procedures are part of every implementation that supports general real numbers; they compute the usual transcendental functions. `Log' computes the natural logarithm of z (not the base ten logarithm). `Asin', `acos', and `atan' compute arcsine (sin^{-1}), arccosine (cos^{-1}), and arctangent (tan^{-1}), respectively. The two-argument variant of `atan' computes (angle (make-rectangular x y)) (see below), even in implementations that don't support general complex numbers.
In general, the mathematical functions log, arcsine, arccosine, and
arctangent are multiply defined.
The value of log z is defined to be the one whose imaginary
part lies in the range from -pi (exclusive) to pi (inclusive).
log 0 is undefined.
With log defined this way, The values of sin^{-1} z, cos^{-1} z,
and tan^{-1} z are according to the following formulae:
sin^{-1} z = -i log (i z + sqrt(1 - z^{2}))
cos^{-1} z = pi / 2 - sin^{-1} z
tan^{-1} z = (log (1 + i z) - log (1 - i z)) / (2 i)
The above specification follows [CLtL], which in turn cites [Penfield81]; refer to these sources for more detailed discussion of branch cuts, boundary conditions, and implementation of these functions. When it is possible these procedures produce a real result from a real argument.
If the function has a real-valued limit as its argument tends toward positive infinity, then that is the value returned by the function applied to +inf.0. If the function has a real-valued limit as its argument tends toward negative infinity, then that is the value returned by the function applied to -inf.0.
(exp +inf.0) ==> +inf.0 (exp -inf.0) ==> 0.0 (log +inf.0) ==> +inf.0 (log 0.0) ==> -inf.0 (log -inf.0) ==> 0/0 (atan -inf.0) ==> -1.5707963267948965 (atan +inf.0) ==> 1.5707963267948965The functions
sin
, cos
, tan
,
asin
, and acos
either return
0/0
or report a violation of an implementation
restriction when given +inf.0
or -inf.0
as
an argument.
Returns the principal square root of z. For real z the result will have either positive real part, or zero real part and non-negative imaginary part.
(sqrt -5) ==> 0.0+2.23606797749979i (sqrt +inf.0) ==> +inf.0 (sqrt -inf.0) ==> 0/0
Returns z1 raised to the power z2.
For z_1 ~= 0
z_1^z_2 = e^z_2 log z_1
0^z is 1 if z = 0 and 0 otherwise.
0^0 is 1.
For inexact arguments not both zero
(define (expt z1 z2) (exp (* (if (zero? z1) (real-part z2) z2) (log z1))))
(expt 0.0 z)
(expt 5 3) ==> 125 (expt 5 -3) ==> 1/125 (expt 5 0) ==> 1 (expt 0 5) ==> 0 (expt 0 0) ==> 1 (expt 0 5+.0000312i) ==> 0.0 (expt 0 -5) ==> +inf.0 (expt 0 -5+.0000312i) ==> +inf.0 (expt 0 0.0) ==> 1.0 (expt 5 +inf.0) ==> +inf.0 (expt 5 -inf.0) ==> 0.0
These procedures are part of every implementation that supports general complex numbers. Suppose x1, x2, x3, and x4 are real numbers and z is a complex number such that
z = x1 + i x2 = x3 e^{i x4}
Then
(make-rectangular x1 x2) ==> z (make-polar x3 x4) ==> z (real-part z) ==> x1 (imag-part z) ==> x2 (magnitude z) ==> |x3| (angle z) ==> x_angle
where -pi < x_angle <= pi with x_angle = x4 + 2pi n for some integer n.
(angle +inf.0) ==> 0.0 (angle -inf.0) ==> 3.141592653589793
Rationale: `Magnitude' is the same as
abs
for a real argument, but `abs' must be present in all implementations, whereas `magnitude' need only be present in implementations that support general complex numbers.
`Exact->inexact' returns an inexact representation of z. The value returned is the inexact number that is numerically closest to the argument. If an exact argument has no reasonably close inexact equivalent, then a violation of an implementation restriction may be reported.
`Inexact->exact' returns an exact representation of z. The value returned is the exact number that is numerically closest to the argument. If an inexact argument has no reasonably close exact equivalent, then a violation of an implementation restriction may be reported.
These procedures implement the natural one-to-one correspondence between exact and inexact integers throughout an implementation-dependent range. See section 6.2.3 Implementation restrictions.
`Exact->inexact' given an inexact argument returns that argument. `Inexact->exact' given an exact argument returns that argument. Thus `exact->inexact' and `inexact->exact' are idempotent.
Radix must be an exact integer, either 2, 8, 10, or 16. If omitted, radix defaults to 10. The procedure `number->string' takes a number and a radix and returns as a string an external representation of the given number in the given radix such that
(let ((number number) (radix radix)) (eqv? number (string->number (number->string number radix) radix)))
is true. It is an error if no possible result makes this expression true.
If z is inexact, the radix is 10, and the above expression can be satisfied by a result that contains a decimal point, then the result contains a decimal point and is expressed using the minimum number of digits (exclusive of exponent and trailing zeroes) needed to make the above expression true [howtoprint], [howtoread]; otherwise the format of the result is unspecified.
The result returned by `number->string' never contains an explicit radix prefix.
Note: The error case can occur only when z is not a complex number or is a complex number with a non-rational real or imaginary part.
Rationale: If z is an inexact number represented using flonums, and the radix is 10, then the above expression is normally satisfied by a result containing a decimal point. The unspecified case allows for infinities, NaNs, and non-flonum representations.
Returns a number of the maximally precise representation expressed by the given string. Radix must be an exact integer, either 2, 8, 10, or 16. If supplied, radix is a default radix that may be overridden by an explicit radix prefix in string (e.g. "#o177"). If radix is not supplied, then the default radix is 10. If string is not a syntactically valid notation for a number, then `string->number' returns #f.
(string->number "100") ==> 100 (string->number "100" 16) ==> 256 (string->number "1e2") ==> 100.0 (string->number "15##") ==> 1500.0 (string->number "+inf.0") ==> +inf.0 (string->number "-inf.0") ==> -inf.0
Note: The domain of `string->number' may be restricted by implementations in the following ways. `String->number' is permitted to return #f whenever string contains an explicit radix prefix. If all numbers supported by an implementation are real, then `string->number' is permitted to return #f whenever string uses the polar or rectangular notations for complex numbers. If all numbers are integers, then `string->number' may return #f whenever the fractional notation is used. If all numbers are exact, then `string->number' may return #f whenever an exponent marker or explicit exactness prefix is used, or if a # appears in place of a digit. If all inexact numbers are integers, then `string->number' may return #f whenever a decimal point is used.
Here is code for the procedures extended from R5RS:
(define (infinite? z) (and (= z (* 2 z)) (not (zero? z)))) (define (finite? z) (not (infinite? z))) (define (ipow-by-squaring x n acc proc) (cond ((zero? n) acc) ((eqv? 1 n) (proc acc x)) (else (ipow-by-squaring (proc x x) (quotient n 2) (if (even? n) acc (proc acc x)) proc)))) (define (integer-expt x n) (ipow-by-squaring x n (if (exact? x) 1 1.) *)) (define (expt z1 z2) (cond ((and (exact? z2) (not (and (zero? z1) (negative? z2)))) (integer-expt z1 z2)) ((zero? z2) (+ 1 (* z1 z2))) (else (exp (* (if (zero? z1) (real-part z2) z2) (log z1)))))) (define integer-quotient quotient) (define integer-remainder remainder) (define integer-modulo modulo) (define (quotient x1 x2) (if (and (integer? x1) (integer? x2)) (integer-quotient x1 x2) (truncate (/ x1 x2)))) (define (remainder x1 x2) (if (and (integer? x1) (integer? x2)) (integer-remainder x1 x2) (- x1 (* x2 (quotient x1 x2))))) (define (modulo x1 x2) (if (and (integer? x1) (integer? x2)) (integer-modulo x1 x2) (- x1 (* x2 (floor (/ x1 x2)))))) (define integer-lcm lcm) (define integer-gcd gcd) (define (lcm . args) (/ (apply integer-lcm (map numerator args)) (apply integer-gcd (map denominator args)))) (define (gcd . args) (/ (apply integer-gcd (map numerator args)) (apply integer-lcm (map denominator args)))) (define (exact-round x) (inexact->exact (round x))) (define (exact-floor x) (inexact->exact (floor x))) (define (exact-ceiling x) (inexact->exact (ceiling x))) (define (exact-truncate x) (inexact->exact (truncate x)))
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.