Exposition Style
RFC 154
This RFC is labeled as "Legacy"; it was published before a formal source was recorded.
This RFC is not endorsed by the IETF and has no formal standing in the
IETF standards process.
| Document | Type |
RFC
- Unknown
(May 1971)
Obsoletes RFC 132
Updates RFC 107
|
|
|---|---|---|---|
| Authors | |||
| Last updated | 2013-03-02 | ||
| RFC stream | Legacy | ||
| Formats | |||
| IESG | Responsible AD | (None) | |
| Send notices to | (None) |
RFC 154
Network Working Group S. Crocker
Request for Comments: #154 UCLA
NIC: #6759 12 May 1971
Categories: C.4
Updates: #107
Obsoletes: #132
Exposition Style
As a pedagogical device for describing functions such as the one
below
|
| +-----------------
| /:
| / :
| / :
| / :
| / :
| / :
-----+------------------------------------
| a
|
where two formulae, f1 and f2, are necessary for adjoining domains but
the function is continous at the boundary point, I usually write the
description in the form
f(x) = f1(x) for x =< a
f(x) = f2(x) for x >= a
The astute reader will note that the domains overlap, but that
f1(a) = f2(a), so no semantic ambiguity obtains.
[ This RFC was put into machine readable form for entry ]
[ into the online RFC archives by Naoki Matsuhira 5/97 ]
Crocker [Page 1]