Browsing French translation

111.

<trademark>Scheme</trademark> was one of the first programming languages to incorporate first class procedures as in the lambda calculus, thereby proving the usefulness of static scope rules and block structure in a dynamically typed language. <trademark>Scheme</trademark> was the first major dialect of <trademark>Lisp</trademark> to distinguish procedures from lambda expressions and symbols, to use a single lexical environment for all variables, and to evaluate the operator position of a procedure call in the same way as an operand position. By relying entirely on procedure calls to express iteration, <trademark>Scheme</trademark> emphasized the fact that tail-recursive procedure calls are essentially goto's that pass arguments. <trademark>Scheme</trademark> was the first widely used programming language to embrace first class escape procedures, from which all previously known sequential control structures can be synthesized. More recently, building upon the design of generic arithmetic in <trademark>Common Lisp</trademark>, <trademark>Scheme</trademark> introduced the concept of exact and inexact numbers. <trademark>Scheme</trademark> is also the first programming language to support hygienic macros, which permit the syntax of a block-structured language to be extended reliably.