2. R5Rs -- Overview of Scheme

Browsing

Home: | R5Rs Scheme Revised(5) Report on the Algorithmic Language Scheme
Previous chapter: | Table of contents
Next chapter: | Lexical conventions

Overview of Scheme

2.1 | Semantics
2.2 | Syntax
2.3 | Notation and terminology
| 2.3.1 | Primitive; library; and optional features
| 2.3.2 | Error situations and unspecified behavior
| 2.3.3 | Entry format
| 2.3.4 | Evaluation examples
| 2.3.5 | Naming conventions

Chapters

| Summary
| Introduction
1. | Table of contents
2. | Overview of Scheme
3. | Lexical conventions
4. | Basic concepts
5. | Expressions
6. | Program structure
7. | Standard procedures
8. | Formal syntax and semantics
9. | Concepts
10. | Variables and Procedures
| Notes
| Additional material
| Example
| Bibliography

2.1 Semantics

This section gives an overview of Scheme's semantics. A detailed informal semantics is the subject of chapters Basic concepts through Standard procedures. For reference purposes, section Formal semantics provides a formal semantics of Scheme.
Following Algol, Scheme is a statically scoped programming language. Each use of a variable is associated with a lexically apparent binding of that variable.
Scheme has latent as opposed to manifest types. Types are associated with values (also called objects) rather than with variables. (Some authors refer to languages with latent types as weakly typed or dynamically typed languages.) Other languages with latent types are APL, Snobol, and other dialects of Lisp. Languages with manifest types (sometimes referred to as strongly typed or statically typed languages) include Algol 60, Pascal, and C.
All objects created in the course of a Scheme computation, including procedures and continuations, have unlimited extent. No Scheme object is ever destroyed. The reason that implementations of Scheme do not (usually!) run out of storage is that they are permitted to reclaim the storage occupied by an object if they can prove that the object cannot possibly matter to any future computation. Other languages in which most objects have unlimited extent include APL and other Lisp dialects.
Implementations of Scheme are required to be properly tail-recursive. This allows the execution of an iterative computation in constant space, even if the iterative computation is described by a syntactically recursive procedure. Thus with a properly tail-recursive implementation, iteration can be expressed using the ordinary procedure-call mechanics, so that special iteration constructs are useful only as syntactic sugar. See section Proper tail recursion.
Scheme procedures are objects in their own right. Procedures can be created dynamically, stored in data structures, returned as results of procedures, and so on. Other languages with these properties include Common Lisp and ML. One distinguishing feature of Scheme is that continuations, which in most other languages only operate behind the scenes, also have ``first-class'' status. Continuations are useful for implementing a wide variety of advanced control constructs, including non-local exits, backtracking, and coroutines. See section Control features.
Arguments to Scheme procedures are always passed by value, which means that the actual argument expressions are evaluated before the procedure gains control, whether the procedure needs the result of the evaluation or not. ML, C, and APL are three other languages that always pass arguments by value. This is distinct from the lazy-evaluation semantics of Haskell, or the call-by-name semantics of Algol 60, where an argument expression is not evaluated unless its value is needed by the procedure.
Scheme's model of arithmetic is designed to remain as independent as possible of the particular ways in which numbers are represented within a computer. In Scheme, every integer is a rational number, every rational is a real, and every real is a complex number. Thus the distinction between integer and real arithmetic, so important to many programming languages, does not appear in Scheme. In its place is a distinction between exact arithmetic, which corresponds to the mathematical ideal, and inexact arithmetic on approximations. As in Common Lisp, exact arithmetic is not limited to integers.

2.2 Syntax

Scheme, like most dialects of Lisp, employs a fully parenthesized prefix notation for programs and (other) data; the grammar of Scheme generates a sublanguage of the language used for data. An important consequence of this simple, uniform representation is the susceptibility of Scheme programs and data to uniform treatment by other Scheme programs. For example, the `eval` procedure evaluates a Scheme program expressed as data.
The `read` procedure performs syntactic as well as lexical decomposition of the data it reads. The `read` procedure parses its input as data (section see External representation), not as program.
The formal syntax of Scheme is described in section Formal syntax.

2.3 Notation and terminology

### 2.3.1 Primitive; library; and optional features

It is required that every implementation of Scheme support all features that are not marked as being "optional". Implementations are free to omit optional features of Scheme or to add extensions, provided the extensions are not in conflict with the language reported here. In particular, implementations must support portable code by providing a syntactic mode that preempts no lexical conventions of this report.
To aid in understanding and implementing Scheme, some features are marked as "library". These can be easily implemented in terms of the other, primitive, features. They are redundant in the strict sense of the word, but they capture common patterns of usage, and are therefore provided as convenient abbreviations.

### 2.3.2 Error situations and unspecified behavior

When speaking of an error situation, this report uses the phrase ``an error is signalled'' to indicate that implementations must detect and report the error. If such wording does not appear in the discussion of an error, then implementations are not required to detect or report the error, though they are encouraged to do so. An error situation that implementations are not required to detect is usually referred to simply as ``an error.''
For example, it is an error for a procedure to be passed an argument that the procedure is not explicitly specified to handle, even though such domain errors are seldom mentioned in this report. Implementations may extend a procedure's domain of definition to include such arguments.
This report uses the phrase ``may report a violation of an implementation restriction'' to indicate circumstances under which an implementation is permitted to report that it is unable to continue execution of a correct program because of some restriction imposed by the implementation. Implementation restrictions are of course discouraged, but implementations are encouraged to report violations of implementation restrictions. For example, an implementation may report a violation of an implementation restriction if it does not have enough storage to run a program.
If the value of an expression is said to be ``unspecified,'' then the expression must evaluate to some object without signalling an error, but the value depends on the implementation; this report explicitly does not say what value should be returned.

### 2.3.3 Entry format

Chapters Expressions and Standard procedures are organized into entries. Each entry describes one language feature or a group of related features, where a feature is either a syntactic construct or a built-in procedure. An entry begins with one or more header lines of the form

`template` | `category`

for required, primitive features, or

`template` | `qualifier` `category`

where `qualifier` is either ``library'' or ``optional'' as defined in section Primitive; library; and optional features.
If `category` is ``syntax'', the entry describes an expression type, and the template gives the syntax of the expression type. Components of expressions are designated by syntactic variables, which are written using angle brackets, for example, <expression>, <variable>. Syntactic variables should be understood to denote segments of program text; for example, <expression> stands for any string of characters which is a syntactically valid expression. The notation

     <thing1> ...

indicates zero or more occurrences of a <thing>, and

     <thing1> <thing2> ...

indicates one or more occurrences of a <thing>.
If `category` is ``procedure'', then the entry describes a procedure, and the header line gives a template for a call to the procedure. Argument names in the template are `italicized`. Thus the header line

vector-ref `vector` `k` | procedure

indicates that the built-in procedure `vector-ref` takes two arguments, a vector `vector` and an exact non-negative integer `k` (see below). The header lines

make-vector `k` | procedure

make-vector `k` `fill` | procedure

indicate that the `make-vector` procedure must be defined to take either one or two arguments.
It is an error for an operation to be presented with an argument that it is not specified to handle. For succinctness, we follow the convention that if an argument name is also the name of a type listed in section Disjointness of types, then that argument must be of the named type. For example, the header line for `vector-ref` given above dictates that the first argument to `vector-ref` must be a vector. The following naming conventions also imply type restrictions:

### 2.3.4 Evaluation examples

The symbol ``=>'' used in program examples should be read ``evaluates to.'' For example,

    (* 5 8)                                =>  40

means that the expression `(* 5 8)` evaluates to the object `40`. Or, more precisely: the expression given by the sequence of characters ```(* 5 8)`'' evaluates, in the initial environment, to an object that may be represented externally by the sequence of characters ```40`''. See section External representations for a discussion of external representations of objects.

### 2.3.5 Naming conventions

By convention, the names of procedures that always return a boolean value usually end in ```?`''. Such procedures are called predicates. By convention, the names of procedures that store values into previously allocated locations (see section see Storage model) usually end in ```!`''. Such procedures are called mutation procedures. By convention, the value returned by a mutation procedure is unspecified.
By convention, ```->`'' appears within the names of procedures that take an object of one type and return an analogous object of another type. For example, `list->vector` takes a list and returns a vector whose elements are the same as those of the list.

This Scribe page has been generated by `scribeinfo`.
Last update Tue Dec 16 13:46:41 2003